61 research outputs found
CoInDiVinE: Parallel Distributed Model Checker for Component-Based Systems
CoInDiVinE is a tool for parallel distributed model checking of interactions
among components in hierarchical component-based systems. The tool extends the
DiVinE framework with a new input language (component-interaction automata) and
a property specification logic (CI-LTL). As the language differs from the input
language of DiVinE, our tool employs a new state space generation algorithm
that also supports partial order reduction. Experiments indicate that the tool
has good scaling properties when run in parallel setting.Comment: In Proceedings PDMC 2011, arXiv:1111.006
Local Distributed Model Checking of Reg CTL
AbstractThe paper is devoted to the problem of extending the temporal logic CTL so that it is more expressive and complicated properties can be expressed more succinctly. The specification language Reg CTL, an extension of CTL, is proposed. In Reg CTL every CTL temporal operator is augmented with a regular expression restricting thus moments when the validity is required. The resulting logic is more expressive than previous extensions of CTL with regular expressions. Reg CTL can be model-checked on-the-fly and the model checking algorithm is well distributable
Model Checking of RegCTL
The paper is devoted to the problem of extending the temporal logic CTL so that it is more expressive and complicated properties can be expressed in a more readable form. The specification language RegCTL, an extension of CTL, is proposed. In RegCTL every CTL temporal operator is augmented with a regular expression, thus restricting moments when the validity is required. We propose a local distributed model checking algorithm for RegCTL
Verification of Systems with Degradation
We focus on systems that naturally incorporate a degrading quality, such as electronic devices with degrading electric charge or broadcasting networks with decreasing power or quality of a transmitted signal. For such systems, we introduce an extension of linear temporal logic (Linear Temporal Logic with Degradation Constraints, or DLTL for short) that provides a user-friendly formalism for specifying properties involving quantitative requirements on the level of degradation. We investigate the possibility of translating DLTL verification problem for systems with degradation into previously solved MITL verification problem for timed automata, and we show that through the translation, DLTL model checking problem can be solved with limited, yet arbitrary, precision. For a specific subclass of DLTL formulas, we present a full precision verification technique based on translation of DLTL formulas into a specification formalism called Buchi Automata with Degradation Constraints (BADCs) developed earlier
Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints
In this paper, we develop a provably correct optimal control strategy for a
finite deterministic transition system. By assuming that penalties with known
probabilities of occurrence and dynamics can be sensed locally at the states of
the system, we derive a receding horizon strategy that minimizes the expected
average cumulative penalty incurred between two consecutive satisfactions of a
desired property. At the same time, we guarantee the satisfaction of
correctness specifications expressed as Linear Temporal Logic formulas. We
illustrate the approach with a persistent surveillance robotics application.Comment: Technical report accompanying the ACC 2013 pape
Modal Transition Systems: Composition and LTL Model Checking
Modal transition systems (MTS) is a~well established formalism used for specification and for abstract interpretation. We consider its disjunctive extension (DMTS) and we provide algorithms showing that refinement problems for DMTS are not harder than in the case of MTS. There are two main results in the paper. Firstly, we identify an error in a~previous attempt at LTL model checking of MTS and provide algorithms for LTL model checking of MTS and DMTS. Moreover, we show how to apply this result to compositional verification and circumvent the general incompleteness of the MTS composition. Secondly, we give a~solution to the common implementation and conjunctive composition problems lowering the complexity from EXPTIME to PTIME
An Efficient Normalisation Procedure for Linear Temporal Logic and Very Weak Alternating Automata
In the mid 80s, Lichtenstein, Pnueli, and Zuck proved a classical theorem
stating that every formula of Past LTL (the extension of LTL with past
operators) is equivalent to a formula of the form , where
and contain only past operators. Some years later, Chang,
Manna, and Pnueli built on this result to derive a similar normal form for LTL.
Both normalisation procedures have a non-elementary worst-case blow-up, and
follow an involved path from formulas to counter-free automata to star-free
regular expressions and back to formulas. We improve on both points. We present
a direct and purely syntactic normalisation procedure for LTL yielding a normal
form, comparable to the one by Chang, Manna, and Pnueli, that has only a single
exponential blow-up. As an application, we derive a simple algorithm to
translate LTL into deterministic Rabin automata. The algorithm normalises the
formula, translates it into a special very weak alternating automaton, and
applies a simple determinisation procedure, valid only for these special
automata.Comment: This is the extended version of the referenced conference paper and
contains an appendix with additional materia
- …