Results 1  10
of
705,912
Modelchecking algorithms for continuoustime Markov chains
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2003
"... Continuoustime Markov chains (CTMCs) have been widely used to determine system performance and dependability characteristics. Their analysis most often concerns the computation of steadystate and transientstate probabilities. This paper introduces a branching temporal logic for expressing realt ..."
Abstract

Cited by 231 (45 self)
 Add to MetaCart
time probabilistic properties on CTMCs and presents approximate model checking algorithms for this logic. The logic, an extension of the continuous stochastic logic CSL of Aziz et al., contains a timebounded until operator to express probabilistic timing properties over paths as well as an operator to express
Algebraic implementation of model checking algorithms
 In Third AMAST Workshop on RealTime Systems, Proceedings
, 1996
"... We describe an algebraic methodology for implementing model checking algorithms. In this methodology temporal logic formulas are seen as phrases of a source language Ls and the sets of states of a as elements of an algebra of sets called the target language, Lt. Thus, the model checker becomes an a ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We describe an algebraic methodology for implementing model checking algorithms. In this methodology temporal logic formulas are seen as phrases of a source language Ls and the sets of states of a as elements of an algebra of sets called the target language, Lt. Thus, the model checker becomes
Model Checking Algorithms for Analog Verification
, 2002
"... In this contribution we present the first method for model checking on nonlinear analog systems. Based on digital CTL model checking algorithms and results in hybrid model checking, we have developed a concept to adapt these ideas to analog systems. Using an automatic state space subdivision method ..."
Abstract

Cited by 20 (4 self)
 Add to MetaCart
In this contribution we present the first method for model checking on nonlinear analog systems. Based on digital CTL model checking algorithms and results in hybrid model checking, we have developed a concept to adapt these ideas to analog systems. Using an automatic state space subdivision method
Model Checking Algorithms for the µCalculus
"... this paper will work with any of them. For the sake of concreteness, we will use the propositional ¯calculus of Kozen [12]. Closed formulas in this logic evaluate to sets of states. A considerable amount of research has focused on finding techniques for evaluating such formulas efficiently, and man ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
, and many algorithms have been proposed for this purpose. These algorithms generally fall into two categories, local and global. Local procedures are designed for proving that a specific state of the transition system satisfies the given formula. Because of this, it is not always necessary to examine all
Symbolic Model Checking Algorithms for TemporalEpistemic Logic
"... Abstract. The paper presents ordered binary decision diagram based symbolic model checking algorithms for fragments of a temporalepistemic logic based on the temporal logic CTL ∗ with operators for the knowledge and common knowledge of multiple agents. The knowledge operators are interpreted with ..."
Abstract
 Add to MetaCart
Abstract. The paper presents ordered binary decision diagram based symbolic model checking algorithms for fragments of a temporalepistemic logic based on the temporal logic CTL ∗ with operators for the knowledge and common knowledge of multiple agents. The knowledge operators are interpreted
A Model Checking Algorithm for Stochastic Systems
, 2000
"... this report we present an algorithm for modelchecking stochastic automata with respect to a probabilistic temporal logic. We consider the stochastic automata presented in [D'A99]. In particular, the algorithm is novel in that it allows any (continuous) probability density functions to be used ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
this report we present an algorithm for modelchecking stochastic automata with respect to a probabilistic temporal logic. We consider the stochastic automata presented in [D'A99]. In particular, the algorithm is novel in that it allows any (continuous) probability density functions to be used
A Model Checking Algorithm for Temporal Logics of Knowledge in MultiAgent Systems
"... Wu LJ, Su KL. A model checking algorithm for temporal logics of knowledge in multiAgent systems. ..."
Abstract
 Add to MetaCart
Wu LJ, Su KL. A model checking algorithm for temporal logics of knowledge in multiAgent systems.
Integrating Temporal Logics and Model Checking Algorithms
 In Fourth AMAST Workshop on RealTime Systems, Proceedings, May 21
, 1997
"... . Temporal logic and model checking algorithms are often used for checking system properties in various environments. The diversity of systems and environments implies a diversity of logics and algorithms. But there are no tools to aid the logician or practitioner in the experimentation with differe ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
. Temporal logic and model checking algorithms are often used for checking system properties in various environments. The diversity of systems and environments implies a diversity of logics and algorithms. But there are no tools to aid the logician or practitioner in the experimentation
TREE LOGIC WITH RECURSION AND MODEL CHECKING ALGORITHM
"... Semistructured data plays an increasingly important role in the exchange of information between globally distributed applications, which invokes renewed interests in typed programming languages that can manipulate treelike data structures. Tree logic, inherited from ambient logic, is introduced a ..."
Abstract
 Add to MetaCart
logic is given. We also develop a model checking algorithm for the logic without. operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semistructured data processing language and more flexible type system.
Results 1  10
of
705,912