Verification of message sequence charts via template matching

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

Volumn 1214, Issue , 1997, Pages 652-666

  Levin, Vladimir ^a   Peled, Doron ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOWCHARTING; GRAPHIC METHODS; SOFTWARE DESIGN;

LOW-LEVEL DESIGNS; MESSAGE SEQUENCE CHARTS; PARTIAL INFORMATION;

TEMPLATE MATCHING;

EID: 84957027637     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030632     Document Type: Conference Paper

References (12)

1. R. Alur, G.J. Holzmann, D. Peled, An Analyzer for Message Sequence Charts, Software Concepts and Tools, Vol. 17, No. 2, 1996, pp 70-77.
2. E. Best, R. Devillers, Sequential and concurrent behaviour in Petri Net theory, Theoretical Computer Science 55 (1987), 87-136.
3. Tz. Elrad, N. Francez, Decomposition of distributed programs into communication closed layers, Science of Computer Programming 2 (1982), 155-173.
4. G.J. Holzmann Early Fault Detection Tools, Software Concepts and Tools, Vol. 17, No. 2, 1996, 63-69.
5. ITU-T Recommendation Z.120, Message Sequence Chart (MSC), March 1993.
6. W. Janssen, J. Zwiers, Protocol design by layered decomposition, a compositional approach, Proceedings of formal techniques in real-time and fault-tolerance systems 1992, LNCS 571, Springer, 307-326.
7. R.P. Kurshan, Computer-Aided Verification, Princeton University Press, 1994.
8. S.C. Kleene, Representation of events in nerve nets and finite automata, Automata Studies, annals of math studies 34, Princeton University Press, 1956.
9. A. Mazurkiewicz, Trace theory, Advanced course on Petri nets, Bad Honnef, Germany, 1987, LNCS 254, 269-324.
10. M. Nielsen, G. Plotkin, G. Winskel, Petri Nets, Event Structures and Domains, Part I, Theoretical Computer Science 13(1981), 85-108.
11. V. Pratt, Modeling concurrency with partial orders, International Journal of Parallel Programming 15 (1986), 33-71.
12. W. J. Savitch. Relationship between nondeterministic and deterministic tape complexities. J. on Computer and System Sciences, 4 (1970), 177-192.