Scenario automata : theory and applications
type: Dataset
description: Partial order automata are more known under their standardized name "'Message Sequence Charts (MSCs). They have met a considerable interest during the last 15 years. This success is both industrial and academic, and has several reasons. First, the model is rather simple and can be learned very easily by engineers. Second, despite its apparent simplicity (MSCs are for instance more expressive than finite state automata), it has an interesting expressive power, and raises many difficult problems. Indeed, many algorithmic applications rapidly turn to be undecidable problems. In this document, we collect and sumarize a part of the work accomplished on MSCS during the last decade, and draw some conclusions from the obtained results. We first focus on formal properties of MSCs, the decidability of several standard problems, and the definition of subclasses of the language allowing for the decision of some problems when the general case is undecidable. The standard approach to work with MSCs is to find the larger subclass of the language allowing for the decision of a given problem. Another challenge is to increase the expressive power of MSCs without loosing decidability of too many problems. We propose several extensions to the formalism allowing dynamic creation of processes, or allowing for the design of protocols comporting sliding windows behaviors. As many formal models, MSCs can not exceed a limit size after which a diagram is not understandable for a human designer. A solution is then to build a specifcation in a modular way, and then to assemble the modules to obtain larger sets of behaviors. We propose several mechanisms to compose MSCs, and study the robustness of MSC sub-classes to composition. We then draw some conclusions from the properties of composition mechanisms described in this part of the document. Overall, composition is seldomly effective, and does not preserve formal properties of partial order automata. In a second part of this document, we study…
landing page: https://theses.hal.science/tel-00926742
keyword: accreditation-to-supervise-research
keyword: automates-de-scenarios
keyword: distributed-systems
keyword: infoeu-reposemanticsother
keyword: infoinfo-flcomputer-science-csformal-languages-and-automata-theory-csfl
keyword: ordres-partiels
keyword: partial-orders
keyword: scenario-automata
keyword: systemes-distribues
issued: 2026-05-07T13:35:10.262808
modified: 2026-05-07T13:35:10.262814
language: en
contact point: Organization
  fn: CCSD

test_moissonnage_selune
type: Agent

Scenario automata : theory and applications
type: Distribution
format: HTML
access URL: https://theses.hal.science/tel-00926742
issued: 2026-05-07T13:35:10.270975
modified: 2026-05-07T13:35:10.253419