Target-oriented Petri net synthesis

Petri Net Synthesis from a Reachability Set

E Best, R Devillers - International Conference on Applications and Theory …, 2024 - Springer
Classical Petri net synthesis is a method to generate a Petri net from a labelled transition
system. In this paper, by contrast, it is assumed that a (finite) set of markings is given, and an …
Save Cite Related articles All 3 versionsFree GPT-4
[Free GPT-4]
[PDF] ulb.ac.be

Synthesis of (choice-free) reset nets

R Devillers - International Conference on Applications and Theory of …, 2021 - Springer
Instead of synthesising a labelled transition system into a weighted Petri net, we shall here
consider the larger class of nets with reset arcs, allowing to instanciate a larger class of …
Save Cite Cited by 2 Related articles All 4 versionsFree GPT-4
[Free GPT-4]
[PDF] ulb.ac.be

Synthesis of Inhibitor-Reset Petri Nets: Algorithmic and Complexity Issues

R Devillers, R Tredup - … Conference on Applications and Theory of Petri …, 2022 - Springer
In this paper, we examine the synthesis problem from a finite labeled transition system when
the target is the class of weighted nets with (possibly) inhibitor and/or reset links, or some …
Save Cite Cited by 2 Related articles All 5 versionsFree GPT-4

Petri Nets with Special Structures

G Liu - Petri Nets: Theoretical Models and Analysis Methods …, 2022 - Springer
This chapter introduces six subclasses of Petri nets that are of beautiful structures: state
machines, marked graphs, free-choice nets, asymmetric-choice nets, weakly persistent nets …
Save Cite Related articles All 3 versionsFree GPT-4

Petri Net Primer

E Best, R Devillers - Computer Science Foundations - Springer
This text has arisen out of notes for a lecture on Petri nets that has been held regularly at the
Carl von Ossietzky University of Oldenburg for more than 20 years, mostly by the first author …
Save Cite Related articles