Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
66,235
Symmetry in temporal logic model checking
- ACM Comput. Surv
"... Temporal logic model checking involves checking the state-space of a model of a system to determine whether errors can occur in the system. Often this involves checking symmetrically equivalent areas of the state-space. The use of symmetry reduction to increase the efficiency of model checking has i ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
Temporal logic model checking involves checking the state-space of a model of a system to determine whether errors can occur in the system. Often this involves checking symmetrically equivalent areas of the state-space. The use of symmetry reduction to increase the efficiency of model checking has
The Complexity of Temporal Logic Model Checking
, 2002
"... Temporal logic. Logical formalisms for reasoning about time and the timing of events appear in several fields: physics, philosophy, linguistics, etc. Not surprisingly, they also appear in computer science, a field where logic is ubiquitous. Here temporal logics are used in automated reasoning, in pl ..."
Abstract
-
Cited by 46 (0 self)
- Add to MetaCart
's curricula, thousands of programmers first learn about temporal logic in a course on model checking!
Temporal Logic Model Checking of CSP:
, 2001
"... We study the possibility of doing LTL model checking on CSP speci cations in the context of re nement. We present a technique to perform LTL model checking of CSP processes using re nement checking in general and the FDR tool in particular. We present a tool which automates the translation pr ..."
Abstract
- Add to MetaCart
We study the possibility of doing LTL model checking on CSP speci cations in the context of re nement. We present a technique to perform LTL model checking of CSP processes using re nement checking in general and the FDR tool in particular. We present a tool which automates the translation
Coverage metrics for temporal logic model checking
- in Lecture Notes in Computer Science
, 2001
"... Abstract. In formal verification, we verify that a system is correct with respect to a specification. Even when the system is proven to be correct, there is still a question of how complete the specification is, and whether it really covers all the behaviors of the system. In this paper we study cov ..."
Abstract
-
Cited by 36 (14 self)
- Add to MetaCart
coverage metrics for model checking. Coverage metrics are based on modifications we apply to the system in order to check which parts of it were actually relevant for the verification process to succeed. We introduce two principles that we believe should be part of any coverage metric for model checking: a
Alternating-time Temporal Logic
- Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general var ..."
Abstract
-
Cited by 620 (53 self)
- Add to MetaCart
Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
Reconstructing Temporal Logic Models using the GO Process Ontology 1 Reconstructing Formal Temporal Logic Models of Cellular Events using the GO Process Ontology
"... We present an approach (GOALIE) to use the GO process ontology to reconstruct formal temporal logic models of cellular systems. The reconstructed models are expressed as Kripke structures and support various query, inference, and reasoning operations. This application highlights how the use of an on ..."
Abstract
- Add to MetaCart
We present an approach (GOALIE) to use the GO process ontology to reconstruct formal temporal logic models of cellular systems. The reconstructed models are expressed as Kripke structures and support various query, inference, and reasoning operations. This application highlights how the use
XTL: A Meta-Language and Tool for Temporal Logic Model-Checking
, 1998
"... We present a temporal logic model-checking environment based on a new language called Xtl (eXecutable Temporal Language). Xtl is a functional programming language designed to allow a compact description of various temporal logic operators, which are evaluated over a Labelled Transition System (Lt ..."
Abstract
-
Cited by 20 (2 self)
- Add to MetaCart
We present a temporal logic model-checking environment based on a new language called Xtl (eXecutable Temporal Language). Xtl is a functional programming language designed to allow a compact description of various temporal logic operators, which are evaluated over a Labelled Transition System
Verification of Finite State Systems with Temporal Logic Model Checking
, 1997
"... These tutorial notes contain an introduction to the logical theory and computational aspects of computer aided verification of finite state reactive systems with linear and branching temporal logic model checking. As a general recipe, computer science applications and algorithms are derived from log ..."
Abstract
- Add to MetaCart
These tutorial notes contain an introduction to the logical theory and computational aspects of computer aided verification of finite state reactive systems with linear and branching temporal logic model checking. As a general recipe, computer science applications and algorithms are derived from
Validation of Automation Systems using Temporal Logic Model Checking and Groebner Bases
"... Abstract—Validation of an automation system is an important issue. The goal is to check if the system under investigation, modeled by a Petri net, never enters the undesired states. Usually, tools dedicated to Petri nets such as DESIGN/CPN are used to make reachability analysis. The biggest problem ..."
Abstract
- Add to MetaCart
with this approach is that it is impossible to generate the full occurence graph of the system because it is too large. In this paper, we show how computational methods such as temporal logic model checking and Groebner bases can be used to verify the correctness of the design of an automation system. We report our
Compositional Model Checking
, 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract
-
Cited by 3252 (70 self)
- Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type
Results 1 - 10
of
66,235
