Temporal logics for the specification of performance and reliability

DOI10.1007/BFb0023457zbMath1498.68155OpenAlexW2130415189MaRDI QIDQ5047168

Luca de Alfaro

Publication date: 9 November 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0023457

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (13)

Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols ⋮ Comparative branching-time semantics for Markov chains ⋮ Operational causality -- necessarily sufficient and sufficiently necessary ⋮ Maximizing entropy over Markov processes ⋮ Fair Termination for Parameterized Probabilistic Concurrent Systems ⋮ Sublogics of a branching time logic of robustness ⋮ A Generalisation of Stationary Distributions, and Probabilistic Program Algebra ⋮ The well-designed logical robot: learning and experience from observations to the Situation Calculus ⋮ Branching-Time Model-Checking of Probabilistic Pushdown Automata ⋮ Model checking mobile stochastic logic ⋮ Computation tree measurement language (CTML) ⋮ Quantitative program logic and expected time bounds in probabilistic distributed algorithms.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for reactivity
• Finite state Markovian decision processes
• Model checking of probabilistic and nondeterministic systems
• Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem

This page was built for publication: Temporal logics for the specification of performance and reliability