Abstract. We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state speci-fication can be reduced to a model checking problem against simple modal for-mulae. As an application, we derive decidability of several regular equivalence problems for well-known families of infinite-state systems.
Abstract. We report on recent progress in the study of infinite transition systems for which interes...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
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...
This paper provides a comprehensive summary of equivalence checking results for infinite-state syste...
Abstract. We report on recent progress in the study of infinite transition systems for which interes...
Abstract. We report on recent progress in the study of infinite transition systems for which interes...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
AbstractWe introduce a generic family of behavioral relations for which the regular equivalence prob...
The paper presents a selection of recently developed and/or used techniques for equivalence-checking...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
International audienceWe present a decidability result for the model checking of a certain class of ...
The paper presents an overview of techniques and results for equivalence-checking with infinite-stat...
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...
This paper provides a comprehensive summary of equivalence checking results for infinite-state syste...
Abstract. We report on recent progress in the study of infinite transition systems for which interes...
Abstract. We report on recent progress in the study of infinite transition systems for which interes...
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. ...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...