Results 1 
5 of
5
Actions Speak Louder than Words: Proving Bisimilarity for ContextFree Processes
, 1997
"... Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirected ..."
Abstract

Cited by 47 (10 self)
 Add to MetaCart
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirected rules. The decision procedure also provides the essential part of the bisimulation relation between two processes which underlies their equivalence. We also show how to obtain a sound and complete sequentbased equational theory for such processes from the tableau system and how one can extract what Caucal calls a fundamental relation from a successful tableau.
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 46 (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...
Bisimulation equivalence is decidable for normed Process Algebra (Extended Abstract)
 PROCEEDINGS OF ICALP'99, TO APPEAR, LECTURE NOTES IN COMPUTER SCIENCE
, 1999
"... We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is "elementary," having doubly exponential nondeterministic time complexity. ..."
Abstract

Cited by 36 (0 self)
 Add to MetaCart
(Show Context)
We present a procedure for deciding whether two normed PA terms are bisimilar. The procedure is "elementary," having doubly exponential nondeterministic time complexity.
Decidable FirstOrder Transition Logics for PAProcesses
 In 27th Int. Coll. on Automata, Languages and Programming (ICALP), 342353. LNCS 1853
, 2000
"... We show the decidability of model checking PAprocesses against several firstorder logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a sm ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We show the decidability of model checking PAprocesses against several firstorder logics based upon the reachability predicate. The main tool for this result is the recognizability by tree automata of the reachability relation. The tree automata approach and the transition logics we use allow a smooth and general treatment of parameterized model checking for PA. This approach is extended to handle a quite general notion of costs of PAsteps. In particular, when costs are Parikh images of traces, we show decidability of a transition logic extended by some form of firstorder reasoning over costs. Key words: Regular model checking, Verification of recursive parallel systems, Transition logics, Regular tree languages
On finite representations of infinitestate behaviours
 Information Processing Letters
, 1999
"... Abstract. We examine the problem of finitestate representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and ju ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We examine the problem of finitestate representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularity becomes insufficient in case of all equivalences of van Glabbeek’s hierarchy except bisimilarity, and we design and justify a generalization in the form of strong regularity and finite characterizations. We show that the condition of strong regularity guarantees an existence of finite characterization in case of all equivalences of van Glabbeek’s hierarchy, and we also demonstrate that there are behaviours which are regular but not strongly regular w.r.t. all equivalences of the mentioned hierarchy except bisimilarity. 1