Results 1 
4 of
4
Simulation and Bisimulation over OneCounter Processes
, 2000
"... We show an effective construction of (a periodicity description of) the maximal simulation relation for a given onecounter net. Then we demonstrate how to reduce simulation problems over onecounter nets to analogous bisimulation problems over onecounter automata. We use this to demonstrate th ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
We show an effective construction of (a periodicity description of) the maximal simulation relation for a given onecounter net. Then we demonstrate how to reduce simulation problems over onecounter nets to analogous bisimulation problems over onecounter automata. We use this to demonstrate the decidability of various problems, specifically testing regularity and strong regularity of onecounter nets with respect to simulation equivalence, and testing simulation equivalence between a onecounter net and a deterministic pushdown automaton. Various obvious generalisations of these problems are known to be undecidable. 1
A Logical Viewpoint on ProcessAlgebraic Quotients
, 1999
"... We study the following problem: Given a transition system T and its quotient T= under an equivalence , which are the sets L, L of HennessyMilner formulae such that: if ' 2 L and T satisfies ', then T= satisfies '; if ' 2 L and T= satisfies ', then T satisfies &ap ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
We study the following problem: Given a transition system T and its quotient T= under an equivalence , which are the sets L, L of HennessyMilner formulae such that: if ' 2 L and T satisfies ', then T= satisfies '; if ' 2 L and T= satisfies ', then T satisfies '.
A General Approach to Comparing InfiniteState Systems with Their FiniteState Specifications
"... Abstract. We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finitestate specification can be reduced to a model checking problem against simple modal formulae. As an application, we derive decidability of several regula ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finitestate specification can be reduced to a model checking problem against simple modal formulae. As an application, we derive decidability of several regular equivalence problems for wellknown families of infinitestate systems. 1
A General Approach to Comparing InfiniteState Systems with Their FiniteState Specifications
"... France. We introduce a generic family of behavioral relations for which the regular equivalence problem (i.e., comparing an arbitrary transition system to some finitestate specification) can be reduced to the model checking problem against simple modal formulae. As an application, we derive decida ..."
Abstract
 Add to MetaCart
(Show Context)
France. We introduce a generic family of behavioral relations for which the regular equivalence problem (i.e., comparing an arbitrary transition system to some finitestate specification) can be reduced to the model checking problem against simple modal formulae. As an application, we derive decidability of several regular equivalence problems for wellknown families of infinitestate systems.