Add to ORKGAbstract We report on an implementation of the unfolding approach to model-checking LTL-X presented in [3]. Contrary to [3], we consider an state-based version of LTL-X, which is more used in practice. We improve on the checking algorithm; the new version allows to reuse code much more eciently. We present results on a set of case studies.
In previous work, we presented symbolic reachability analysis by linking ProB, an animator and model...
This report describes a framework for symbolic Linear Temporal Logic (LTL) model checking that suppo...
Even though the expressiveness of linear temporal logic (LTL) supports engineering application, mode...
We report on an implementation of the unfolding approach to model-checking LTL-X recently presented ...
International audienceIn this paper, we present new technique designing to solve the on-the-fly mode...
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using...
In this paper we consider unbounded model checking for systems that can be specified in Linear Time ...
Abstract. The verification process of reactive systems in local model checking [2, 9, 28] and in exp...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Abstract. We present a framework for model checking concurrent software systems which incorporates b...
Abstract. A subset of LTL is presented that can be translated to ω-automata with only a linear numbe...
AbstractMcMillan (1992) described a technique for deadlock detection based on net unfoldings. We ext...
Abstract. The verification process of reactive systems in local model checking [2,9,28]andinexplicit...
We present an LTL model checker whose code has been completely verified using the Isabelle theorem p...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
In previous work, we presented symbolic reachability analysis by linking ProB, an animator and model...
This report describes a framework for symbolic Linear Temporal Logic (LTL) model checking that suppo...
Even though the expressiveness of linear temporal logic (LTL) supports engineering application, mode...
We report on an implementation of the unfolding approach to model-checking LTL-X recently presented ...
International audienceIn this paper, we present new technique designing to solve the on-the-fly mode...
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using...
In this paper we consider unbounded model checking for systems that can be specified in Linear Time ...
Abstract. The verification process of reactive systems in local model checking [2, 9, 28] and in exp...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Abstract. We present a framework for model checking concurrent software systems which incorporates b...
Abstract. A subset of LTL is presented that can be translated to ω-automata with only a linear numbe...
AbstractMcMillan (1992) described a technique for deadlock detection based on net unfoldings. We ext...
Abstract. The verification process of reactive systems in local model checking [2,9,28]andinexplicit...
We present an LTL model checker whose code has been completely verified using the Isabelle theorem p...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
In previous work, we presented symbolic reachability analysis by linking ProB, an animator and model...
This report describes a framework for symbolic Linear Temporal Logic (LTL) model checking that suppo...
Even though the expressiveness of linear temporal logic (LTL) supports engineering application, mode...