Results 1  10
of
467
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
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 327 (7 self)
 Add to MetaCart
on the magnitudes of the timing delays. For specifications, we extend the syntax of CTL to allow quantitative temporal operators such as 93!5 , meaning "possibly within 5 time units." The formulas of the resulting logic, Timed CTL (TCTL), are interpreted over continuous computation trees, trees in which
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 291 (13 self)
 Add to MetaCart
. 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
Specifying and enforcing intertask dependencies
 In Proceedings of the 19th VLDB Conference
, 1993
"... Extensions of the traditional atomic transaction model are needed to support the development of multisystem applications or work ows that access heterogeneous databases and legacy application systems. Most extended transaction models use conditions involving events or dependencies between transacti ..."
Abstract

Cited by 143 (28 self)
 Add to MetaCart
formalization of a dependency into the temporal logic CTL, we can automatically synthesize an automaton that captures the computations that satisfy the given dependency. We show how a set of such automata can be combined into a scheduler that produces global computations satisfying all relevant dependencies. We
It Usually Works: The Temporal Logic of Stochastic Systems
, 1995
"... . In this paper the branching time logic pCTL is defined. pCTL expresses quantitative bounds on the probabilities of correct behavior; it can be interpreted over discrete Markov processes. A bisimulation relation is defined on finite Markov processes, and shown to be sound and complete with re ..."
Abstract

Cited by 103 (0 self)
 Add to MetaCart
. In this paper the branching time logic pCTL is defined. pCTL expresses quantitative bounds on the probabilities of correct behavior; it can be interpreted over discrete Markov processes. A bisimulation relation is defined on finite Markov processes, and shown to be sound and complete
Leadsto: A language and environment for analysis of dynamics by simulation
 Proc. of the Third German Conference on MultiAgent System Technologies, MATES'05. Lecture Notes in Artificial Intelligence
, 2005
"... Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended w ..."
Abstract

Cited by 182 (136 self)
 Add to MetaCart
Abstract. This paper presents the language and software environment LEADSTO that has been developed to model and simulate the dynamics of MultiAgent Systems (MAS) in terms of both qualitative and quantitative concepts. The LEADSTO language is a declarative ordersorted temporal language, extended
Resolution for a Temporal Logic of Robustness (Extended Version)
"... Abstract. The logic RoCTL * is an extension of the branching time temporal logic CTL * to represent robustness and reliability in systems. New operators are introduced dealing with obligation (where no failures occur) and robustness (where at most one additional failure occurs). The only known decis ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
decision procedure for the temporal logic of robustness RoCTL * involves a reduction to the nonelementary QCTL * logic. Here we propose a CTL like restriction of RoCTL*, termed RoCTL, and show that this logic is useful in specifying systems. We also provide a satisfiability preserving translation into a
U.: Quantitative µcalculus and CTL based on constraint semirings
 ENTCS
, 2005
"... Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean
OCL meets CTL: Towards CTLExtended OCL Model Checking ⋆
"... Abstract. In software modeling, the Object Constraint Language (OCL) is an important tool to specify properties that a model has to satisfy. The design of OCL reflects the structure of MOFbased modeling languages like UML and the tight integration results in an intuitive usability. However, OCL all ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
allows to express properties in the context of the current state of an instance model only but not with respect to its evolution. In this paper, we show how OCL can be extended with CTLbased temporal operators to express properties over the lifetime of an instance model. We explain syntax and semantics
Quantitative μcalculus and CTL defined over constraint semirings
, 2005
"... Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean ..."
Abstract
 Add to MetaCart
? We present a generalization of two wellknown temporal logics: CTL and the  calculus. Both extensions are defined over csemirings, an algebraic structure that captures quantitative aspects like quality of service or soft constraints. Basically, a csemiring consists of a domain, an additive
Results 1  10
of
467