AbstractWe present a sound and complete tableau proof system for establishing whether a set of elements of an arbitrary transition system model has a property expressed in (a slight extension of) the modal mu-calculus. The proof system, we believe, offers a very general verification method applicable to a wide range of computational systems
) 1 J. Rathke and M. Hennessy Dept. of Cognitive and Computing Science, University of Sussex, Brig...
This article revisits soundness and completeness of proof systems for proving that sets of states in...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
AbstractWe present a sound and complete tableau proof system for establishing whether a set of eleme...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
) ? Oleg V. Sokolsky Scott A. Smolka Department of Computer Science SUNY at Stony Brook Stony Broo...
AbstractModel checking is an automatic technique for verifying properties of finite concurrent syste...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
Many notions of models in computer science provide quantitative information, or uncertainties, which...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
The higher-dimensional modal µ-calculus is an extension of the µ-calculus in which formulas are inte...
) 1 J. Rathke and M. Hennessy Dept. of Cognitive and Computing Science, University of Sussex, Brig...
This article revisits soundness and completeness of proof systems for proving that sets of states in...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
AbstractWe present a sound and complete tableau proof system for establishing whether a set of eleme...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
In this paper we improve a model checking algorithm based on the tableau method of Stifling and Walk...
AbstractThis note presents a straightforward algorithm for checking whether or not a state of a labe...
Abstract. The verification of systems with infinite state spaces has attained considerable attention...
) ? Oleg V. Sokolsky Scott A. Smolka Department of Computer Science SUNY at Stony Brook Stony Broo...
AbstractModel checking is an automatic technique for verifying properties of finite concurrent syste...
Model-checking is a popular technique for verifying finite-state concurrent systems, the behaviour o...
Many notions of models in computer science provide quantitative information, or uncertainties, which...
This paper presents a proof method for proving that infinite-state systems satisfy properties expres...
The logic considered in this paper is FLC, fixed point logic with chop. It is an extension of modal...
The higher-dimensional modal µ-calculus is an extension of the µ-calculus in which formulas are inte...
) 1 J. Rathke and M. Hennessy Dept. of Cognitive and Computing Science, University of Sussex, Brig...
This article revisits soundness and completeness of proof systems for proving that sets of states in...
Abstract. The higher-dimensional modal µ-calculus is an extension of the µ-calculus that has been in...
DOI
Add to ORKG