Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2002: STACS 2002 pp 489–500Cite as

A Further Step towards a Theory of Regular MSC Languages

  • Conference paper
  • First Online:

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

Abstract

This paper resumes the study of regular sets of Message Sequence Charts initiated by Henriksen, Mukund, Narayan Kumar & Thiagarajan [10]. Differently from their results, we consider infinite MSCs. It is shown that for bounded sets of infinite MSCs, the notions of recognizability, axiomatizability in monadic second order logic, and acceptance by a deterministic Message Passing Automaton with Muller acceptance condition coincide. We furthermore characterize the expressive power of first order logic and of its extension by modulo-counting quantifiers over bounded infinite MSCs. Complete proofs can be found in the Technical Report [15].

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur and M. Yannakakis. Model checking of message sequence charts. In CONCUR’99, Lecture Notes in Comp. Science vol. 1664, pages 114–129. Springer, 1999.

    Google Scholar 

  2. A. Arnold. An extension of the notions of traces and of asynchronous automata. Informatique Théorique et Applications, 25:355–393, 1991.

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106:159–202, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  5. V. Diekert and Y. Métivier. Partial commutation and traces. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages Volume 3, pages 457–533. Springer, 1997.

    Google Scholar 

  6. V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. Acta Informatica, 31:379–397, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. Droste and P. Gastin. Asynchronous cellular automata for pomsets without autoconcurrency. In CONCUR’96, Lecture Notes in Comp. Science vol. 1119, pages 627–638. Springer, 1996.

    Google Scholar 

  8. M. Droste, P. Gastin, and D. Kuske. Asynchronous cellular automata for pomsets. Theoretical Comp. Science, 247:1–38, 2000. (Fundamental study).

    Article  MATH  MathSciNet  Google Scholar 

  9. W. Ebinger and A. Muscholl. Logical definability on infinite traces. Theoretical Comp. Science, 154:67–84, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Towards a theory of regular MSC languages. Technical report, BRICS RS-99-52, 1999. The results of this technical report appeared in the extended abstracts [12,11].

    Google Scholar 

  11. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. On message sequence graphs and finitely generated regularMSClanguages. In ICALP’00, pages 675–686. Springer, 2000.

    Google Scholar 

  12. J.G. Henriksen, M. Mukund, K. Narayan Kumar, and P.S. Thiagarajan. Regular collections of message sequence charts. In MFCS 2000, Lecture Notes in Computer Science vol. 1893. Springer, 2000.

    Google Scholar 

  13. W. Hodges. Model Theory. Cambridge University Press, 1993.

    Google Scholar 

  14. D. Kuske. Asynchronous cellular automata and asynchronous automata for pomsets. In CONCUR’98, Lecture Notes in Comp. Science vol. 1466, pages 517–532. Springer, 1998.

    Google Scholar 

  15. D. Kuske. Another step towards a theory for regular MSC languages. Technical Report 2001-36, Department of Mathematics and Computer Science, University of Leicester, 2001.

    Google Scholar 

  16. D. Kuske and R. Morin. Pomsets for local trace languages: Recognizability, logic and Petri nets. In CONCUR 2000, Lecture Notes in Comp. Science vol. 1877, pages 426–411. Springer, 2000.

    Google Scholar 

  17. R.E. Ladner. Application of model theoretic games to discrete linear orders and finite automata. Information and Control, 33:281–303, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. McNaughton and S. Papert. Counter-Free Automata. MIT Press, Cambridge, USA, 1971.

    MATH  Google Scholar 

  19. R. Morin. On regular message sequence chart languages and relationships to Mazurkiewicz trace theory. In FOSSACS01, Lecture Notes in Comp. Science vol. 2030, pages 332–346. Springer, 2001.

    Google Scholar 

  20. M. Mukund, K. Narayan Kumar, and M. Sohoni. Synthesizing distributed finite-state systems from MSCs. In C. Palamidessi, editor, CONCUR 2000, Lecture Notes in Computer Science vol. 1877, pages 521–535. Springer, 2000.

    Chapter  Google Scholar 

  21. A. Muscholl and D. Peled. Message sequence graphs and decision problems on Mazurkiewicz traces. In MFCS’99, Lecture Notes in Computer Science vol. 1672, pages 81–91. Springer, 1999.

    Google Scholar 

  22. H. Straubing, D. Thérien, and W. Thomas. Regular languages defined with generalized quantifiers. Information and Computation, 118:289–301, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  23. P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for mazurkiewicz traces. In LICS’97, pages 183–194. IEEE Computer Society Press, 1997.

    Google Scholar 

  24. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 133–191. Elsevier Science Publ. B.V., 1990.

    Google Scholar 

  25. W. Thomas. On logical definability of trace languages. InV. Diekert, editor, Proceedings of a workshop of the ESPRITBRANo 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS) 1989, Report TUM-I9002, Technical University of Munich, pages 172–182, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Leicester, LE1 7RH, LEICESTER, England

    Dietrich Kuske

Authors
  1. Dietrich Kuske
    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

Kuske, D. (2002). A Further Step towards a Theory of Regular MSC Languages. 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_40

Download citation

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

  • 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