Infinite-state high-level MSCs: Model-checking and realizability

Journal of Computer and System Sciences

Volumn 72, Issue 4, 2006, Pages 617-647

  Genest, Blaise ^a   Muscholl, Anca ^a   Seidl, Helmut ^b   Zeitoun, Marc ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

Communicating automata; Concurrency; Model checking; MSC; Synthesis

Indexed keywords

AUTOMATA THEORY; PROBLEM SOLVING; SPECIFICATIONS; SYNTACTICS;

COMMUNICATING AUTOMATA; CONCURRENCY; MODEL-CHECKING; MSC;

MATHEMATICAL MODELS;

EID: 33646164193     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2005.09.007     Document Type: Article

References (30)

1. Alur R., Etessami K., and Yannakakis M. Inference of message sequence charts. Proc. of the 22nd International Conference on Software Engineering (2000), ACM Press, Limerick, Ireland 304-313
2. Alur R., Etessami K., and Yannakakis M. Realizability and verification of MSC graphs. Theoret. Comput. Sci. 331 1 (2005) 97-114
3. Alur R., Holzmann G.H., and Peled D.A. An analyzer for message sequence charts. Softw. Concepts Tools 17 2 (1996) 70-77
4. Alur R., and Yannakakis M. Model checking of message sequence charts. Proc. of the 10th International Conference on Concurrency Theory. CONCUR'99, Eindhoven, The Netherlands. Lecture Notes in Comput. Sci. vol. 1664 (1999), Springer 114-129
5. Brand D., and Zafiropulo P. On communicating finite-state machines. J. Assoc. Comput. Mach. 30 2 (1983) 323-342
6. B. Caillaud, Ph. Darondeau, L. Hélouët, G. Lesventes, HMSCs as partial specifications...with PNs as completions, in: Modeling and Verification of Parallel Processes, 4th Summer School, MOVEP'00, Nantes, France, 2000, pp. 125-152
7. In: Diekert V., and Rozenberg G. (Eds). The Book of Traces (1995), World Scientific
8. Genest B., Kuske D., and Muscholl A. A Kleene theorem for a class of communicating automata with effective algorithms. Developments in Language Theory. New Zealand, Auckland. Lecture Notes in Comput. Sci. vol. 3340 (2004), Springer 30-48
9. Genest B., and Muscholl A. Pattern matching and membership for hierarchical message sequence charts. Proc. of the 5th Symposium Latin American Theoretical INformatics. LATIN'02, Cancún, Mexico. Lecture Notes in Comput. Sci. vol. 2286 (2002), Springer 326-340
10. Genest B., Muscholl A., Seidl H., and Zeitoun M. Infinite-state high level MSCs: realizability and model-checking. In: Widmayer P., et al. (Ed). Proc. of the 29th International Colloquium on Automata, Languages and Programming. ICALP'02, Malaga, Spain. Lecture Notes in Comput. Sci. vol. 2380 (2002), Springer 657-668
11. Harel D., and Kugler H. Synthesizing state-based object systems from lsc specifications. Internat. J. Found. Comput. Sci. 13 1 (2002) 5-51
12. L. Hélouët, C. Jard, Conditions for synthesis of communicating automata from HMSCs, in: A. Rennoch (Ed.), 5th Int. Workshop on Formal Methods for Industrial Critical Systems, Berlin, Germany, 2000, pp. 203-224
13. L. Hélouët, P. Le Maigat, Decomposition of message sequence charts, in: Proc. of the 2nd Workshop on SDL and MSC, SAM'00, Grenoble, France, 2000, pp. 46-60
14. Henriksen J.G., Mukund M., Kumar K.N., and Thiagarajan P.S. On message sequence graphs and finitely generated regular MSC languages. Proc. of the 27th International Colloquium on Automata, Languages and Programming. ICALP'00, Geneva, Switzerland. Lecture Notes in Comput. Sci. vol. 1853 (2000) 675-686
15. ITU-TS, Recommendation Z.120, Message Sequence Chart (MSC), ITU-TS, Geneva, Switzerland, 1996
16. ITU-TS, Recommendation Z.100, Specification and Description Language (SDL), ITU-TS, Geneva, Switzerland, 1999
17. Krüger I., Grosu R., Scholz P., and Broy M. From MSCs to statecharts. In: Rammig F. (Ed). Proc. of the IFIP WG10.3/WG10.5 International Workshop on Distributed and Parallel Embedded Systems. DIPES'98, Schloß Eringerfeld, Germany (1999), Kluwer Academic 61-71
18. Kupferman O., and Vardi M. Synthesizing distributed systems. Proc. of the IEEE Symposium on Logic in Computer Science. LICS'01, Boston University, USA (2001), IEEE Computer Society Press 389-398
19. Lohrey M. Safe realizability of high-level message sequence charts. In: Brim L., et al. (Ed). Proc. of the 13th International Conference on Concurrency Theory. CONCUR'02, Brno, Czech Republic. Lecture Notes in Comput. Sci. vol. 2421 (2002), Springer 177-192
20. Madhusudan P. Reasoning about sequential and branching behaviours of message sequence graphs. In: Orejas F., et al. (Ed). Proc. of the 28th International Colloquium on Automata, Languages and Programming. ICALP'01, Heraklion, Crete, Greece. Lecture Notes in Comput. Sci. vol. 2076 (2001), Springer 809-820
21. Madhusudan P., and Thiagarajan P.S. Distributed controller synthesis for local specifications. In: Orejas F., et al. (Ed). Proc. of the 28th International Colloquium on Automata, Languages and Programming. ICALP'01, Heraklion, Crete, Greece. Lecture Notes in Comput. Sci. vol. 2076 (2001), Springer 396-407
22. A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Report PB 78, Aarhus University, Aarhus, 1977
23. Métivier Y. On recognizable subsets of free partially commutative monoids. Theoret. Comput. Sci. 58 (1988) 201-208
24. Morin R. Recognizable sets of message sequence charts. Proc. of the 19th Annual Symposium on Theoretical Aspects of Computer Science. STACS'02, Antibes, France. Lecture Notes in Comput. Sci. vol. 2285 (2002), Springer 523-534
25. Mukund M., Narayan Kumar K., and Sohoni M. Synthesizing distributed finite-state systems from MSCs. In: Palamidessi C. (Ed). Proc. of the 11th International Conference on Concurrency Theory. CONCUR'00, University Park, USA. Lecture Notes in Comput. Sci. vol. 1877 (2000), Springer 521-535
26. Muscholl A., and Peled D. Message sequence graphs and decision problems on Mazurkiewicz traces. In: Kutylowski M., and Pacholski L. (Eds). Proc. of the 24th Symposium on Mathematical Foundations of Computer Science. MFCS'99, Szklarska Poreba, Poland. Lecture Notes in Comput. Sci. vol. 1672 (1999), Springer 81-91
27. Ochmanski E. Recognizable trace languages. Chapter 6. In: Diekert V., and Rozenberg G. (Eds). The Book of Traces (1995), World Scientific 167-204
28. D. Peled, Specification and verification of message sequence charts, in: Proc. of Formal Techniques for Distributed System Development, FORTE/PSTV'00, Pisa, Italy, 2000, pp. 139-154
29. Pnueli A., and Rosner R. Distributed reactive systems are hard to synthesize. Proc. of the 31th IEEE Symposium on Foundations of Computer Science. FOCS'90, St. Louis, Missouri (1990), IEEE Computer Society Press 746-757
30. USB Core team, Universal Serial Bus specification, Revision 1.1, September 1998. URL http://www.usb.org/developers/docs/usbspec.zip