Temporal logics for the specification of performance and reliability
From MaRDI portal
Recommendations
Cites work
- Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem
- Finite state Markovian decision processes
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- scientific article; zbMATH DE number 177825 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 3240812 (Why is no real title available?)
- Model checking of probabilistic and nondeterministic systems
- Models for reactivity
Cited in
(24)- Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
- Sublogics of a branching time logic of robustness
- Computation tree measurement language (CTML)
- On the complexity of verification of time-sensitive distributed systems
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Comparative branching-time semantics for Markov chains
- Using temporal logics of knowledge for specification and verification -- a case study
- Using Locales to Define a Rely-Guarantee Temporal Logic
- Fair termination for parameterized probabilistic concurrent systems
- Formal Design of Asynchronous Fault Detection and Identification Components using Temporal Epistemic Logic
- A Stepwise Development Process for Reasoning About the Reliability of Real-Time Systems
- Complementary Criteria for Testing Temporal Logic Properties
- scientific article; zbMATH DE number 4089533 (Why is no real title available?)
- Verifying a class of nondeterministic discrete event systems in a generalized temporal logic
- scientific article; zbMATH DE number 644287 (Why is no real title available?)
- Maximizing entropy over Markov processes
- A generalisation of stationary distributions, and probabilistic program algebra
- scientific article; zbMATH DE number 1400096 (Why is no real title available?)
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- Branching-time model-checking of probabilistic pushdown automata
- The well-designed logical robot: learning and experience from observations to the Situation Calculus
- Operational causality -- necessarily sufficient and sufficiently necessary
- A generic logical-temporal performance analysis method for complex systems
- Model checking mobile stochastic logic
This page was built for publication: Temporal logics for the specification of performance and reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047168)