Reasoning about sequential and branching behaviours of message sequence graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 809-820

  Madhusudan, P ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FLOWCHARTING; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC;

MESSAGE SEQUENCE GRAPHS; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC; SATISFIABILITY; UNFOLDINGS; MESSAGE SEQUENCE CHARTS;

MODEL CHECKING;

EID: 84879533305     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_66     Document Type: Conference Paper

References (20)

1. R. Alur, G. J. Holzmann, and D. Peled. An analyzer for message sequence charts. In Software Concepts and Tools, volume 17(2), pages 70-77, 1996.
2. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. CONCUR '99, volume 1664 of LNCS. Springer-Verlag, 1999.
3. J. R. Büchi. Weak second-order arithmetic and finite automata. In Z. Math. Logik Grundl. Math. , volume 6, pages 66-92, 1960.
4. J. R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
5. D. Caucal. On infinite transition graphs having a decidable monadic theory. In Proc. 23rd ICALP, volume 1099 of LNCS, pages 194-205. Springer-Verlag, 1996.
6. C. C. Elgot. Decision problems of finite automata and related arithmetics. In Trans. Amer. Math. Soc. , volume 98, pages 21-52, 1961.
7. J. G. Henriksen, M. Mukund, Narayan Kumar, and P. S. Thiagarajan. Towards a theory of regular MSC languages. BRICS Report RS-99-52, Department of Computer Science, Aarhus University, Denmark, 1999.
8. J. G. Henriksen, M. Mukund, Narayan Kumar, and P. S. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. ICALP '00, volume 1853 of LNCS. Springer-Verlag, 2000.
9. J. G. Henriksen, M. Mukund, Narayan Kumar, and P. S. Thiagarajan. Regular collections of Message Sequence Charts. In Proc. MFCS '00, LNCS. Springer-Verlag, 2000.
10. ITU-TS Recommendation Z. 120. Message sequence chart (MSC). ITU-TS, 1997.
11. V. Levin and D. Peled. Verification of message sequence charts via template matching. In Proc. TAPSOFT '97, volume 1214 of LNCS, pages 652-666. Springer-Verlag, 1997.
12. P. Madhusudan. Reasoning about Sequential and Branching properties of Message Sequence Graphs, Technical Report IMSC/2001/04/22, Institute of Mathematical Sciences, Chennai, India, 2001.
13. A. Muscholl and D. Peled. Message sequence charts and decision problems on Mazurkiewicz traces. In Proc. MFCS '99, volume 1672 of LNCS, pages 81-91. Springer-Verlag, 1999.
14. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In Proc. FOSSACS '98, volume 1378 of LNCS, pages 226-242. Springer-Verlag, 1998.
15. B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proc. ICALP '00, LNCS. Springer-Verlag, 2000.
16. E. Rudolph, P. Graubmann, and J. Grabowski. Tutorial on message sequence charts. In Computer Networks and ISDN Systems-SDL and MSC, Volume 28, 1996.
17. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
18. W. Thomas. Languages, automata, and logic. Handbook of Formal Language Theory, III:389-455, 1997.
19. P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. 12th IEEE Conf. on Logic in Computer Science, LNCS. Springer-Verlag, 1997.
20. I. Walukiewicz. Monadic second order logic on tree-like structures. In Proc. STACS '96, volume 1046 of LNCS. Springer-Verlag, 1996.