Abstract
We extend the formal developments for message sequence charts (MSCs) to support scenarios with lost and found messages. We define a notion of extended compositional message sequence charts (ECM-SCs) which subsumes the notion of compositional message sequence charts in expressive power but additionally allows to define lost and found messages explicitly. As usual, ECMSCs can be combined by means of choice and repetition to (extended) compositional message sequence graphs. We show that—despite extended expressive power—model checking of monadic second-order logic (MSO) for this framework remains to be decidable. The key technique to achieve our results is to use an extended notion for linearizations.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Part of this work was done during the author’s stay at the IT department, Uppsala University, Sweden. He is grateful for the hospitality and the overall support.
The research was mainly accomplished during the author’s stay at Dept. of Computer and Information Science, University of Pennsylvania, USA, and was supported in part by NSF CCR-9988409, NSF CCR-0086147, NSF CISE-9703220, ARO DAAD19-01-1-0473, DARPA ITO MOBIES F33615-00-C-1707, and ONR N00014-97-1-0505. Additionally, the work was supported by the European Research Training Network on “Games”, HPRN-CT-2002-00283.
supported in part by “Graduiertenkolleg Leistungsgarantien für Rechnersysteme”
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Alur and M. Yannakakis. Model checking of message sequence charts. In Proc. of the 10th International Conference on Concurrency Theory, LNCS 1664, pp. 114–129. Springer, 1999.
J. Araújo. Formalizing sequence diagrams. In L. Andrade, A. Moreira, A. Deshpande, and S. Kent, editors, Proc. of the OOPSLA’ 98 Workshop on Formalizing UML. Why? How?, volume 33, 10 of A CM SIGPLAN Notices, New York, 1998. ACM Press.
B. Bollig and M. Leucker. Deciding LTL over Mazurkiewicz traces. In C. Bettini and A. Montanari, editors, Proc. of the Symposium on Temporal Representation and Reasoning (TIME’01), pp. 189–197. IEEE Computer Society Press, 2001.
B. Bollig and M. Leucker. Modelling, Specifying, and Verifying Message Passing Systems. In C. Bettini and A. Montanari, editors, Proc. of the Symposium on Temporal Representation and Reasoning (TIME’01), pp. 240–248. IEEE Computer Society Press, 2001.
B. Bollig, M. Leucker, and P. Lucas. Extending compositional message sequence graphs. Technical Report MS-CIS-02-09, University of Pennsylvania, Apr. 2002.
B. Bollig, M. Leucker, and T. Noll. Generalised regular MSC languages. In Proc. of the 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS’ 02), LNCS 2303, pp. 52–66. Springer, 2002.
W. Damm and D. Harel. LSC’s: Breathing life into message sequence charts. Technical Report CS98-09, Weizmann Institute of Science, Apr. 1998.
V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook on Formal Languages, volume III. Springer, 1997.
E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In T. Margaria and W. Yi, editors, Proc. of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS’01), LNCS 2031. Springer, Apr. 2001.
J. G. Henriksen, M. Mukund, K. N. Kumar, and P. S. Thiagarajan. On message sequence graphs and finitely generated regular msc languages. In Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP’2000), LNCS 1853, pp. 675–686. Springer, 2000.
J. G. Henriksen, M. Mukund, K. N. Kumar, and P. S. Thiagarajan. Regular collections of message sequence charts. In Proc. of 25th International Symposium on Mathematical Foundations of Computer Science (MFCS’2000), LNCS 1893, pp. 405–414. Springer, 2000.
ITU-TS. ITU-TS Recommendation Z.120anb: Formal Semantics of Message Sequence Charts. Technical report, ITU-TS, Geneva, 1998.
ITU-TS. ITU-TS Recommendation Z.120: Message Sequence Chart 1999 (MSC99). Technical report, ITU-TS, Geneva, 1999.
D. Kuske. Another step towards a theory of regular MSC languages. In Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS’02), LNCS 2285. Springer, 2002.
P. Madhusudan. Reasoning about sequential and branching behaviours of message sequence graphs. In Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP’2000), LNCS 2076. Springer, 2001.
P. Madhusudan and B. Meenakshi. Beyond message sequence graphs. In Proc. of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science, LNCS 2245, pp. 256–267. Springer, 2001.
S. Mauw and M. A. Reniers. High-level message sequence charts. In Proc. of the Eighth SDL Forum (SDL’97), pp. 291–306, 1997.
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP’2000), LNCS 1853. Springer, 2000.
R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
R. Morin. Recognizable sets of message sequence charts. In Proc. of the 19th International Symposium on Theoretical Aspects of Computer Science (STACS’02), 2002, LNCS 2285. Springer, 2002.
D. Peled. Specification and verification of message sequence charts. In Proc. IFIP FORTE/PSTV, pp. 139–154, 2000.
P. S. Thiagarajan. A trace consistent subset of PTL. In I. Lee and S. A. Smolka, editors, Proc. of the 6th International Conference on Concurrency Theory (CONCUR’95), LNCS 962, pp. 438–452, Philadelphia, Pennsylvania, 1995. Springer.
P. S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. In Proc. 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 1997. IEEE Computer Society Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollig, B., Leucker, M., Lucas, P. (2002). Extending Compositional Message Sequence Graphs. In: Baaz, M., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2002. Lecture Notes in Computer Science(), vol 2514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36078-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-36078-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00010-5
Online ISBN: 978-3-540-36078-0
eBook Packages: Springer Book Archive