Abstract
The elementary cause-effect structures, nets introduced in this chapter, are behaviourally equivalent to condition-event Petri nets [4] . Their constructive features are, however, different. The two main differences are: (1) Each elementary c-e structure has only one type of nodes, the counterparts of Petri net places, their set is infinite, because isolated nodes (without predecessors and successors), though do not affect the structure’s behaviour, belong to it. (2) The active objects, unlike Petri net transitions, are not primary notions given explicitly.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the first papers on cause-effect structures, the term “near-semiring” has been used. But in the meantime some authors used it in another meaning, so, the term quasi-semiring for this axiomatic system here is adopted.
References
Bruns G (1997) Distributed systems analysis with CCS. Prentice-Hall
Hoare CAR (1985) Communicating sequential processes. Prentice Hall
Milner R (1989) Communication and concurrency. Prentice Hall Inc
Reisig W (1985) Petri nets. An introduction, Number 4 in EATCS monographs on theoretical computer science. Springer, Berlin, Heidelberg, New York, Tokyo
Roscoe AW (1998) The theory and practice of concurrency. Prentice-Hall
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Czaja, L. (2019). Basics of Elementary Cause-Effect Structures. In: Cause-Effect Structures. Lecture Notes in Networks and Systems, vol 45. Springer, Cham. https://doi.org/10.1007/978-3-030-20461-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-20461-7_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20460-0
Online ISBN: 978-3-030-20461-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)