Add to ORKGThis paper is an approach to combine the reachability problem with semantic notions like bisimulation equivalence. It deals with questions of the following form: Is a state reachable that is bisimulation equivalent to a given state? Here we show some decidability results for process algebras and Petri nets
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
AbstractThis paper is an approach to combine the reachability problem with semantic notions like bis...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
This thesis is concerned with the question of obtaining decidable theories for behavioural equivalen...
We define a class of process algebras with a generalised operation $sum$ that allows explicit treatm...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence tha...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
Abstract. In this paper, we present a symbolic reachability algorithm for process algebras with recu...
We give semantic characterizations for reachability and trace equivalence in a version of asynchrono...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...
AbstractThis paper is an approach to combine the reachability problem with semantic notions like bis...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
This thesis is concerned with the question of obtaining decidable theories for behavioural equivalen...
We define a class of process algebras with a generalised operation $sum$ that allows explicit treatm...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics a...
The main result shows the undecidability of (strong) bisimilarity for labelled (place / transition)...
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence tha...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
Abstract. In this paper, we present a symbolic reachability algorithm for process algebras with recu...
We give semantic characterizations for reachability and trace equivalence in a version of asynchrono...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed orig...
Permission of the editors to include the present Chapter I here is gratefully acknowledged. In this ...
In this paper a process is viewed as a labeled graph modulo bisimulation equivalence. Three topics ...