The Downward-Closure of Petri Net Languages
نویسندگان
چکیده
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability problem of Petri nets. In particular, we rely on Lambert’s construction of marked graph transition sequences — special instances of coverability graphs that allow us to extract constructively the simple regular expression corresponding to the downward-closure. We also consider the remaining language types for Petri nets common in the literature. For all of them, we provide algorithms that compute the simple regular expressions of their downwardclosure. As application, we outline an algorithm to automatically analyse the stability of a system against attacks from a malicious environment.
منابع مشابه
On the Upward/Downward Closures of Petri Nets
We study the size and the complexity of computingfinite state automata (FSA) representing and approximatingthe downward and the upward closure of Petri net languageswith coverability as the acceptance condition. We show how toconstruct an FSA recognizing the upward closure of a Petri netlanguage in doubly-exponential time, and therefore the size is atmost doubly exponent...
متن کاملThe Complexity of Downward Closure Comparisons
The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are computable for quite powerful system models. One advantage of abstracting a language by its downward closure is that then, equivalence and inclusion become deci...
متن کاملSolving Language Equations Using Petri Net Description
The problem of designing a component which asynchronously communicates with a known context such that the overall system conforms to a given specification can be formualted as solving the language equation F ◦X ≺ S where F, X, and S are Petri net languages, ◦ is the asynchronous composition operator, and ≺ represents language containment. This paper proposes a general procedure of computing the...
متن کاملCancellation in context-free languages: enrichment by reduction
Jantzen, M., H. Petersen, Cancellation in context-free languages: enrichment by reduction, Theoretical Computer Science 127 (1994) 1499170. The following problem is shown to be decidable: Given a context-free grammar G and a string weX*, does there exist a string ueL(G) such that w is obtained from u by deleting all substrings ui that are elements of the symmetric Dyck set DT? The intersection ...
متن کاملConcurrent Regular Expressions and Their Relationship to Petri Nets
We deene algebraic systems called concurrent regular expressions which provide a modular description of languages of Petri nets. Concurrent regular expressions are extension of regular expressions with four operators-interleaving, interleaving closure, synchronous composition and renaming. This alternative characterization of Petri net languages gives us a exible way of specifying concurrent sy...
متن کامل