We report on an implementation of the unfolding approach to model-checking LTL-X recently presented by the authors. Contrary to that work, 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 efficiently. We present results on a set of case studies. KEYWORDS: Net unfoldings, model checking, tableau systems, Petri nets, LTL Contents
The date of receipt and acceptance will be inserted by the editor Abstract. Model checking based on ...
Abstract. In this paper bounded model checking of asynchronous concurrent systems is introduced as a...
International audienceWe present the implementation in Isabelle/HOL of a translation of LTL formulae...
Abstract We report on an implementation of the unfolding approach to model-checking LTL-X presented ...
International audienceIn this paper, we present new technique designing to solve the on-the-fly mode...
In this paper we consider unbounded model checking for systems that can be specified in Linear Time ...
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using...
Abstract. The verification process of reactive systems in local model checking [2, 9, 28] and in exp...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
AbstractMcMillan (1992) described a technique for deadlock detection based on net unfoldings. We ext...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Abstract. The verification process of reactive systems in local model checking [2,9,28]andinexplicit...
National audienceStructural model abstraction is a powerful technique for reducing the complexity of...
Abstract. A subset of LTL is presented that can be translated to ω-automata with only a linear numbe...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
The date of receipt and acceptance will be inserted by the editor Abstract. Model checking based on ...
Abstract. In this paper bounded model checking of asynchronous concurrent systems is introduced as a...
International audienceWe present the implementation in Isabelle/HOL of a translation of LTL formulae...
Abstract We report on an implementation of the unfolding approach to model-checking LTL-X presented ...
International audienceIn this paper, we present new technique designing to solve the on-the-fly mode...
In this paper we consider unbounded model checking for systems that can be specified in Linear Time ...
We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using...
Abstract. The verification process of reactive systems in local model checking [2, 9, 28] and in exp...
AbstractIn this paper we present algorithms for model checking CTL over systems specified as Petri n...
AbstractMcMillan (1992) described a technique for deadlock detection based on net unfoldings. We ext...
AbstractThe verification process of reactive systems in local model checking [1,7] and in explicit s...
Abstract. The verification process of reactive systems in local model checking [2,9,28]andinexplicit...
National audienceStructural model abstraction is a powerful technique for reducing the complexity of...
Abstract. A subset of LTL is presented that can be translated to ω-automata with only a linear numbe...
Model-checking is a powerful and widespread technique for the verification of finite state concurren...
The date of receipt and acceptance will be inserted by the editor Abstract. Model checking based on ...
Abstract. In this paper bounded model checking of asynchronous concurrent systems is introduced as a...
International audienceWe present the implementation in Isabelle/HOL of a translation of LTL formulae...