Skip to main content
SpringerLink
Log in

On the nature of events

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1992 (MFCS 1992)

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

Abstract

We introduce yet another event-based formalism, event automata, which unifies various definitions to be found in the literature. Moreover we discuss various new concepts such as possible events, asymmetric conflict and quiescent states. We also distinguish between specifications and automata which satisfy a specification.

Work partially supported by the German Ministery for Science and Technology, Verbundprojekt KORSO, subproject “Design of Reliable Reactive Systems” (grant No. ITS 900 1A7) and by the ESPRIT BRA No. 3003, Categorical Logic in Computer Science (CLICS)

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.

Bibliography

  1. Boudol, G., “Computations of Distributed Systems. Part 1: Flow Event Structures and Flow Nets”, in Semantics of Systems of Concurrent Processes, Lecture Notes in Computer Science 469, 1990, pp. 62–95

    MathSciNet  Google Scholar 

  2. Ehrich, H.-D., Goguen, J.A., Sernadas, A., “A Categorical Theory of Objects as Observed Processes”, Proc. REX/Fool, Nordwijkerhout, 1990

    Google Scholar 

  3. Fiadeiro, J., Maibaum, T., “Describing, Structuring and Implementing Objects”, Proc. REX/Fool, Nordwijkerhout, 1990

    Google Scholar 

  4. Fiadeiro, J., Sernadas, A., Logics of Modal Terms for System Specification, Journal of Logics and Computation, 1990

    Google Scholar 

  5. Gaifman, H., Pratt, V., “Partial Order Models of Concurrency and the Computation of Functions”, in Proc. LICS 87, 1987, pp. 72–85

    Google Scholar 

  6. Gaifman, H., “Modeling Concurrency by Partial Orders and Nonlinear Transition Systems”, in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 249, 1989, pp. 467–488

    Article  MathSciNet  Google Scholar 

  7. van Glabbeek, R., Talk given at GMD, 1991

    Google Scholar 

  8. Goltz, U., Götz, N., Modelling a Simple Communication Protocol in a Language with Action Refinement, draft paper

    Google Scholar 

  9. Gunawardena, J., Causal Automata I: Confluence = { AND, OR }-Causality, to appear on Theoretical Computer Science

    Google Scholar 

  10. Gunawardena, J., “Geometric logic, Causality and Event Structures”, in CONCUR'91, Lecture Notes in Computer Science 527, 1991, pp. 266–280

    MathSciNet  Google Scholar 

  11. Johns tone, P.T., Stone Spaces, Cambrige University Press, 1982

    Google Scholar 

  12. Manna, Z., Pnueli, A. “On the Faithfulness of Formal Models”, in, Proc. MFCS '91, Lecture Notes in Computer Science 520, 1991, pp. 23–48

    MathSciNet  Google Scholar 

  13. Murphy, D., Three papers on Classical Concurrency Theory, Technical Report, University of Glasgow, CSC 91/R5, 1991

    Google Scholar 

  14. Pinna, G.M., Poigné, A., On the Nature of Events, extended version

    Google Scholar 

  15. Pinna, G.M., Poigné, A., The Mathematics of Event Automata, in preparation

    Google Scholar 

  16. Pratt, V., “Modeling Concurrency with Geometry”, in Proc. of POPL'91, 1991, pp. 311–322

    Google Scholar 

  17. Rensink, A., Posets for Configurations!, Memoranda Informatica 91–20, University of Twente, 1991

    Google Scholar 

  18. Sernadas, A., Ehrich, H. D., Costa, J. F., From Processes to Objects, The INESC Journal of Research and Development 1, 1990, pp. 7–27

    Google Scholar 

  19. Turski, W., Prescribing Behaviours, to appear on Theoretical Computer Science

    Google Scholar 

  20. Vaandrager, F.W., A Simple Definition for Parallel Composition of Prime event Event Strucures, Technical Report, CWI Amsterdam, CS-R8903, 1989

    Google Scholar 

  21. Winskel, G., Events in Computations, Ph. D. Thesis, University of Edinburgh, CST-10-80, 1980

    Google Scholar 

  22. Winskel, G., “Event Structures”, in Petri Nets: Applications and Relationships to other Models of Concurrency, Lecture Notes in Computer Sciences 255, pp. 325–392

    Google Scholar 

  23. Winskel, G., Categories of Models for Concurrency, Talk at ESPRIT-BRA CLICS-Meeting, Paris, 1990

    Google Scholar 

Download references

Author information

Author notes

  1. G. Michele Pinna & Axel Poigné

    Present address: Gesellschaft für Mathematik und Datenverarbeitung, Schloß, Postfach 1316, D-5205, Birlinghoven, St. Augustin 1, Germany

Authors and Affiliations

    Authors
    1. G. Michele Pinna
      View author publications

      You can also search for this author in PubMed Google Scholar

    2. Axel Poigné
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding authors

    Correspondence to G. Michele Pinna or Axel Poigné .

    Editor information

    Ivan M. Havel Václav Koubek

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1992 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Pinna, G.M., Poigné, A. (1992). On the nature of events. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_42

    Download citation

    • DOI: https://doi.org/10.1007/3-540-55808-X_42

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-55808-8

    • Online ISBN: 978-3-540-47291-9

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation