Pages that link to "Item:Q5047168"
From MaRDI portal
The following pages link to Temporal logics for the specification of performance and reliability (Q5047168):
Displaying 12 items.
- Maximizing entropy over Markov processes (Q465487) (← links)
- The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- A Generalisation of Stationary Distributions, and Probabilistic Program Algebra (Q4917061) (← links)
- Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints (Q5039515) (← links)
- Branching-Time Model-Checking of Probabilistic Pushdown Automata (Q5179051) (← links)
