Abstract
We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs has the same complexity as for the class of finite-state (bounded) HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially more efficient in space than for locally-cooperative HMSCs. We also show that locally-cooperative and local-choice HMSCs can be always implemented by communicating finite states machines, provided we allow some additional (bounded) message data. Moreover, the implementation of local-choice HMSCs is deadlock-free and of linear-size.
Work partly supported by the European research project IST-1999-29082 ADVANCE and by the INRIA/IRISA ARC project FISC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
ITU-TS recommendation Z.120, 1996.
R. Alur, K. Etessami, and M. Yannakakis. Inference of message sequence charts. In 22nd Int. Conf. on Software Engineering, pages 304–313. ACM, 2000.
R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In ICALP’01, LNCS 2076, pages 797–808, 2001.
R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70–77, 1996.
R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR’99, LNCS 1664, pages 114–129, 1999.
D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323–342, 1983.
B. Caillaud, P. Darondeau, L. Hélouët, and G. Lesventes. HMSCs as partial specifications... with PNs as completions. In MOVEP, 2000.
L. Hélouët and C. Jard. Conditions for synthesis of communicating automata from HMSCs. In 5th Int. Workshop on Formal Methods for Ind. Crit. Systems, 2000.
L. Hélouët and P. Le Maigat. Decomposition of Message Sequence Charts. In SAM2000, pages 46–60, 2000.
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, pages 675–686, 2000.
Y. Métivier. On recognizable subsets of free partially commutative monoids. Theoretical Computer Science, 58:201–208, 1988.
R. Morin. Recognizable Sets of Message Sequence Charts. In STACS’02, LNCS 2285, pages 523–534, 2002.
M. Mukund, K. Narayan Kumar, and M. Sohoni. Synthesizing distributed finite-state systems from MSCs. In CONCUR’00, LNCS 1877, pages 521–535, 2000.
A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS’99, LNCS 1672, pages 81–91, 1999.
E. Ochmański. Recognizable trace languages. In The Book of Traces, chapter 6, pages 167–204. World Scientific, Singapore, 1995.
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
Genest, B., Muscholl, A., Seidl, H., Zeitoun, M. (2002). Infinite-State High-Level MSCs: Model-Checking and Realizability. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_56
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive