Add to ORKGThe paper shows a LOGSPACE-reduction from the Boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (ie, language inclusion) is PTIME-hard, even for finite acyclic labelled transition systems. This reproves and substantially extends the result of Balcazar, Gabarro and Santha (1992) for bisimilarity
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
AbstractIn the study of process semantics, trace equivalence and bisimulation equivalence constitute...
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that ...
This paper gives an overview of the computational complexity of all the equivalences in the linear/b...
We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to fi...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of ...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractA concurrent system of synchronous communicating agents is assembled from simpler sequential...
AbstractWe investigate the complexity of preorder checking when the specification is a flat finite-s...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecif...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
AbstractIn the study of process semantics, trace equivalence and bisimulation equivalence constitute...
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that ...
This paper gives an overview of the computational complexity of all the equivalences in the linear/b...
We study the complexity of comparing pushdown automata (PDA) and context-free processes (BPA) to fi...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of ...
Computational complexity of comparing behaviours of systems composed from interacting finite-state c...
Abstract We study the following problems for strong and weak bisimulation equivalence: given a label...
AbstractA concurrent system of synchronous communicating agents is assembled from simpler sequential...
AbstractWe investigate the complexity of preorder checking when the specification is a flat finite-s...
AbstractIn this paper we consider the problem of deciding bisimulation equivalence of a BPP and a fi...
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecif...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
. We study the following problems for strong and weak bisimulation equivalence: given a labelled Pet...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
AbstractIn the study of process semantics, trace equivalence and bisimulation equivalence constitute...