scholarly journals Generalized Asynchronous Systems

2015 ◽  
Vol 19 (4) ◽  
pp. 78-86
Author(s):  
E. S. Kudryashova ◽  
A. A. Khusainov
Keyword(s):  
Petri Nets ◽  
Asynchronous Systems ◽  
Time Petri Nets ◽  
Concurrent System ◽  
Asynchronous System ◽  
Time Intervals ◽  
Transition Systems ◽  
Asynchronous Automata ◽  
Generalize Time ◽  
Special Case

The paper consider a mathematical model of a concurrent system, the special case of which is an asynchronous system. Distributed asynchronous automata are introduced here. It is proved that Petri nets and transition systems with independence can be considered as distributed asynchronous automata. Time distributed asynchronous automata are defined in a standard way by correspondence which relates events with time intervals. It is proved that the time distributed asynchronous automata generalize time Petri nets and asynchronous systems.

scholarly journals IdentifyTPN: a tool for the identification of Time Petri nets

2017 ◽  
Vol 50 (1) ◽  
pp. 5843-5848
Author(s):  
F. Basile ◽  
P. Chiacchio ◽  
J. Coppola
Keyword(s):  
Petri Nets ◽  
Time Petri Nets

scholarly journals Modeling of safe time Petri nets by interval weighted automata

2020 ◽  
Vol 53 (4) ◽  
pp. 187-192
Author(s):  
Jan Komenda ◽  
Aiwen Lai ◽  
José Godoy Soto ◽  
Sébastien Lahaye ◽  
Jean-louis Boimond
Keyword(s):  
Petri Nets ◽  
Time Petri Nets ◽  
Weighted Automata

A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó
Keyword(s):  
Formal Languages ◽  
Parallel Program ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Concurrent System ◽  
Closure Properties ◽  
Sequential Program ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Independence Relations

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.

Sign in / Sign up

Export Citation Format

Share Document