Skip to main content
SpringerLink
Log in

Pattern Matching and Membership for Hierarchical Message Sequence Charts

  • Conference paper
  • First Online:
LATIN 2002: Theoretical Informatics (LATIN 2002)

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

Included in the following conference series:

Abstract

Several formalisms and tools for software development use hierarchy for system design, for instance statecharts and diagrams in UML. Message sequence charts are an ITU standardized notation for asynchronously communicating processes. The standard Z.120 allows (high-level) MSC-references that correspond to the use of macros. We consider in this paper two basic verification tasks for hierarchical MSCs (nested high-level MSCs, nHMSC), the membership and the pattern matching problem. We show that the membership problem for nHMSCs is PSPACE-complete, even using a weaker semantics for nMSCs than the partial-order semantics. For pattern matching nMSCs M,N we exhibit a polynomial algorithm of time O(M 2 · N 2). We use here techniques stemming from algorithms on compressed texts.

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. R. Alur, K. Etessami, and M. Yannakakis. Realizability and verification of MSC graphs. In ICALP’01, LNCS 2076, pp. 797–808, 2001.

    Google Scholar 

  2. R. Alur, G. H. Holzmann, and D. A. Peled. An analyzer for message sequence charts. Software Concepts and Tools, 17(2):70–77, 1996.

    Google Scholar 

  3. R. Alur, S. Kannan, and M. Yannakakis. Communicating hierarchical state machines. In ICALP’99, LNCS 1644, pp. 169–178, 1999.

    Google Scholar 

  4. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. In SIGSOFT’ 98, pp. 175–188, 1998.

    Article  Google Scholar 

  5. R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR’99, LNCS 1664, pp. 114–129, 1999.

    Chapter  Google Scholar 

  6. N.J. Fine and H.S. Wilf. Uniqueness theorems for periodic functions. Proceedings of the American Mathematical Society, 16, 1965.

    Article  MathSciNet  Google Scholar 

  7. E. Gunter, A. Muscholl, and D. Peled. Compositional message sequence charts. In TACAS’01, LNCS 2031, pp. 496–511, 2001.

    Google Scholar 

  8. D. Harel. Statecharts: A visual formulation for complex systems. Science of Computer Programming, 8(3):231–274, 1987.

    Article  MathSciNet  Google Scholar 

  9. M. Y. Vardi, D. Harel, O. Kupferman. On the complexity of verifying concurrent transition systems. In CONCUR’ 97, LNCS 1243, pp. 258–272, 1997.

    Google Scholar 

  10. P. Madhusudan. Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs. In ICALP’01, LNCS 2076, pp. 809–820, 2001.

    Google Scholar 

  11. A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS’99, LNCS 1672, pp. 81–91, 1999.

    Google Scholar 

  12. A. Muscholl, D. Peled, and Z. Su. Deciding properties of message sequence charts. In FoSSaCS’98, LNCS 1378, pp. 226–242, 1998.

    Google Scholar 

  13. M. Miyazaki, A. Shinohara, and M. Takeda. An improved pattern matching algorithm for strings in terms of straight-line programs. In CPM’ 97, LNCS 1264.

    Google Scholar 

  14. W. Plandowski. Testing equivalence of morphisms on context-free languages. In ESA’ 94, pp. 460–470, 1994.

    Chapter  Google Scholar 

  15. W. Rytter. Algorithms on compressed strings and arrays. In SOFSEM’ 99, LNCS 1725, pp. 48–65, 1999.

    Google Scholar 

  16. T. J. Schaefer. The complexity of satisfiability problems. In STOC’ 78, pp. 216–226, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIAFA, Université Paris VII, 2, pl. Jussieu, case 7014, F-75251, Paris cedex 05, France

    Blaise Genest & Anca Muscholl

Authors
  1. Blaise Genest
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anca Muscholl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Compaq Cambridge Research Laboratory, One Cambridge Center, 02142-1612, Cambridge, MA, USA

    Sergio Rajsbaum

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Genest, B., Muscholl, A. (2002). Pattern Matching and Membership for Hierarchical Message Sequence Charts. In: Rajsbaum, S. (eds) LATIN 2002: Theoretical Informatics. LATIN 2002. Lecture Notes in Computer Science, vol 2286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45995-2_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-45995-2_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43400-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation