The Complexity of Boolean State Separation
R Tredup, E Erofeev - International Colloquium on Theoretical Aspects of …, 2020 - Springer
For a Boolean type of nets τ τ, a transition system A is synthesizeable into a τ τ-net N if and
only if distinct states of A correspond to distinct markings of N, and N prevents a transition …
only if distinct states of A correspond to distinct markings of N, and N prevents a transition …
The Complexity of Boolean State Separation (Technical Report)
R Tredup, E Erofeev - arxiv preprint arxiv:2010.00825, 2020 - arxiv.org
For a Boolean type of nets $\tau $, a transition system $ A $ is synthesizeable into a $\tau $-
net $ N $ if and only if distinct states of $ A $ correspond to distinct markings of $ N $, and …
net $ N $ if and only if distinct states of $ A $ correspond to distinct markings of $ N $, and …
[CITATION][C] Zur Komplexität der Synthese von Petri-Netzen
R Tredup - 2021 - Dissertation, Rostock, Universität …