Skip to Main content Skip to Navigation
Habilitation à diriger des recherches

Scenario automata : theory and applications

Loïc Hélouët 1
1 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : 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 possible applications for MSCs. We consider model checking problems, that can be used to discover design errors during distributed systems specification. The second application considered is diagnosis, which allows to retreive out of a model the explanations of some partial observation of an instrumented system. Last, we consider the applicability of MSCs to the search for security breaches in distributed systems. To complete the work, we provide some conclusions on scenario models, based on the content of this document and on the experience gained these last 10 years. We then propose future research directions.
Document type :
Habilitation à diriger des recherches
Complete list of metadatas

Cited literature [126 references]  Display  Hide  Download
Contributor : Loic Helouet <>
Submitted on : Monday, January 27, 2014 - 11:29:24 AM
Last modification on : Thursday, January 7, 2021 - 4:23:48 PM
Long-term archiving on: : Sunday, April 27, 2014 - 10:16:51 PM


  • HAL Id : tel-00926742, version 1


Loïc Hélouët. Scenario automata : theory and applications. Formal Languages and Automata Theory [cs.FL]. Université Rennes 1, 2013. ⟨tel-00926742⟩



Record views


Files downloads