Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.
The Covering and Boundedness Problems for V ec tor Addition Systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Waiting Nets: State Classes and Taxonomy
Waiting nets extend time Petri nets by decoupling time measurement from control, admit finite state class graphs for bounded instances, and are strictly more expressive than TPNs under timed language equivalence.