5 research outputs found
Model Checking Markov Chains with Actions and State Labels
In the past, logics of several kinds have been proposed for reasoning about discrete- or continuous-time Markov chains. Most of these logics rely on either state labels (atomic propositions) or on transition labels (actions). However, in several applications it is useful to reason about both state-properties and action-sequences. For this purpose, we introduce the logic asCSL which provides powerful means to characterize execution paths of Markov chains with actions and state labels. asCSL can be regarded as an extension of the purely state-based logic asCSL (continuous stochastic logic). \ud
In asCSL, path properties are characterized by regular expressions over actions and state-formulas. Thus, the truth value of path-formulas does not only depend on the available actions in a given time interval, but also on the validity of certain state formulas in intermediate states.\ud
We compare the expressive power of CSL and asCSL and show that even the state-based fragment of asCSL is strictly more expressive than CSL if time intervals starting at zero are employed. Using an automaton-based technique, an asCSL formula and a Markov chain with actions and state labels are combined into a product Markov chain. For time intervals starting at zero we establish a reduction of the model checking problem for asCSL to CSL model checking on this product Markov chain. The usefulness of our approach is illustrated by through an elaborate model of a scalable cellular communication system for which several properties are formalized by means of asCSL-formulas, and checked using the new procedure
A Complete Axiom System for Propositional Interval Temporal Logic with Infinite Time
Interval Temporal Logic (ITL) is an established temporal formalism for
reasoning about time periods. For over 25 years, it has been applied in a
number of ways and several ITL variants, axiom systems and tools have been
investigated. We solve the longstanding open problem of finding a complete
axiom system for basic quantifier-free propositional ITL (PITL) with infinite
time for analysing nonterminating computational systems. Our completeness proof
uses a reduction to completeness for PITL with finite time and conventional
propositional linear-time temporal logic. Unlike completeness proofs of equally
expressive logics with nonelementary computational complexity, our semantic
approach does not use tableaux, subformula closures or explicit deductions
involving encodings of omega automata and nontrivial techniques for
complementing them. We believe that our result also provides evidence of the
naturalness of interval-based reasoning
Recommended from our members
A Methodology for Specification-Based Performance Analysis of Protocols
The designer of communication protocols has to formulate rules to govern the communications between processes that are distributed; share common resources concurrently and asynchronously; communicate through unreliable channels that incur random delays; and behave in a time-dependent fashion. The first step is to formally specify the behavior of each of the communicating processes in the protocol. The protocol designer then has to analyze their concurrent behavior to ensure that it satisfies given functional requirements. He also has to analyze their timing behavior to ensure that is meets given timing requirements. The author addresses the specification and analysis of timing requirements and performance measures of protocols