2012/03/14 by Ahmet A. Husainov, Husainov, Ahmet A., Ekaterina S. Kudryashova +1
Computer Science · #68Q10 #68Q85 #Distributed #FOS: Computer and information sciences #Formal Methods in Verification #Parallel #Petri Nets in System Modeling #and Cluster Computing (cs.DC) #cs.DC #msc:68Q10 #msc:68Q85 #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1203.3098
8 pages
arxiv created 2012/03/14 · openalex publication_date 2012/03/14 · arxiv updated 2012/03/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The paper is devoted to a mathematical model of concurrency the special case of which is asynchronous system. Distributed asynchronous automata are introduced here. It is proved that the Petri nets and transition systems with independence can be considered like the distributed asynchronous automata. Time distributed asynchronous automata are defined in standard way by the map which assigns time intervals to events. It is proved that the time distributed asynchronous automata are generalized the time Petri nets and asynchronous systems.