Results 1 
3 of
3
Deciding BisimulationLike Equivalences with FiniteState Processes
, 1999
"... We show that characteristic formulae for nitestate systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branchingtime temporal logic EF. Since EF is a very weak fragment of the modal µcalculus, model checking with EF is decidable for many mo ..."
Abstract

Cited by 49 (16 self)
 Add to MetaCart
(Show Context)
We show that characteristic formulae for nitestate systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branchingtime temporal logic EF. Since EF is a very weak fragment of the modal µcalculus, model checking with EF is decidable for many more classes of infinitestate systems. This yields a general method for proving decidability of bisimulationlike equivalences between infinitestate processes and finitestate ones. We apply this method to the class of PAD processes, which strictly subsumes PA and pushdown (PDA) processes, showing that a large class of bisimulationlike equivalences (including, e.g., strong and weak bisimilarity) is decidable between PAD and finitestate processes. On the other hand, we also demonstrate that no `reasonable' bisimulationlike equivalence is decidable between stateextended PA processes and finitestate ones. Furthermore, weak bisimilarity with finitestate processes is shown to be undecidable even for state...
Roadmap of Infinite Results
, 2008
"... This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
This paper provides a comprehensive summary of equivalence checking results for infinitestate systems. References to the relevant papers will be updated continuously according to the development in the area. The most recent version of this document is available from the webpage
The Complexity of BisimilarityChecking for OneCounter Processes
"... We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
We study the problem of bisimilaritychecking between processes of onecounter automata and finitestate processes. We show that deciding weak bisimilarity between processes of onecounter nets (which are ‘restricted ’ onecounter automata where the counter cannot be tested for zero) and finitestate processes is DPhard. In particular, this means that the problem is both NP and coNP hard. The same technique is used to demonstrate coNPhardness of strong bisimilarity between processes of onecounter nets. Then we design an algorithm which decides weak bisimilarity between processes of onecounter automata and finitestate processes in time which is polynomial for a large subclass of instances, giving a kind of characterization of all hard instances as a byproduct. Moreover, we show how to efficiently estimate the time which is needed to solve a given instance. Finally, we prove that the problem of strong bisimilarity between processes of onecounter automata and finitestate processes is in P.