Message-passing automata are expressively equivalent to EMSO logic

Theoretical Computer Science

Volumn 358, Issue 2-3, 2006, Pages 150-172

  Bollig, Benedikt ^a   Leucker, Martin ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Concurrency; Message sequence charts; Message passing automata; Monadic second order logic

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; CONCURRENCY CONTROL; FORMAL LOGIC; HIERARCHICAL SYSTEMS;

CONCURRENCY; MESSAGE SEQUENCE CHARTS; MESSAGE-PASSING AUTOMATA; MONADIC SECOND-ORDER LOGICS;

INFORMATION DISSEMINATION;

EID: 33745886096     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.01.014     Document Type: Article

References (30)

1. Alur R., Etessami K., and Yannakakis M. Inference of message sequence charts. Proc. 22nd Internat. Conf. on Software Engineering. ACM, New york (2000)
2. R. Alur, K. Etessami, M. Yannakakis. Realizability and verification of MSC graphs, in: Proc. 28th Internat. Colloq. on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001.
3. R. Alur, M. Yannakakis, Model checking of message sequence charts, in: Proc. 10th Internat. Conf. on Concurrency Theory (CONCUR 1999), Lecture Notes in Computer Science, Vol. 1664, Springer, Berlin, 1999.
4. H. Ben-Abdallah, S. Leue, Syntactic detection of process divergence and non-local choice in message sequence charts, in: Proc. Third Internat. Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS 1997), Lecture Notes in Computer Science, Vol. 1217, Springer, Berlin, 1997.
5. Brand D., and Zafiropulo P. On communicating finite-state machines. J. ACM 30 2 (1983)
6. Büchi J. Weak second order logic and finite automata. Z. Math. Logik, Grundlag. Math. 5 (1960) 62-66
7. Courcelle B. The monadic second order logic of graphs I: recognizable sets of finite graphs. Inform. and Comput. 85 (1990) 12-75
8. Elgot C.C. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98 (1961) 21-52
9. B. Genest, L'Odyssée des Graphes de Diagrammes de Séquences (MSC-Graphes), Ph.D. Thesis, Laboratoire d'Informatique Algorithmique: Fondements et Applications (LIAFA), 2004.
10. B. Genest, D. Kuske, A. Muscholl, A Kleene theorem for a class of communicating automata with effective algorithms, in: Proc. Eighth Internat. Conf. on Developments in Language Theory (DLT 2004), Lecture Notes in Computer Science, Vol. 3340, Springer, Berlin, 2004.
11. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun, Infinite-state high-level MSCs: model-checking and realizability, in: Proc. 29th Internat. Colloq. on Automata, Languages and Programming (ICALP 2002), Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002.
12. Hanf W.P. Model-theoretic methods in the study of elementary logic. In: Addison J.W., Henkin L., and Tarski A. (Eds). The Theory of Models (1965), North-Holland, Amsterdam
13. Henriksen J.G., Mukund M., Narayan Kumar K., Sohoni M., and Thiagarajan P.S. A theory of regular MSC languages. Inform. and Comput. 202 1 (2005) 1-38
14. J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan, On message sequence graphs and finitely generated regular MSC languages, in: Proc. 27th Internat. Colloq. on Automata, Languages and Programming (ICALP 2000), Geneva, Switzerland, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000.
15. J.G. Henriksen, M. Mukund, K. Narayan Kumar, P.S. Thiagarajan, Regular collections of message sequence charts, in: Proc. 25th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS 2000), Lecture Notes in Computer Science, Vol. 1893, Springer, Berlin, 2000.
16. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99), 1999.
17. Kuske D. Regular sets of infinite message sequence charts. Inform. and Comput. 187 (2003) 80-109
18. Lohrey M. Realizability of high-level message sequence charts: closing the gaps. Theoret. Comput. Sci. 309 1-3 (2003) 529-554
19. Lohrey M., and Muscholl A. Bounded MSC communication. Inform. and Comput. 189 2 (2004) 160-181
20. P. Madhusudan, Reasoning about sequential and branching behaviours of message sequence graphs, in: Proc. 28th Internat. Colloq. on Automata, Languages and Programming (ICALP 2001), Lecture Notes in Computer Science, Vol. 2076, Springer, Berlin, 2001.
21. P. Madhusudan, B. Meenakshi, Beyond message sequence graphs, in: Proc. 21st Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), Lecture Notes in Computer Science, Vol. 2245, Springer, Berlin, 2001.
22. Matz O., Schweikardt N., and Thomas W. The monadic quantifier alternation hierarchy over grids and graphs. Inform. and Comput. 179 2 (2002)
23. Matz O., and Thomas W. The monadic quantifier alternation hierarchy over graphs is infinite. Proc. 12th Annu. IEEE Symp. on Logic in Computer Science (LICS 1997) (1997), IEEE Computer Society Press, Silver Spring, MD
24. R. Morin, Recognizable sets of message sequence charts, in: Proc. 19th Annu. Symp. on Theoretical Aspects of Computer Science (STACS 2002), Antibes-Juan les Pins, France, March 14-16, Lecture Notes in Computer Science, Vol. 2285, Springer, Berlin, 2002.
25. M. Mukund, K. Narayan Kumar, M. Sohoni, Synthesizing distributed finite-state systems from MSCs, in: Proc. 11th Internat. Conf. on Concurrency Theory (CONCUR 2000), Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000.
26. A. Muscholl, D. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: Proc. 24th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS 1999), Lecture Notes in Computer Science, Vol. 1672, Springer, Berlin, 1999.
27. W. Thomas, On logics, tilings, and automata, in: Proc. 18th Internat. Colloq. on Automata, Languages and Programming (ICALP 1991), Lecture Notes in Computer Science, Vol. 510, Springer, Berlin, 1991.
28. Thomas W. Elements of an automata theory over partial orders. Proc. Workshop on Partial Order Methods in Verification (POMIV 1996), DIMACS Vol. 29 (1996), American Mathematical Society, Providence RI
29. W. Thomas, Automata theory on trees and partial orders, in: Proc. TAPSOFT 1997: Theory and Practice of Software Development, Seventh Internat. Joint Conf. CAAP/FASE, Lecture Notes in Computer Science, Vol. 1214, Springer, Berlin, 1997.
30. Thomas W. Languages, automata and logic. In: Salomaa A., and Rozenberg G. (Eds). Handbook of Formal Languages, Beyond Words Vol. 3 (1997), Springer, Berlin