Skip to main content
SpringerLink
Log in

Regular Event Structures and Finite Petri Nets: A Conjecture

  • Chapter
  • First Online:
Formal and Natural Computing

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

Abstract

We formulate the notion of a regular event structures and conjecture that they correspond exactly to finite 1-safe Petri nets. We offer a partial result in support of the conjecture. This result is in terms of 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, Computer Science Department, University of Aarhus, Aarhus, Denmark.

On leave from Chennai Mathematical Institute, 92 G.N. Chetty Road, Chennai, India

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

  5. M. Mukund and M.S. Sohoni: Keeping Track of the Latest Gossip: Bounded Time-Stamps Suffice, Proc. FST & TSC’93, LNCS 761 (1993) 388–399.

    Google Scholar 

  6. M. Nielsen: Private communication (2001).

    Google Scholar 

  7. M. Nielsen, G. Plotkin and G. Winskel: Petri Nets, Event Structures and Domains I, Theor. Comput. Sci., 13 (1980) 86–108.

    MathSciNet  Google Scholar 

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

  9. W. Penczek and R. Kuiper: Traces and Logic, In: V. Diekert and G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore (1995) 307–379.

    Google Scholar 

  10. B. Rozoy and P.S. Thiagarajan: Event Structures and Trace Monoids, Theoretical Computer Science, 91 (1991) 285–313.

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

  13. I. Walukiewicz. Private communication.

    Google Scholar 

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

    Google Scholar 

  15. W. Zielonka: Notes on Finite Asynchronous Automata, R.A.I.R.O.— Inf. Théor. et Appl., 21 (1987) 99–135.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore

    P.S. Thiagarajan

Authors
  1. P.S. Thiagarajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Thiagarajan, P. (2002). Regular Event Structures and Finite Petri Nets: A Conjecture. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45711-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation