Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 2002: Application and Theory of Petri Nets 2002 pp 335–351Cite as

Regular Event Structures and Finite Petri Nets: The Conflict-Free Case

  • Conference paper
  • First Online:

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

Abstract

We present the notion of regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We show that the conjecture holds for the conflict-free case. Even in this restricted setting, the proof is non-trivial and involves a natural subclass of regular event structures that admit a sensible labeling with Mazurkiewicz trace alphabets.

A major part of this work was done at BRICS

Basic Research In Computer Science, a centre funded by the Danish National Research Foundation

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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. Assous and C. Charetton: Nice Labeling of Event Structures, Bulletin of the EATCS vol. 41, (1990) 184–190.

    MATH  Google Scholar 

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

    Google Scholar 

  3. J. Esparza: Model Checking Using Net Unfoldings, Science of Computer Programming 23 (1996) 151–195.

    Article  MathSciNet  Google Scholar 

  4. J. Esparza, S. Roemer and W. Vogler: An Improvement of McMillan’s Unfolding Algorithm, Proc. of TACAS’96, Springer LNCS 1055 (1996) 87–106.

    Google Scholar 

  5. J. G. Henriksen and P. S. Thiagarajan: A Product Version of Dynamic Linear Time Temporal Logic, Proceedings of CONCUR’97, Springer LNCS 1243 (1997) 45–58.

    Google Scholar 

  6. M. Jurdzinski and M. Nielsen: Hereditary History Preserving Bisimilarity is Undecidable, Proceedings of STACS 2000, Springer Lecture Notes in Computer Science 1770 (2000) 358–369.

    Chapter  Google Scholar 

  7. K. L. McMillan: A Technique of a State Space Search Based on Unfolding, Formal Methods in System Design 6(1) (1995) 45–65.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Madhusudan and P. S. Thiagarajan: Branching-time Controllers for Discrete Event Systems. To appear in a special issue of Theoretical Computer Science containing full versions of selected papers from CONCUR’98.

    Google Scholar 

  9. M. Nielsen, G. Plotkin and G. Winskel: Petri nets, Event structures and Domains I, Theor. Comput. Sci. 13, (1980) 86–108.

    MathSciNet  Google Scholar 

  10. M. Nielsen, G. Rozenberg and P. S. Thiagarajan: Transition Systems, Event Structures and Unfoldings, Information and Computation, 118(2), (1995) 191–207.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. S. Thiagarajan: Regular Trace Event Structures, Technical Report, BRICS RS-96-32, Computer Science Department, Aarhus University, Aarhus, Denmark (1996).

    Google Scholar 

  12. P. S. Thiagarajan: Regular Event Structures and Finite Petri Nets: A Conjecture, In: W. Brauer, H. Ehrig, J. Karhumaki, A. Salomma (Eds.) Formal and Natural Computing: Essays Dedicated to Grzegorz Rozenberg, Springer LNCS 2300 (2002) 244–253.

    Google Scholar 

  13. W. Thomas: Automata on infinite objects, In: J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, Volume B, North-Holland, Amsterdam (1990) 130–191.

    Google Scholar 

  14. G. Winskel and M. Nielsen: Models for Concurrency, In: Handbook of Logic in Computer Science, Vol. IV, Eds.: S. Abramsky, D. Gabbay and T. S. E. Maibaum, Oxford University Press, (1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS, Computer Science Department, University of Aarhus, Denmark

    Mogens Nielsen

  2. School of Computing, National University of Singapore, Singapore

    P. S. Thiagarajan

  3. Chennai Mathematical Institute, Chennai, India

    P. S. Thiagarajan

Authors
  1. Mogens Nielsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. S. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, The King’s Buildings Mayfield Road, Edinburgh, EH9 3JZ, UK

    Javier Esparza

  2. Department of Computer Science, University of Adelaide, North Terrace, Adelaide, SA, 5005, Australia

    Charles Lakos

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nielsen, M., Thiagarajan, P.S. (2002). Regular Event Structures and Finite Petri Nets: The Conflict-Free Case. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-48068-4_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43787-1

  • Online ISBN: 978-3-540-48068-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation