Generalised Regular MSC Languages-Reference-Cited by-同舟云学术

Generalised Regular MSC Languages

Published:2002 Issue: Volume: Page:52-66
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bollig Benedikt,Leucker Martin,Noll Thomas

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45931-6_5

Reference15 articles.

1. Lect Notes Comput Sci;R. Alur,1999

2. João Araújo. Formalizing sequence diagrams. In Proceedings of the OOPSLA’98 Workshop on Formalizing UML. Why? How?, volume 33, 10 of ACM SIGPLAN Notices, New York, 1998. ACM Press.

3. Benedikt Bollig and Martin Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In Claudio Bettini and Angelo Montanari, editors, Proceedings of the Symposium on Temporal Representation and Reasoning (TIME’01), pages 240–248. IEEE Computer Society Press, June 2001.

4. Benedikt Bollig, Martin Leucker, and Thomas Noll. Generalised Regular MSC Languages. Technical Report AIB-03-2002, RWTH Aachen, January 2002.

5. Volker Diekert and Yves Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer, Berlin-Heidelberg-New York, 1997.

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Pros and Cons of Netcharts;CONCUR 2004 - Concurrency Theory;2004

2. Regular Expressions for Languages over Infinite Alphabets;Lecture Notes in Computer Science;2004

3. An algebraic characterization of deterministic regular languages over infinite alphabets;Theoretical Computer Science;2003-09

4. Timed Semantics of Message Sequence Charts Based on Timed Automata;Electronic Notes in Theoretical Computer Science;2002-06

5. Extending Compositional Message Sequence Graphs;Logic for Programming, Artificial Intelligence, and Reasoning;2002