From finite state communication protocols to high-level message sequence charts

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

Volumn 2076 LNCS, Issue , 2001, Pages 720-731

  Muscholl, Anca ^a   Peled, Doron ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Bunded automata; HMSC; Message sequence charts; Prtial order specification; Secification

Indexed keywords

FLOWCHARTING; POLYNOMIAL APPROXIMATION; REVERSE ENGINEERING; SEMANTICS; SPECIFICATIONS; COMPUTATIONAL LINGUISTICS;

BUNDED AUTOMATA; FINITE STATE SYSTEMS; HIGH LEVEL MESSAGE SEQUENCE CHARTS; HMSC; MESSAGE SEQUENCE CHARTS; NATURAL PROPERTIES; PARTIAL ORDER SEMANTICS; SECIFICATION; BOUNDED AUTOMATA; PARTIAL ORDER;

TRANSLATION (LANGUAGES);

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

References (8)

1. R. Alur, R. K. Brayton, T. A. Henzinger, S. Qadeer, and S. K. Rajamani. Partial order reduction in symbolic state space exploration. In Proc. of CAV'97, LNCS 1254, pp. 340-351, 1997.
2. R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. of CONCUR'99, LNCS 1664, 1999.
3. E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In Proc. of TACAS'2001, LNCS 2031, pp. 496-511, 2001.
4. L. H́eloüet and P. Le Maigat. Decomposition of Message Sequence Charts. In Proc. of the 2nd Workshop on SDL and MSC (SAM'2000), pages 46-60, 2000.
5. J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In Proc. of ICALP'2000, LNCS 1853, pages 675-686, 2000.
6. A. Muscholl. Uber die Erkennbarkeit unendlicher Spuren. Teubner, 1996.
7. A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In Proc. of MFCS'99, LNCS 1672, pp. 81-91, 1999.
8. D. A. Peled, T. Wilke, and P. Wolper. An algorithmic approach for checking closure properties of temporal logic specifications and omega-regular languages. Theoretical Computer Science, 195(2):183-203, 1998.