Abstract
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently through algebraic approaches or relationships to Mazurkiewicz trace theory. We show how to check whether a rational language of MSCs requires only channels of finite capacity. In that case, we also provide an upper bound for the size of the channels. This enables us to prove our main result: one can decide whether the iteration of a given regular language of MSCs is regular if, and only if, the Star Problem in trace monoids (over some restricted independence alphabets) is decidable too.
Supported by PROCOPE.
Chapter PDF
Similar content being viewed by others
References
Alur R. and Yannakakis M.: Model Checking of Message Sequence Charts. CONCUR’99, LNCS 1664 (1999) 114–129
Arnold A.: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355–393
Ben-Abdallah H. and Leue S.: Syntactic Analysis of Message Sequence Chart Specifications. Technical report 96-12 (University of Waterloo, Canada, 1996)
Ben-Abdallah H. and Leue S.: Syntactic Detection of Process Divergence and Non-local Choice in Message Sequence Charts. TACAS’97, LNCS 1217 (1997) 259–274
Booch G., Jacobson I. and Rumbough J.: Unified Modelling Language User Guide. (Addison-Wesley, 1997)
Büchi J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6 (1960) 66–92
Caillaud B., Darondeau Ph., Hélouët L. and Lesventes G.: HMSCs as partial specifications... with PNs as completions. Proc. of MOVEP’2k, Nantes (2000) 87–103
Cori R., Métivier Y. and Zielonka W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106 (1993) 159–202
Diekert V. and Rozenberg G.: The Book of Traces. (World Scientific, 1995)
Droste M. and Kuske D.: Logical definability of recognizable and aperiodic languages in concurrency monoids. LNCS 1092 (1996) 233–251
Ebinger W. and Muscholl A.: Logical definability on infinite traces. Theoretical Comp. Science 154 (1996) 67–84
Gastin P., Ochmański E., Petit A. and Rozoy, B.: On the decidability of the star problem. Information Processing Letters 44 (1992) 65–71
Gunter E.L., Muscholl A. and Peled D.: Compositional Message Sequence Charts. TACAS 2001, LNCS (2001)-To appear.
Hélouët L., Jard C. and Caillaud B.: An effective equivalence for sets of scenarios represented by HMSCs. Technical report, PI-1205 (IRISA, Rennes, 1998)
Henriksen J.G, Mukund M., Narayan Kumar, K. and Thiagarajan P.S.: Towards a theory of regular MSC languages. Technical report (BRICS RS-99-52, 1999)
Henriksen J.G., Mukund M., Narayan Kumar K. and Thiagarajan P.S.: On message sequence graphs and finitely generated regular MSC language. LNCS 1853 (2000) 675–686
Henriksen J.G., Mukund M., Narayan Kumar K. and Thiagarajan P.S.: Regular collections of message sequence charts. MFCS 2000, LNCS 1893 (2000) 405–414
Holzmann G.J.: Early Fault Detection. TACAS’96, LNCS 1055 (1996) 1–13
Husson J.-Fr. and Morin R.: On Recognizable Stable Trace Languages. FoSSaCS 2000, LNCS 1784 (2000) 177–191
ITU-TS: Recommendation Z.120: Message Sequence Charts. (Geneva, 1996)
Kirsten D. and Richomme G.: Decidability Equivalence Between the Star Problem and the Finite Power Problem in Trace Monoids. Technical Report ISSN 1430-211X, TUD/FI99/03 (Dresden University of Technology, 1999)
Kuske D. and Morin R.: Pomsets for Local Trace Languages: Recognizability, Logic and Petri Nets. CONCUR 2000, LNCS 1877 (2000) 426–441
Lamport L.: Time, Clocks and the Ordering of Events in a Distributed System. Comm. of the ACM, vol. 21, N 27 (1978)-ACM
Mazurkiewicz A.: Concurrent program schemes and their interpretations. Aarhus University Publication (DAIMI PB-78, 1977)
Mukund M., Narayan Kumar K. and Sohoni M.: Synthesizing distributed finite-state systems from MSCs. CONCUR 2000, LNCS 1877 (2000) 521–535
Muscholl A., Peled D. and Su Z.: Deciding Properties for Message Sequence Charts. FoSSaCS’98, LNCS 1378 (1998) 226–242
Muscholl A.: Matching Specifications for Message Sequence Charts. FoSSaCS’99, LNCS 1578 (1999) 273–287
Muscholl A. and Peled D.: Message sequence graphs and decision problems on Mazurkiewicz traces. Proc. of MFCS’99, LNCS 1672 (1999) 81–91
Nielsen M., Plotkin G. and Winskel G.: Petri nets, events structures and domains, part 1. Relationships between Models of Concurrency, TCS 13 (1981) 85–108
Nielsen M., Sassone V. and Winskel G.: Relationships between Models of Concurrency. Rex’93: A decade of concurrency, LNCS 803 (1994) 425–475
Ochmański E.: Regular behaviour of concurrent systems. Bulletin of the EATCS 27 (Oct. 1985) 56–67
Pratt V.: Modelling concurrency with partial orders. Int. J. of Parallel Programming 15 (1986) 33–71
Sakarovitch J.: The “last” decision problem for rational trace languages. Proc. LATIN’92, LNCS 583 (1992) 460–473
Thomas W.: On logical definability of trace languages. Technical University of Munich, report TUM-I9002 (1990) 172–182
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morin, R. (2001). On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. In: Honsell, F., Miculan, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2001. Lecture Notes in Computer Science, vol 2030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45315-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-45315-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41864-1
Online ISBN: 978-3-540-45315-4
eBook Packages: Springer Book Archive