Search

• < Previous
• 1
• Next >

---

Refinement and Difference for Probabilistic Automata

Benoît Delahaye ; Uli Fahrenberg ; Kim G. Larsen ; Axel Legay.

This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between two specifications, the target of this operator is to produce a specification APA that represents all witness PAs of&nbsp;[&hellip;]

---

Qualitative Logics and Equivalences for Probabilistic Systems

Krishnendu Chatterjee ; Luca de Alfaro ; Marco Faella ; Axel Legay.

We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized CTL (QRCTL): formulas of this logic can express the fact that certain temporal properties hold over all paths, or with probability 0 or 1, but&nbsp;[&hellip;]

---

An $\omega$-Algebra for Real-Time Energy Problems

David Cachera ; Uli Fahrenberg ; Axel Legay.

We develop a $^*$-continuous Kleene $\omega$-algebra of real-time energy functions. Together with corresponding automata, these can be used to model systems which can consume and regain energy (or other types of resources) depending on available time. Using recent results on $^*$-continuous Kleene&nbsp;[&hellip;]

---

Sequential Relational Decomposition

Dror Fried ; Axel Legay ; Joël Ouaknine ; Moshe Y. Vardi.

The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple and natural formalization of sequential decomposition, in&nbsp;[&hellip;]

---