Add to ORKGWe show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the decidability result for strong bisimilarity by Baeten, Bergstra, and Klop
This thesis studies behavioural equivalences on labelled infinite transition graphs and the role tha...
AbstractBisimilarity and regularity are decidable properties for the class of BPA (or context-free) ...
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
AbstractIn this paper we use the tableau as a means to prove decidability of weak bisimulation for n...
The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branchi...
© The Author(s) 2013. This article is published with open access at Springerlink.com Abstract We inv...
AbstractA recent theorem shows that strong bisimilarity is decidable for the class of normed BPA pro...
The paper presents an elaborated and simplified version of the structuralresult for branching bisimi...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
The paper presents an elaborated and simplified version of the structural result for branching bisim...
Branching bisimilarity of normed Basic Process Algebra (nBPA) was claimed to be EXPTIME-hard in prev...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
This thesis studies behavioural equivalences on labelled infinite transition graphs and the role tha...
AbstractBisimilarity and regularity are decidable properties for the class of BPA (or context-free) ...
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
AbstractIn this paper we use the tableau as a means to prove decidability of weak bisimulation for n...
The branching bisimulation defined by Van Glabbeek and Weijland takes care of preserving the branchi...
© The Author(s) 2013. This article is published with open access at Springerlink.com Abstract We inv...
AbstractA recent theorem shows that strong bisimilarity is decidable for the class of normed BPA pro...
The paper presents an elaborated and simplified version of the structuralresult for branching bisimi...
AbstractWe compare the classes of behaviours (transition systems) which can be generated by normed B...
The paper presents an elaborated and simplified version of the structural result for branching bisim...
Branching bisimilarity of normed Basic Process Algebra (nBPA) was claimed to be EXPTIME-hard in prev...
. Basic Parallel Processes (BPP) are a natural subclass of CCS infinite-state processes. They are al...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
This thesis studies behavioural equivalences on labelled infinite transition graphs and the role tha...
AbstractBisimilarity and regularity are decidable properties for the class of BPA (or context-free) ...
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...