Circular Traffic Queues and Petri’s Cycloids

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...

Descripción completa

Detalles Bibliográficos
Autor principal: Valk, Rüdiger
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324244/
http://dx.doi.org/10.1007/978-3-030-51831-8_9
_version_ 1783551900599189504
author Valk, Rüdiger
author_facet Valk, Rüdiger
author_sort Valk, Rüdiger
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7324244
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73242442020-06-30 Circular Traffic Queues and Petri’s Cycloids Valk, Rüdiger Application and Theory of Petri Nets and Concurrency Article 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. 2020-06-02 /pmc/articles/PMC7324244/ http://dx.doi.org/10.1007/978-3-030-51831-8_9 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Valk, Rüdiger
Circular Traffic Queues and Petri’s Cycloids
title Circular Traffic Queues and Petri’s Cycloids
title_full Circular Traffic Queues and Petri’s Cycloids
title_fullStr Circular Traffic Queues and Petri’s Cycloids
title_full_unstemmed Circular Traffic Queues and Petri’s Cycloids
title_short Circular Traffic Queues and Petri’s Cycloids
title_sort circular traffic queues and petri’s cycloids
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7324244/
http://dx.doi.org/10.1007/978-3-030-51831-8_9
work_keys_str_mv AT valkrudiger circulartrafficqueuesandpetriscycloids

Ejemplares similares