Skip to main content

Event automata as a generic model of reactive systems

  • Methods for Correctness
  • Chapter
  • First Online:
KORSO: Methods, Languages, and Tools for the Construction of Correct Software

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

  • 170 Accesses

Abstract

Event automata are a generic model of event-based computations of reactive systems. The paper gives an overview of the rationale of the concept, sketches the underlying mathematics, and provides some ideas about appropriate specification techniques. The framework will be instantiated by various, conceptually quite different examples ranging from interleaving semantics and process calculi to true concurrency semantics and object-oriented methods.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Goguen, R.M. Burstall, Introducing Institutions. in E. Clarke (ed), Logics of Programming Workshop, Springer Verlag, 1984

    Google Scholar 

  2. S. Brookes, C.A.R. Hoare, A. Roscoe. A Theory of Communicating Sequential Processes. Journal of ACM 31, 1984, pp. 560–599

    Article  Google Scholar 

  3. R. Budde. A Production cell in Esterel: A Case Study. In:[LL94]

    Google Scholar 

  4. I. Czaja, R.J. van Glabbeek, U. Goltz. Interleaving Semantics and Action Refinement with Atomic Choice. In: G. Rozenberg (ed.) Advances in Petri Nets '92, LNCS 609, 1992

    Google Scholar 

  5. A.B. Cremers, T.N. Hibbard. Axioms for Concurrent Processes. In New results and New Trends in Computer Sciences, volume 555 of LNCS, 1991, pp. 54–68

    Google Scholar 

  6. J.F. Costa, A. Sernadas, C. Sernadas. Objects as Non-Sequential Machines. In Workshop IS-CORE '91, London, September 1991, Informatik-Berichte 91-03, TU Braunschweig, 1991

    Google Scholar 

  7. Ph. Darendeau, P. Degano. Causal Trees. In Proc. ICALP 89, volume 372 of LNCS, 1989

    Google Scholar 

  8. H.D. Ehrich, J.A. Goguen, A. Sernadas. A Categorical Theory of Objects as Observed Processes. In Proc. REX / Fool, volume 90 of LNCS, 1990, pp. 203–228

    Google Scholar 

  9. H.D. Ehrich, A. Sernadas. Fundamental Object Concepts and Constructions. In Workshop IS-CORE '91, London, September 1991, Informatik-Berichte 91-03, TU Braunschweig, 1991

    Google Scholar 

  10. R. van Glabbeek, U. Goltz. A Deadlock-sensitive Congruence for Action Refinement. Techn. Report TUM-I9044, TU München, 1990

    Google Scholar 

  11. U, Goltz, N. Götz. Modeling a Simple Communication Protocol in a Language with Action Refinement. In Proceedings CEDISYS Workshop, Antibes, September 1991

    Google Scholar 

  12. R. van Glabbeek. The Refinement Theorem for ST-Bisimulation Semantics. In Proc. IFIP Working Conference on Programming Concepts and Methods, Sea of Galilea, Israel, North Holland, 1990.

    Google Scholar 

  13. R. Gorrieri. Refinement, Atomicity and Transactions for Process Description Languages. Ph.D. Thesis, Universitá degli Studi di Pisa, 1991

    Google Scholar 

  14. J. Gunawardena. Causal Automata. Theoretical Computer Science 101 (1992) pp. 265–288

    Article  Google Scholar 

  15. E.-R. Olderog, C.A.R. Hoare. Specification-oriented Semantics for Communicating Processes. Acta Informatica 23, pp. 9–66

    Google Scholar 

  16. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall, 1984

    Google Scholar 

  17. L. Holenderski. A Production cell in Lustre: A Case Study. In [LL94]

    Google Scholar 

  18. C. Lewerentz and T. Lindner (eds.). Case Study Production Cell: A Comparative Study in Formal Specification and Verification. FZI Publication 1/94, Forschungszentrum Informatik, Karlsruhe, 1994

    Google Scholar 

  19. A. Mazurkiewicz. Basic Notions of Trace Theory. In Lecture Notes for the REX Summerschool in Temporal Logic, volume 354 of LNCS, Springer, 1988

    Google Scholar 

  20. R.Milner. Communication and Concurrency. Prentice Hall, 1989

    Google Scholar 

  21. Z. Manna, A. Pnueli. On the Faithfulness of Formal Models. In, Proc. MFCS '91, volume 520 of LNCS, 1991, pp. 23–48

    Google Scholar 

  22. G.M. Pinna, A. Poigné. Modeling and Specifying Reactive Behaviour of Information systems. Proc. IS-CORE '93, Informatik Berichte, Universität Hannover, 1993

    Google Scholar 

  23. G.M. Pinna, A. Poigné. On the Nature of Events: a New Perspective in Concurrency. TCS 138, 1995

    Google Scholar 

  24. A. Rensink. Posets for Configurations!. In CONCUR'92, LNCS 630, pp. 269–285

    Google Scholar 

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

    Google Scholar 

  26. G. Winskel. Event Structures. In Petri Nets: Applications and Relationships to other Models of Concurrency, volume 255 of LNCS, pp. 325–392

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Manfred Broy Stefan Jähnichen

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Pinna, G.M., Poigné, A. (1995). Event automata as a generic model of reactive systems. In: Broy, M., Jähnichen, S. (eds) KORSO: Methods, Languages, and Tools for the Construction of Correct Software. Lecture Notes in Computer Science, vol 1009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015456

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47802-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics