Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Logical reasoning and Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Automatic Web service composition based on Horn clauses and Petri nets
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
The main theorem of the paper states that the empty marking 脴 is reproducible in a p/t-net N if and only if there are reproducing T-invariants whose net representations have neither traps nor co-traps (deadlocks, siphons). This result is to be seen in connection to modeling processes, since all processes which have a start and a goal event usually reproduce the empty marking.