TY  - JOUR
KW  - Semirings; Temporal logics; QoS; Quantitative model checking
TI  - Quantitative mu-calculus and CTL defined over constraint semirings
AV  - none
UR  - http://www.sciencedirect.com/science/article/B6V1G-4GYNXCW-3/2/90a4cc199a66d4142adec5d04df249d2
SN  - 0304-3975
N2  - Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean temporal properties, it does not allow to reason about quantitative aspects of systems. Some quantitative extensions of temporal logics has been already proposed, especially in the context of probabilistic systems. They allow to answer questions like with which probability does a system satisfy a property?
We present a generalization of two well-known temporal logics: CTL and the [mu]-calculus. Both extensions are defined over c-semirings, an algebraic structure that captures quantitative aspects like quality of service or soft constraints. Basically, a c-semiring consists of a domain, an additive operation and a multiplicative operation, which satisfy some properties. We present the semantics of the extended logics over transition systems, where a formula is interpreted as a mapping from the set of states to the domain of the c-semiring, and show that the usual connection between CTL and [mu]-calculus does not hold in general. In addition, we reason about the complexity of computing the logics and illustrate some applications of our framework, including boolean model checking.
N1  - Quantitative Aspects of Programming Languages 2004
ID  - eprints166
EP  - 160
Y1  - 2005///
IS  - 1
JF  - Theoretical Computer Science
PB  - Elsevier
A1  - Lluch-Lafuente, Alberto
A1  - Montanari, Ugo
SP  - 135
VL  - 346
ER  -