Skip to main content
SpringerLink
Log in

Recognizable Sets of Message Sequence Charts

  • Conference paper
  • First Online:
STACS 2002 (STACS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2285))

Included in the following conference series:

Abstract

High-level Message Sequence Charts are a well-established formalism to specify scenarios of communications in telecommunication protocols. In order to deal with possibly unbounded specifications, we focus on star-connected HMSCs. We relate this subclass with recognizability and MSO-definability by means of a new connection with Mazurkiewicz traces. Our main result is that we can check effectively whether a star-connected HMSC is realizable by a finite system of communicating automata with possibly unbounded channels.

Supported by the INRIA cooperative research action FISC.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur R., Etessami K. and Yannakakis M.: Inference of message sequence charts. 22nd Intern. Conf. on Software Engineering, ACM (2000) 304–313

    Google Scholar 

  2. Alur R., Etessami K. and Yannakakis M.: Realizability and verification of MSC graphs. LNCS 2076 (2001) 797–808

    Google Scholar 

  3. Alur R. and Yannakakis M.: Model Checking of Message Sequence Charts. CONCUR’ 99, LNCS 1664(1999) 114–129

    Google Scholar 

  4. Büchi J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlagen Math. 6 (1960) 66–92

    Article  MATH  MathSciNet  Google Scholar 

  5. Caillaud B., Darondeau Ph., Hélouët L. and Lesventes G.: HMSCs as partial speci fications... with PNs as completions. LNCS 2067 (2001) 87–103

    Google Scholar 

  6. Diekert V. and Rozenberg G.: The Book of Traces. (World Scientific, 1995)

    Google Scholar 

  7. Hélouët L. and Le Maigat P.: Decomposition of Message Sequence Charts. Proc. SAM 2000 (Verimag, Grenoble, 2000)

    Google Scholar 

  8. 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

    Google Scholar 

  9. Henriksen J.G., Mukund M., Narayan Kumar K. and Thiagarajan P.S.: Regular collections of message sequence charts. LNCS 1893 (2000) 405–414

    Google Scholar 

  10. Holzmann G.J.: Early Fault Detection. TACAS’96, LNCS 1055 (1996) 1–13

    Google Scholar 

  11. ITU-TS: Recommendation Z.120: Message Sequence Charts. (Geneva, 1996)

    Google Scholar 

  12. Madhusudan P.: Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. LNCS 2076 (2001) 809–820

    Google Scholar 

  13. Mayr, E.W.: Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15 (1981) 309–318

    MATH  MathSciNet  Google Scholar 

  14. Métivier Y., Richomme G. and Wacrenier P.: Computing the Closure of Sets of Words under Partial Commutations. LNCS 974 (1995) 75–86

    Google Scholar 

  15. Morin R.: On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory. FoSSaCS 2001, LNCS 2030 (2001) 332–346

    Google Scholar 

  16. Mukund M., Narayan Kumar K. and Sohoni M.: Synthesizing distributed finitestate systems from MSCs. LNCS 1877(2000) 521–535

    Google Scholar 

  17. Muscholl A.: Matching Specifications for Message Sequence Charts. FoSSaCS’99, LNCS 1578 (1999) 273–287

    Google Scholar 

  18. Muscholl A. and Peled D.: Message sequence graphs and decision problems on Mazurkiewicz traces. LNCS 1672 (1999) 81–91

    Google Scholar 

  19. Ochmański E.: Regular behaviour of concurrent systems. Bulletin of the EATCS 27 (Oct. 1985) 56–67

    Google Scholar 

  20. Reutenauer C.: The Mathematics of Petri Nets. (Masson, 1988)

    Google Scholar 

  21. Sakarovitch J.: The “last” decision problem for rational trace languages. LNCS 583 (1992) 460–473

    Google Scholar 

  22. Thomas W.: On logical definability of trace languages. Technical University of Munich, report TUM-I9002 (1990) 172–182

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Marseille, Université de Provence, 39 rue F. Joliot-Curie, F-13453, Marseille cedex 13, France

    Rémi Morin

Authors
  1. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morin, R. (2002). Recognizable Sets of Message Sequence Charts. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation