Add to ORKGType article Title Decidability of bisimulation equivalence for processes generating context free language
\ud We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transit...
AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes ...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system o...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation eq...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
Over the past decade much attention has been devoted to the study of process calculi such as CCS, AC...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
AbstractA recent theorem shows that strong bisimilarity is decidable for the class of normed BPA pro...
AbstractWe prove that bisimulation equivalence is decidable for normed pushdown processes
SIGLEAvailable from British Library Document Supply Centre- DSC:5186.0913(ECS-LFCS--91-145) / BLDSC ...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
\ud We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transit...
AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes ...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...
A context-free grammar (CFG) in Greibach Normal Form coincides, in another notation, with a system o...
AbstractA result originally due to Baeten, Bergstra, and Klop shows that strong bisimulation equival...
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation eq...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
Over the past decade much attention has been devoted to the study of process calculi such as CCS, AC...
Over the past fifteen years, there has been intensive study of formal systems that can model concurr...
AbstractWe give NC1 reduction of bisimulation equivalence for (general) normed context-free processe...
Abstract. The fastest known algorithm for checking bisimulation equivalence of normed context-free p...
AbstractA recent theorem shows that strong bisimilarity is decidable for the class of normed BPA pro...
AbstractWe prove that bisimulation equivalence is decidable for normed pushdown processes
SIGLEAvailable from British Library Document Supply Centre- DSC:5186.0913(ECS-LFCS--91-145) / BLDSC ...
AbstractWe show that checking weak bisimulation equivalence of two context-free processes (also call...
\ud We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transit...
AbstractExisting decision algorithms for bisimulation equivalence for normed context-free processes ...
The previous best upper bound on the complexity of deciding bisimilarity between normed context-free...