Titlebook: ;

诱拐

执

https://doi.org/10.1007/978-3-030-02391-1pre- and postconditions of this calculus are the nested conditions of Habel, Pennemann and Rensink, extended with expressions for labels in order to deal with GP’s conditional rule schemata and infinite label alphabet. We show that the proof rules are sound with respect to GP’s operational semantics.

细丝

A False History of True Concurrency: From Petri to Toolson, to the ., a pragmatic technique for palliating the state-explosion problem in automatic verification. While the note provides a very incomplete and hence “false” view of true concurrency, it also includes several pages of references.

可互换

A New Type of Behaviour-Preserving Transition Insertions in Unfolding Prefixese unfolding prefix of the Petri net is developed. Moreover, as several transformations often have to be applied one after the other, the developed theory allows one to avoid (expensive) re-unfolding after each transformation, and instead use local modifications on the existing complete prefix to obtain a complete prefix of the modified net.