Interrelation of Languages of Colored Petri Nets and Some Traditional Languages

Interrelation of Languages of Colored Petri Nets and Some Traditional Languages

The article studies the interrelation of Languages of Colored Petri Nets and Traditional formal languages. The author constructed the graph of Colored Petri Net, which generates L Context-free language. This language may not be modeled using standard Petri Nets [1]. The Venn graph and diagram that the author modified [1], show the interrelation between languages of Colored Petri Nets and some T...

Petri Nets, Flat Languages and Linear Arithmetic

We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying some rules of decomposition that transform general sets of computation paths into \\at" ones. We apply the method for expressing the reachability relation of Petri nets as a linear arithmetic formula in order to prove (or disprove) their sa...

SYNOPS - Generation of Partial Languages and Synthesis of Petri Nets

We present the command line tool SYNOPS. It allows the term-based construction of partial languages consisting of different kinds of causal structures representing runs of a concurrent system: labeled directed acyclic graphs (LDAGs), labeled partial orders (LPOs), labeled stratified directed acyclic graphs (LSDAGs) and labeled stratified order structures (LSOs). It implements region based algor...

Wadge Degrees of $\omega$-Languages of Petri Nets

We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Turing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective...

The Wadge Hierarchy of Petri Nets omega-Languages