AbstractWe introduce a generic family of behavioral relations for which the regular equivalence problem (i.e., comparing an arbitrary transition system to some finite-state 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 well-known families of infinite-state systems
AbstractRegular model checking is a method for verifying infinite-state systems based on coding thei...
The paper shows a LOGSPACE-reduction from the Boolean circuit value problem which demonstrates that ...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
Abstract. We introduce a generic family of behavioral relations for which the problem of comparing a...
Model checking is a fully-automatic formal verification method that has been extremely successful i...
Model checking is a fully-automatic formal verification method that has been extremely successful in...
In this paper, we discuss the issues associated with proving complete equivalences within Non-Finite...
AbstractChecking infinite-state systems is frequently done by encoding infinite sets of states as re...
We present regular model checking, a framework for algorithmic verification of infinite-state system...
AbstractWe examine the computational complexity of testing finite state processes for equivalence in...
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular la...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
AbstractRegular model checking is a method for verifying infinite-state systems based on coding thei...
The paper shows a LOGSPACE-reduction from the Boolean circuit value problem which demonstrates that ...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
Abstract. We introduce a generic family of behavioral relations for which the problem of comparing a...
Model checking is a fully-automatic formal verification method that has been extremely successful i...
Model checking is a fully-automatic formal verification method that has been extremely successful in...
In this paper, we discuss the issues associated with proving complete equivalences within Non-Finite...
AbstractChecking infinite-state systems is frequently done by encoding infinite sets of states as re...
We present regular model checking, a framework for algorithmic verification of infinite-state system...
AbstractWe examine the computational complexity of testing finite state processes for equivalence in...
Checking infinite-state systems is frequently done by encoding infinite sets of states as regular la...
AbstractWe show that characteristic formulae for finite-state systems up to bisimulation-like equiva...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
AbstractRegular model checking is a method for verifying infinite-state systems based on coding thei...
The paper shows a LOGSPACE-reduction from the Boolean circuit value problem which demonstrates that ...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...