2000 character limit reached
Generalized Asynchronous Systems (1203.3098v1)
Published 14 Mar 2012 in cs.DC
Abstract: 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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.