Model checking discounted temporal properties
نویسندگان
چکیده
منابع مشابه
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, temporal logic is therefore fragile: even small changes in the model can lead to opposite truth values for a specification. We present a generalization of the branching-time logic Ctl which achieves robustness with respect t...
متن کامل\Direct" Model Checking of Temporal Properties
In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on in nite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property aut...
متن کاملTAGED Approximations for Temporal Properties Model-Checking
This paper investigates the use of tree automata with global equalities and disequalities (TAGED for short) in reachability analysis over term rewriting systems (TRSs). The reachability problem being in general undecidable on non terminating TRSs, we provide TAGEDbased construction, and then design approximation-based semi-decision procedures to model-check useful temporal patterns on in nite s...
متن کاملRelating Hierarchy of Linear Temporal Properties to Model Checking Relating Hierarchy of Linear Temporal Properties to Model Checking
The hierarchy of properties as overviewed by Manna and Pnueli 23] relates language, topology, !-automata, and linear temporal logic classiications of properties. We provide new characterisations of this hierarchy in terms of automata with B uchi, coB uchi, and Streett acceptance condition and in terms of LTL i and LTL i hierarchies. Afterwards, we analyse the complexity of the model checking pr...
متن کاملRelating Hierarchy of Temporal Properties to Model Checking
The hierarchy of properties as overviewed by Manna and Pnueli [18] relates language, topology, $ -automata, and linear temporal logic classifications of properties. We provide new characterisations of this hierarchy in terms of automata with Büchi, co-Büchi, and Streett acceptance condition and in terms of %'&)()& * and +,& (-& * hierarchies. Afterwards, we analyse the complexity of the model c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.07.033