Paper Info
Title
Bounded Petri Net Synthesis from Modal Transition Systems is Undecidable.
Abstract
In this paper, the synthesis of bounded Petri nets from deterministic modal transition systems is shown to be undecidable. The proof is built from three components. First, it is shown that the problem of synthesising bounded Petri nets satisfying a given formula of the conjunctive nu-calculus (a suitable fragment of the mu-calculus) is undecidable. Then, an equivalence between deterministic modal transition systems and a language-based formalism called modal specifications is developed. Finally, the claim follows from a known equivalence between the conjunctive nu-calculus and modal specifications.
Year
Venue
Field
2016
CONCUR
Discrete mathematics,Petri net,Normal modal logic,Computer science,Stochastic Petri net,Equivalence (measure theory),Formalism (philosophy),Modal,Undecidable problem,Bounded function
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
1
Name
Order
Citations
PageRank
Uli Schlachter1265.95