A Kleene theorem and model checking algorithms for existentially bounded communicating automata

Information and Computation

Volumn 204, Issue 6, 2006, Pages 920-956

  Genest, Blaise ^a   Kuske, Dietrich ^b   Muscholl, Anca ^c  

^a CAMPUS DE BEAULIEU   (France)

^b UNIVERSITY OF LEIPZIG   (Germany)

^c UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Communicating finite state machines; Kleene theorem; Message sequence charts; Model checking

Indexed keywords

AUTOMATA THEORY; COOPERATIVE COMMUNICATION; FORMAL LOGIC;

COMMUNICATING AUTOMATA; COMMUNICATING FINITE STATE MACHINES; KLEENE THEOREM; MESSAGE SEQUENCE CHARTS; MESSAGE SEQUENCE GRAPHS; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC;

MODEL CHECKING;

EID: 84855204486     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.01.005     Document Type: Article

References (32)

1. P. Abdulla, B. Jonsson, Verifying programs with unreliable channels, Inf. Comput. 12(2) (1996) 91-101. (Pubitemid 126411497)
2. R. Alur, M. Yannakakis. Model checking of message sequence charts, in: CONCUR'99, Lecture Notes in Computer Science, vol. 1664, 1999, pp. 114-129.
3. J. Berstel, Transductions and context-free languages, Teubner Studienbücher, Stuttgart, 1979.
4. A. Bouajjani, P. Habermehl, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, Theor. Comput. Sci. 22 (1-2) (1999) 211-250. (Pubitemid 129608967)
5. B. Boigelot, P. Godefroid, B. Willems, P. Wolper, The Power of QDDs, in: SAS'97, Lecture Notes in Computer Science, vol. 1302, 1997, pp. 172-186. (Pubitemid 127119171)
6. B. Boigelot, P. Godefroid, Symbolic verification of communication protocols with infinite state spaces using QDDs, Formal Methods Syst. Des. 1(3) (1999) 237-255.
7. B. Bollig, M. Leucker, Message-passing automata are expressively equivalent to EMSO Logic, Theor. Comput. Sci. 2006 (in press).
8. (An extended abstract appeared under the same title in CONCUR'04, Lecture Notes in Computer Science, vol. 3170, 2004, pp. 146-160).
9. D. Brand, P. Zafiropulo, On communicating finite-state machines, J. ACM 3(2) (1983) 323-342.
10. in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, 1995.
11. W. Ebinger, A. Muscholl, Logical definability on infinite traces, Theor. Comput. Sci. 154(1996) 67-84 (Pubitemid 126411921)
12. (An extended abstract appeared under the same title in ICALP'93, LNCS 700, pp. 335-346, 1993).
13. A. Finkel, Ph. Schnoebelen, Well-structured transition systems everywhere!, Theor. Comput. Sci. 256 (1, 2) (2001) 63-92. (Pubitemid 32666102)
14. E. Gunter, A. Muscholl, D. Peled, Compositional message sequence charts, International Journal on Software Tools for Technology Transfer (STTT) (1) (2003) 78-89
15. (An extended abstract appeared in TACAS'01, LNCS 2031, pp. 496-511, 2001).
16. B. Genest, A. Muscholl, H. Seidl, M. Zeitoun, Infinite-state High-level MSCs: model checking and realizability, in: ICALP'02, Lecture Notes in Computer Science, vol. 2380, 2002, pp. 657-668. Journal version in Journal of Computer and System Sciences (2006), in press.
17. J. G. Henriksen, M. Mukund, K. Narayan Kumar, M. Sohoni, P. Thiagarajan, A theory of regular MSC languages, Inf. Comput. 20(1) (2005) 1-38. (Pubitemid 41328759)
18. ITU-TS recommendation Z.120, Message Sequence Charts, Geneva, 1999.
19. D. Kuske, Regular sets of infinite message sequence charts, Inf. Comput. 187(2003) 80-109.
20. M. Lohrey, A. Muscholl, Bounded MSC communication, Inf. Comput. 189(2004) 135-263.
21. S. Leue, R. Mayr, W. Wei, A scalable incomplete test for the boundedness of UML RT models, in: TACAS'04, Lecture Notes in Computer Science, vol. 2988, 2004, pp. 327-341.
22. A. R. Meyer, Weak monadic second order theory of one successor is not elementary recursive, in: Proc. Logic Colloquium, Lecture Notes in Mathematics, vol. 453, Springer, 1975, pp. 132-154.
23. R. Morin, Recognizable sets of message sequence charts, in: STACS'02, Lecture Notes in Computer Science, vol. 2285, 2002, pp. 523-534.
24. P. Madhusudan, Reasoning about sequential and branching behaviours of message sequence graphs, in: ICALP'01, Lecture Notes in Computer Science, vol. 2076, 2001, pp. 809-820. (Pubitemid 33300849)
25. P. Madhusudan, B. Meenakshi, Beyond message sequence graphs, in: FSTTCS'01, Lecture Notes in Computer Science, vol. 2245, 2001, pp. 256-267. (Pubitemid 33371168)
26. A. Mazurkiewicz, Concurrent program schemes and their interpretation, Technical report, DAIMI Report PB-78, Aarhus University, 1977.
27. A. Muscholl, D. Peled, Message sequence graphs and decision problems on Mazurkiewicz traces, in: MFCS'99, Lecture Notes in Computer Science, vol. 1672, 1999, pp. 81-91.
28. E. Ochmański, Regular behaviour of concurrent systems, in: Bulletin of the EATCS 27, 1985, pp. 56-67.
29. Ph. Schnoebelen, Verifying lossy channel systems has nonprimitive recursive complexity, Inf. Process. Lett. 8(5) (2002) 251-261. (Pubitemid 34704431)
30. USB 1.1 specification. .
31. W. Thomas, On logical definability of trace languages, in: V. Diekert (Ed.), Proceedings of a workshop of the ESPRIT BRA No. 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, 1990, pp. 172-182.
32. W. Zielonka, Notes on finite asynchronous automata, R. A. I. R. O.-Inf. Théor. Appl. 21(1987) 99-135.