Circular Traffic Queues and Petri’s Cycloids
- 30 June 2020
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- Vol. 12152, 176-195
- https://doi.org/10.1007/978-3-030-51831-8_9
Abstract
Two sorts of circular traffic systems are defined and their minimal length of recurrent transition sequences is computed. The result is used for finding cycloids that have an isomorphic reachability graph. Cycloids are particular Petri nets for modelling processes of actions or events, belonging to the fundaments of Petri’s general systems theory. They have very different interpretations, ranging from Einstein’s relativity theory to elementary information processing gates. The cycloid representation of circular traffic systems allows to identify basic synchronisation mechanisms and leads to a structure theory of such systems.Keywords
This publication has 6 references indexed in Scilit:
- Circular Traffic Queues and Petri’s CycloidsPublished by Springer Science and Business Media LLC ,2020
- Formal Properties of Petri’s Cycloid SystemsFundamenta Informaticae, 2019
- On the Structure of Cycloids Introduced by Carl Adam PetriPublished by Springer Science and Business Media LLC ,2018
- Petri's axioms of concurrency a selection of recent resultsPublished by Springer Science and Business Media LLC ,1997
- Nets, time and spaceTheoretical Computer Science, 1996
- Free Choice Petri NetsPublished by Cambridge University Press (CUP) ,1995