Skip to main content
SpringerLink
Log in

Event Structures for Resolvable Conflict

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

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

Abstract

We propose a generalisation of Winskel’s event structures, matching the expressive power of arbitrary Petri nets. In particular, our event structures capture resolvable conflict, besides disjunctive and conjunctive causality.

This work was supported by EPSRC under grant number GR/S22097.

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. Boudol, G.: Flow event structures and flow nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol. 469, pp. 62–95. Springer, Heidelberg (1990)

    Google Scholar 

  2. van Glabbeek, R.J., Plotkin, G.D.: Configuration structures (extended abstract). In: Kozen, D. (ed.) Proc. LICS 1995, San Diego, USA, pp. 199–209 (1995)

    Google Scholar 

  3. van Glabbeek, R.J., Plotkin, G.D.: Configuration structures, event structures and Petri nets (2004), Draft at http://theory.stanford.edu/~rvg/event/

  4. Gunawardena, J.: Causal automata. TCS 101, 265–288 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hoogers, P.W., Kleijn, H.C.M., Thiagarajan, P.S.: An event structures semantics for general Petri nets. TCS 153, 129–170 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Katoen, J.-P.: Quantitative and Qualitative Extensions of Event Structures, PhD thesis, Department of Computer Science, University of Twente (1996)

    Google Scholar 

  7. Langerak, R.: Transformations and Semantics for LOTOS. PhD thesis, Department of Computer Science, University of Twente (1992)

    Google Scholar 

  8. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. TCS 13(1), 85–108 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Winskel, G.: Event structures. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 255, pp. 325–392. Springer, Heidelberg (1987)

    Google Scholar 

  10. Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol. 354, pp. 364–397. Springer, Heidelberg (1989)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, Edinburgh, EH9 3JZ, UK

    Rob van Glabbeek & Gordon Plotkin

Authors
  1. Rob van Glabbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gordon Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Glabbeek, R., Plotkin, G. (2004). Event Structures for Resolvable Conflict. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

  • Online ISBN: 978-3-540-28629-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation