Results 1  10
of
1,953
Closure Under Stuttering in Temporal Formulas
, 1999
"... Linear time temporal logic (LTL) has received a lot of attention as a language for program specification and verification. Unfortunately, not all properties expressed in LTL are closed under stuttering, a property important from both the practical and philosophical perspectives. In this thesis we ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Linear time temporal logic (LTL) has received a lot of attention as a language for program specification and verification. Unfortunately, not all properties expressed in LTL are closed under stuttering, a property important from both the practical and philosophical perspectives. In this thesis
Alternatingtime Temporal Logic
 Journal of the ACM
, 1997
"... Temporal logic comes in two varieties: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime 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: lineartime temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branchingtime temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general
A Normal Form for FirstOrder Temporal Formulae
 In Proceedings of Eleventh International Conference on Automated Deduction (CADE
, 1992
"... In this paper a normal form for formulae of a firstorder temporal logic is described. This normal form, called FirstOrder Separated Normal Form (SNF f ), forms the basis of both a temporal resolution method [5] and a family of executable temporal logics [2]. A firstorder temporal logic, based o ..."
Abstract

Cited by 29 (15 self)
 Add to MetaCart
In this paper a normal form for formulae of a firstorder temporal logic is described. This normal form, called FirstOrder Separated Normal Form (SNF f ), forms the basis of both a temporal resolution method [5] and a family of executable temporal logics [2]. A firstorder temporal logic, based
Functionals for the Semantic Specification of Temporal Formulas for Model Checking
"... WWW home page: ..."
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
Binary Decision Diagrams (Bryant, R. E., 1986, IEEE Trans. Comput. C35) to represent relations and formulas. We then show how our new MuCalculus model checking algorithm can be used to derive efficient decision procedures for CTL model checking, satistiability of lineartime temporal logic formulas
GOAL: A graphical tool for manipulating Büchi automata and temporal formulae
 In Proceedings of TACAS (2007), LNCS 4424
, 2007
"... In this paper, we present a tool named GOAL (an acronym derived from “Graphical Tool for OmegaAutomata and Logics”) whose main functions include (1) drawing and testing Büchi automata, (2) checking the language equivalence between two Büchi automata, (3) translating quantified propositional linear ..."
Simple Onthefly Automatic Verification of Linear Temporal Logic
, 1995
"... We present a tableaubased algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "onthefly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model. ..."
Abstract

Cited by 327 (29 self)
 Add to MetaCart
We present a tableaubased algorithm for obtaining an automaton from a temporal logic formula. The algorithm is geared towards being used in model checking in an "onthefly" fashion, that is the automaton can be constructed simultaneously with, and guided by, the generation of the model
Checking Linear Temporal Formulas on Sequential Recursive Petri Nets
"... Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. Whereas this model is a strict extension of Petri nets and contextfree grammars (w.r.t. the language criterion), reachability in RPNs remains decidable. However the kind of model checking which is decidable for ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. Whereas this model is a strict extension of Petri nets and contextfree grammars (w.r.t. the language criterion), reachability in RPNs remains decidable. However the kind of model checking which is decidable for Petri nets becomes undecidable for RPNs. In this work, we introduce a submodel of RPNs called sequential recursive Petri nets (SRPNs) and we study the model checking of the actionbased linear time logic on SRPNs. We prove that it is decidable for all its variants : finite sequences, finite maximal sequences, infinite sequences and divergent sequences. At the end, we analyze language aspects proving that the SRPN languages still strictly include the union of Petri nets and contextfree languages and that the family of languages of SRPNs is closed under intersection with regular languages (unlike the one of RPNs).
A Logic for Reasoning about Time and Reliability
 Formal Aspects of Computing
, 1994
"... We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas are inter ..."
Abstract

Cited by 371 (1 self)
 Add to MetaCart
We present a logic for stating properties such as, "after a request for service there is at least a 98% probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabilities. Formulas
Results 1  10
of
1,953