Add to ORKGWe prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for finite bounded Petri nets. The proofs are based on a generalization of the ordered marking proof technique that Vogler used to demonstrate that (strong) fully-concurrent bisimilarity (or, equivalently, historypreserving bisimilarity) is decidable on finite safe nets
BPP nets, a subclass of finite P/T nets, were equipped in [13] with an efficiently decidable, truly ...
After various attempts, an equivalence relation is defined for labelled Petri nets, on the base of t...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed by Schnoebelen and co...
Net bisimilarity is a behavioral equivalence for finite Petri nets, which is equivalent to structure...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \cite{ABS91} and p...
AbstractWe show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
Place bisimilarity 3cp is a behavioral equivalence for finite Petri nets, proposed in [1] and prove...
We investigate the satisfiability problem for a logic for true concurrency, whose formulae predicate...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
AbstractThe main result shows the undecidability of (strong) bisimilarity for labelled (place/transi...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
BPP nets, a subclass of finite P/T nets, were equipped in [13] with an efficiently decidable, truly ...
After various attempts, an equivalence relation is defined for labelled Petri nets, on the base of t...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed by Schnoebelen and co...
Net bisimilarity is a behavioral equivalence for finite Petri nets, which is equivalent to structure...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed in \cite{ABS91} and p...
AbstractWe show that the pomset-trace equivalence problem for 1-safe, finite Petri nets is decidable...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
Place bisimilarity 3cp is a behavioral equivalence for finite Petri nets, proposed in [1] and prove...
We investigate the satisfiability problem for a logic for true concurrency, whose formulae predicate...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
AbstractThe main result shows the undecidability of (strong) bisimilarity for labelled (place/transi...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
BPP nets, a subclass of finite P/T nets, were equipped in [13] with an efficiently decidable, truly ...
After various attempts, an equivalence relation is defined for labelled Petri nets, on the base of t...
For finite-state systems non-interleaving equivalences are computationallyat least as hard as interl...