We study the following problems for strong and weak bisimulation equivalence: given a labelled Petri net and a finite transition system, are they equivalent?; given a labelled Petri net, is it equivalent to some (unspecified) finite transition system? We show that both problems are decidable for strong bisimulation and undecidable for weak bisimulation
Petri nets are a popular formalism for modeling and analyzing distributedsystems. Tokens in Petri ne...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractThe main result shows the undecidability of (strong) bisimilarity for labelled (place/transi...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
Place bisimilarity 3cp is a behavioral equivalence for finite Petri nets, proposed in [1] and prove...
AbstractWe consider the following problems: (a) Given a labelled Petri net and a finite automaton, a...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
We establish Σ1 1-completeness (in the analytical hierarchy) of weak bisimilarity checking for infin...
We establish 11-completeness (in the analytical hierarchy) of weak bisimilarity checking for innite-...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed by Schnoebelen and co...
Petri nets are a popular formalism for modeling and analyzing distributedsystems. Tokens in Petri ne...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractThe main result shows the undecidability of (strong) bisimilarity for labelled (place/transi...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
Place bisimilarity 3cp is a behavioral equivalence for finite Petri nets, proposed in [1] and prove...
AbstractWe consider the following problems: (a) Given a labelled Petri net and a finite automaton, a...
We prove that (strong) fully-concurrent bisimilarity and causal-net bisimilarity are decidable for f...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
We establish Σ1 1-completeness (in the analytical hierarchy) of weak bisimilarity checking for infin...
We establish 11-completeness (in the analytical hierarchy) of weak bisimilarity checking for innite-...
Place bisimilarity is a behavioral equivalence for finite Petri nets, proposed by Schnoebelen and co...
Petri nets are a popular formalism for modeling and analyzing distributedsystems. Tokens in Petri ne...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
DOI
Add to ORKG