Specifying and verifying partial order properties using template MSCs

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

Volumn 2987, Issue , 2004, Pages 195-210

  Genest, Biaise ^a   Minea, Marius ^b   Muscholl, Anca ^c,d   Peled, Doron ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b Pi Jussieu Case 7014   (France)

^c POLITEHNICA UNIVERSITY OF TIMISOARA   (Romania)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FLOWCHARTING;

GRAPHICAL LANGUAGES; LOGICAL FORMULAS; MESSAGE SEQUENCE CHARTS; MODEL CHECKING PROBLEM; MODEL SYSTEM; PARTIAL ORDER;

MODEL CHECKING;

EID: 35048826261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_15     Document Type: Article

References (18)

1. ITU-TS recommendation Z.120, Message Sequence Charts, Geneva, 1999.
2. R. Alur and K. Etessami, and M. Yannakakis. Readability and verification of MSC graphs. In ICALP'01, LNCS 2076, pp. 797-808, 2001.
3. R. Alur and K. McMillan and D. Peled. Deciding global partial-order properties In ICALP'98, LNCS 1443, pp. 41-52, 1998.
4. W. Damm and D. Harel. LSCs: Breathing life into Message Sequence Charts. Formal Methods in System Design 19(1): 45-80 (2001).
5. V. Diekert, P. Gastin. LTL is expressively complete for Mazurkiewicz traces. In JCSS64(2): 396-418, 2002
6. B. Genest, A. Muscholl. Pattern Matching and Membership for Hierarchical Message Sequence Charts. In LATIN'02, LNCS 2286, pp. 326-340, 2002.
7. E. Gunter, A. Muscholl, and D. Peled. Compositional Message Sequence Charts. In TACAS'01, pp. 496-511. LNCS 2031, 2001.
8. H. Liu, C. Wrathall and K. Zeger. Efficient Solution of Some Problems in Free Partially Commutative Monoids. Inf. and Comp., 89:180-198, 1990.
9. D. Harel and H. Kugler. Synthesizing State-Based Object Systems from LSC Specifications. In International Journal of Foundations of Computer Science 13(1): 5-51, 2002.
10. J. G. Henriksen, M. Mukund, K. Narayan Kumar, and P. Thiagarajan. On message sequence graphs and finitely generated regular MSC languages. In ICALP'00, LNCS 1853, pp 675-686, 2000.
11. P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In ICALP'01, LNCS 2076, pp. 809-820, 2001.
12. M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Netcharts: bridging the gap between HMSCs and executable specifications. In CONCUR'03, LNCS 2761, pp 296-310, 2003.
13. P. Madhusudan, and B. Meenakshi. Beyond Message Sequence Graphs. In FSTTCS'Ol, LNCS 2245, pp 256-267, 2001.
14. A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS'99, LNCS 1672, pp. 81-91, 1999.
15. A. Muscholl, D. Peled, and Z. Su. Deciding properties for Message Sequence Charts. In FoSSaCS'98, LNCS 1378, pp. 226-242, 1998.
16. B. Sengupta and R. Cleaveland. Triggered Message Sequence Charts. In SIGSOFT 2002/FSE-10, ACM Press, 2002.
17. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic. In Information and Computation, 179(2): 230-249, 2002.
18. I. Walukiewicz. Difficult configurations - On the complexity of LTrL. In ICALP '98, LNCS 1443, pp. 140-151, 1998.