Name
Abstract | ||
|---|---|---|
Many important performance and reliability measures can be formalized as the accumulated values of weight functions. In this paper, we introduce an extension of linear time logic including past (LTL) with new operators that impose constraints on the accumulated weight along path fragments. The fragments are characterized by regular conditions formalized by deterministic finite automata (monitor DFA). This new logic covers properties expressible by several recently proposed formalisms. We study the model-checking problem for weighted transition systems, Markov chains and Markov decision processes with rational weights. While the general problem is undecidable, we provide algorithms and sharp complexity bounds for several sublogics that arise by restricting the monitoring DFA. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2603088.2603162 | CSL-LICS |
Keywords | Field | DocType |
monitor,finite automata,transition system,model checking,accumulation,weights,ltl,rewards,mdp,temporal logic,theory,markov chain | Discrete mathematics,Combinatorics,Computer science,Deterministic finite automaton,Markov chain,Markov decision process,Algorithm,Decidability,Linear temporal logic,Finite-state machine,Time complexity,Undecidable problem | Conference |
Citations | PageRank | References |
19 | 0.76 | 21 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christel Baier | 1 | 3053 | 185.85 |
| Joachim Klein | 2 | 118 | 9.33 |
| Sascha Klüppelholz | 3 | 287 | 20.48 |
| Sascha Wunderlich | 4 | 43 | 3.43 |