Results 1  10
of
43,185
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 572 (50 self)
 Add to MetaCart
in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately
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 749 (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
ModelChecking in Dense Realtime
 INFORMATION AND COMPUTATION
, 1993
"... Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends on t ..."
Abstract

Cited by 324 (7 self)
 Add to MetaCart
Modelchecking is a method of verifying concurrent systems in which a statetransition graph model of the system behavior is compared with a temporal logic formula. This paper extends modelchecking for the branchingtime logic CTL to the analysis of realtime systems, whose correctness depends
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 363 (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
Employing Timed CTL assumptions in modular veri cation of invariant properties of real time component based systems Employing Timed CTL assumptions in modular verification of invariant properties of real time component based systems
"... Abstract The extant assumeguarantee approaches for real time systems use timed language or equivalently timed automata based specifications of assumptions. But discharging timed automata assumptions on environment models requires simulationchecking. On the other hand, discharging an assumption in ..."
Abstract
 Add to MetaCart
Abstract The extant assumeguarantee approaches for real time systems use timed language or equivalently timed automata based specifications of assumptions. But discharging timed automata assumptions on environment models requires simulationchecking. On the other hand, discharging an assumption
Model Checking of Probabilistic and Nondeterministic Systems
, 1995
"... . The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and verification of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. ..."
Abstract

Cited by 286 (13 self)
 Add to MetaCart
. In this paper, we present modelchecking algorithms for extensions of pCTL and pCTL* to systems in which the probabilistic behavior coexists with nondeterminism, and show that these algorithms have polynomialtime complexity in the size of the system. This provides a practical tool for reasoning
CTL and Equivalent Sublanguages of CTL*
 IFIP CONFERENCE ON COMPUTER HARDWARE DESCRIPTION LANGUAGES AND THEIR APPLICATIONS (CHDL
, 1996
"... Specifications of finite state algorithms with a complex temporal behavior such as protocols or hardware systems are often given in temporal logics as e.g. CTL or CTL*. On the one hand, CTL offers in comparison to CTL* efficient model checking algorithms, but on the other hand, CTL seems to suffer ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
Specifications of finite state algorithms with a complex temporal behavior such as protocols or hardware systems are often given in temporal logics as e.g. CTL or CTL*. On the one hand, CTL offers in comparison to CTL* efficient model checking algorithms, but on the other hand, CTL seems to suffer
On the hybrid extension of CTL and CTL+
, 2009
"... The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branchingtime logics CTL and CTL + by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H 1 CTL + a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The paper studies the expressivity, relative succinctness and complexity of satisfiability for hybrid extensions of the branchingtime logics CTL and CTL + by variables. Previous complexity results show that only fragments with one variable do have elementary complexity. It is shown that H 1 CTL
Decision Procedures and Expressiveness in the Temporal Logic of Branching Time
, 1985
"... We consider the computation tree logic (CTL) proposed in (Set. Comput. Programming 2 ..."
Abstract

Cited by 189 (4 self)
 Add to MetaCart
We consider the computation tree logic (CTL) proposed in (Set. Comput. Programming 2
Results 1  10
of
43,185