Skip to main content
SpringerLink
Log in

Partial order logics for elementary net systems: State- and event-approaches

  • Selected Presentations
  • Conference paper
  • First Online:
CONCUR '90 Theories of Concurrency: Unification and Extension (CONCUR 1990)

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

Included in the following conference series:

Abstract

We give two kinds of specific axiomatics, one describing cases and the other describing actions of en-systems. These two axiomatics do not have the same expressive power, since contacts are not expressible in the action-based approach. The problem of globality and locality, as well as extensions of the given axiomatics to axiomatics describing processes are discussed.

Work supported by the Basic Research Esprit Project no 3148 (DEMON)

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BenAri,Pnueli,Manna: The Temporal Logic of Branching Time. Acta Informatica 20, 1983.

    Google Scholar 

  2. Best,Fernandez: Notations and Terminology on Petri Net Theory. Arbeitspapiere der GMD 195, 1986.

    Google Scholar 

  3. Boudol,Castellani: Concurrency and Atomicity. TCS 59 (1988).

    Google Scholar 

  4. Browe,Clarke,Grümberg: Characterizing Finite Kripke Structures by Temporal Logic. TCS 59 (1988).

    Google Scholar 

  5. Broy M.: Spezifikation und Entwurf komplexer, kausal vernetzter Systeme. Informatik-Fachberichte 187, Springer-Verlag 1988.

    Google Scholar 

  6. Broy M.: Requirement and Design Specification for Distributed Systems. LNCS 335, Springer-Verlag 1988.

    Google Scholar 

  7. Burgess J.: Basic Tense Logic. In: Handbook of Philosophical Logic, Vol. 2, Gabbay and Guenther (eds.), D. Reidel Publishing Company, 1984.

    Google Scholar 

  8. Courcelle B.: The Monadic Second Order Logic of Graphs: Definable Sets of Finite Graphs. LNCS 344, 1989.

    Google Scholar 

  9. Church A.: Introduction to Mathematical Logic, Vol. 1. Princeton University Press, 1956.

    Google Scholar 

  10. Emerson,Srinivasan: Branching Time Temporal Logic. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Goos,Hartmanis (eds), LNCS 354, 1989.

    Google Scholar 

  11. Kozen D.: Results on the Propositional μ-calculus. TCS 27, 1983.

    Google Scholar 

  12. Kröger F.: Temporal Logic of Programs. EATCS Monographs on Theoretical Computer Science, Vol. 8, Springer-Verlag, 1987.

    Google Scholar 

  13. Masini,Maggiolo-Schettini: Local and Global Time Logic. Universita degli Studi di Pisa, Dipartimento di Informatica, TR-5/88.

    Google Scholar 

  14. Manna, Pnueli: Verification of Concurrent Programs: The Temporal Framework. In: The Correctness Problem in Computer Science. Boyer, Moore (eds.), International Lecture Series in Computer Science, Academic Press, New York, 1981.

    Google Scholar 

  15. Nielsen,Plotkin,Winskel: Petri Nets, Event Structures and Domains. TCS 13 (1981).

    Google Scholar 

  16. Owicki, Lamport: Proving Liveness Properties of Concurrent Programs. ACM, Vol. 4, No. 3, July 1982.

    Google Scholar 

  17. Pelz E.: About the concurrent behaviour of EN systems: definability and closure results. 9th European Workshop on Application and Theory of Petri Nets. Venice, Italy, June 1988.

    Google Scholar 

  18. Penczek W.: A Temporal Logic for Event Structures. Fund. Inf. 11, 1988.

    Google Scholar 

  19. Pinter,Wolper: A Temporal Logic for Reasoning about Partially Ordered Computations. Proceedings of the third ACM Symposium on Principles of Distributed Computing, Vancouver, Canada, 1984.

    Google Scholar 

  20. Reisig W.: Petri Nets. An Introduction. EATCS Monographs in Computer Sciences, Vol. 4, Springer-Verlag, 1985.

    Google Scholar 

  21. Reisig W.: Towards a Temporal Logic for True Concurrency. Arbeitspapiere der GMD 277, 1987.

    Google Scholar 

  22. Reisig W.: Towards a temporal logic of causality and choice. Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Goos, Hartmanis (Eds), LNCS 354, 1989.

    Google Scholar 

  23. Reisig W.: Temporal Logic and Causality in Concurrent Systems. LNCS 335, Concurrency 88, Springer-Verlag, 1988.

    Google Scholar 

  24. Reisig W.: A Report on the REX School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Bulletin of EATCS, No 36, October 1988.

    Google Scholar 

  25. Rozenberg G.: Behaviour of Elementary Net Systems. LNCS 254, Springer-Verlag, 1987.

    Google Scholar 

  26. Sinachopoulos A.: Temporal Logics for Elementary Net Systems. Arbeitspapiere der GMD 353, 1988.

    Google Scholar 

  27. Sinachopoulos,Devillers: Partial Order Logics for Axiomatizing Concurrent Systems. Submitted for publication, 1990.

    Google Scholar 

  28. Thiagarajan P.: Elementary Net Systems. LNCS 254, Springer-Verlag, 1987.

    Google Scholar 

  29. Winskel G.: Event structures. Proc. Advances in Petr Nets '86, LNCS 255, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique, Université Libre de Bruxelles, Boul. du Triomphe, CP, B-1050, Bruxelles, Belgium

    A. Sinachopoulos

Authors
  1. A. Sinachopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. C. M. Baeten J. W. Klop

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sinachopoulos, A. (1990). Partial order logics for elementary net systems: State- and event-approaches. In: Baeten, J.C.M., Klop, J.W. (eds) CONCUR '90 Theories of Concurrency: Unification and Extension. CONCUR 1990. Lecture Notes in Computer Science, vol 458. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039076

Download citation

  • DOI: https://doi.org/10.1007/BFb0039076

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53048-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation