Skip to main content
SpringerLink
Log in

Regular Sets of Pomsets with Autoconcurrency

  • Conference paper
  • First Online:
CONCUR 2002 — Concurrency Theory (CONCUR 2002)

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

Included in the following conference series:

Abstract

Partially ordered multisets (or pomsets) constitute one of the most basic models of concurrency. We introduce and compare several notions of regularity for pomset languages by means of contexts and residues of different kinds. We establish some interesting closure properties that allow us to relate this approach to SP-recognizability in the particular case of series-parallel pomsets. Finally we introduce the framework of compatible languages which generalizes several classical formalisms (including message sequence charts and firing pomsets of Petri nets). In this way, we identify regular sets of pomsets as recognizable subsets in the monoid of multiset sequences.

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 and M. Yannakakis: Model Checking of Message Sequence Charts. CONCUR’ 99, LNCS 1664 (1999) 114–129

    Google Scholar 

  2. A. Arnold: An extension of the notion of traces and asynchronous automata. Theoretical Informatics and Applications 25 (1991) 355–393

    Google Scholar 

  3. V. Diekert and Y. Métivier: Partial Commutations and Traces. Handbook of Formal languages, vol. 3 (1997) 457–533

    Google Scholar 

  4. M. Droste, P. Gastin, and D. Kuske: Asynchronous cellular automata for pomsets. Theoretical Computer Science Vol. 247 (2000) 1–38

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Droste and D. Kuske: Logical definability of recognizable and aperiodic languages in concurrency monoids. LNCS 1092 (1996) 233–251

    Google Scholar 

  6. J. Fanchon: A syntactic congruence for the recognizability of pomset languages. RR 99008 (LAAS, Toulouse, 1999)

    Google Scholar 

  7. J. L. Gischer: The equational theory of pomsets. Theoretical Comp. Science 61 (1988) 199–224

    Article  MathSciNet  MATH  Google Scholar 

  8. J. Grabowski: On partial languages. Fund. Informatica IV(2) (1981) 427–498

    MathSciNet  Google Scholar 

  9. D. Kuske: Infinite series-parallel posets: logic and languages. LNCS 1853 (2000) 648–662

    Google Scholar 

  10. D. Kuske and R. Morin: Pomsets for Local Trace Languages— Recognizability, Logic & Petri Nets. CONCUR 2000, LNCS 1877 (2000) 426–440

    Chapter  Google Scholar 

  11. K. Lodaya and P. Weil: Series-parallel languages and the bounded-width property. Theoretical Comp. Science 237 (2000) 347–380

    Article  MATH  MathSciNet  Google Scholar 

  12. R. Morin: Recognizable Sets of Message Sequence Charts. STACS 2002, LNCS 2030 (2002) 332–342

    Google Scholar 

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

    Chapter  Google Scholar 

  14. V. Pratt: Modelling concurrency with partial orders. Int. J. of Parallel Programming 15 (1986) 33–71

    Article  MATH  MathSciNet  Google Scholar 

  15. W. Thomas: Automata Theory on Trees and Partial Orders. TAPSOFT 97, LNCS 1214 (1998) 20–34

    Chapter  Google Scholar 

  16. W. Vogler: Modular Construction and Partial Order Semantics of Petri Nets. LNCS 625 (1992) 252–275

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAAS, CNRS, 7, avenue du colonel Roche, F-31077, Toulouse, France

    Jean Fanchon

  2. LIF, 39 rue F. Joliot-Curie, F-13453, Marseille cedex 13, France

    Rémi Morin

Authors
  1. Jean Fanchon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rémi Morin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fanchon, J., Morin, R. (2002). Regular Sets of Pomsets with Autoconcurrency. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44043-7

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation