Results 1  10
of
744
Computation tree logic model checking based on possibility measures, Fuzzy Sets and Systems
"... ar ..."
Reachability Analysis of Pushdown Automata: Application to ModelChecking
, 1997
"... We apply the symbolic analysis principle to pushdown systems. We represent (possibly infinite) sets of configurations of such systems by means of finitestate automata. In order to reason in a uniform way about analysis problems involving both existential and universal path quantification (like mode ..."
Abstract

Cited by 376 (38 self)
 Add to MetaCart
modelchecking for branchingtime logics), we consider the more general class of alternating pushdown systems and use alternating finitestate automata as a representation structure for their sets of configurations. We give a simple and natural procedure to compute sets of predecessors
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
Quantitative Computation Tree Logic Model Checking Based on Generalized Possibility Measures
"... ar ..."
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 276 (27 self)
 Add to MetaCart
Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a
Model Checking for a Probabilistic Branching Time Logic with Fairness
 Distributed Computing
, 1998
"... We consider concurrent probabilistic systems, based on probabilistic automata of Segala & Lynch [55], which allow nondeterministic choice between probability distributions. These systems can be decomposed into a collection of "computation trees" which arise by resolving the nondeterm ..."
Abstract

Cited by 131 (41 self)
 Add to MetaCart
over a certain kind of fair computation trees. We then present a model checking algorithm for...
Model Checking Quantified Computation Tree Logic
 Proceedings of the 17th International Conference on Concurrency Theory (CONCURâ€™06
, 2006
"... Abstract. Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification and temporal ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such entities through computation steps, since this requires the ability to freely mix quantification
Polytime Model Checking for Timed Probabilistic Computation Tree Logic.
 Acta Inf
, 1996
"... We consider the modelchecking problem for Timed Probabilistic Computation Tree Logic (TPCTL) introduced by H. A. Hansson and D. Jonsson, and studied in a recent book by H. A. Hansson [Han94]. The semantics of TPCTL is defined in terms of probabilistic transition systems. It is shown in [Han94] that ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We consider the modelchecking problem for Timed Probabilistic Computation Tree Logic (TPCTL) introduced by H. A. Hansson and D. Jonsson, and studied in a recent book by H. A. Hansson [Han94]. The semantics of TPCTL is defined in terms of probabilistic transition systems. It is shown in [Han94
Symbolic model checking for probabilistic processes
 IN PROCEEDINGS OF ICALP '97
, 1997
"... We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a stat ..."
Abstract

Cited by 97 (29 self)
 Add to MetaCart
We introduce a symbolic model checking procedure for Probabilistic Computation Tree Logic PCTL over labelled Markov chains as models. Model checking for probabilistic logics typically involves solving linear equation systems in order to ascertain the probability of a given formula holding in a
Model Checking Performability Properties
 DSN 2002, IEEE CS
, 2002
"... Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formallyspecified system. In recent years, we have extended CTL such that it allows for the specification of propertie ..."
Abstract

Cited by 36 (8 self)
 Add to MetaCart
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a formallyspecified system. In recent years, we have extended CTL such that it allows for the specification
Results 1  10
of
744