Autonomous continuous P/T systems (Q4263299)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1341754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Autonomous continuous P/T systems |
scientific article; zbMATH DE number 1341754 |
Statements
27 April 2000
0 references
Petri nets
0 references
P/T nets
0 references
non-discrete markings
0 references
fractional firings
0 references
reachability
0 references
liveness
0 references
deadlock-freeness
0 references
equal conflict nets
0 references
free choice nets
0 references
0.82099295
0 references
0.8182949
0 references
0.8085751
0 references
0 references
Autonomous continuous P/T systems (English)
0 references
Basic definitions of autonomous continuous P/T nets and systems are introduced so as to allow operating with non-discrete markings and fractional firings of transitions. The paper develops a comparative study of the behaviors of discrete and continuous systems, relying on reachability as a central concept for the analysis of logic properties. Two extensions are formulated for the reachability of continuous systems, which can be further exploited when dealing with other properties. The work concentrates on the use of these two extensions in approaching liveness and deadlock-freeness. Stronger results are proved for the particular subclasses of equal conflict nets and free choice nets, respectively. For the entire collection see [Zbl 0915.00049].
0 references
