Pages that link to "Item:Q1343864"
From MaRDI portal
The following pages link to A logic for reasoning about time and reliability (Q1343864):
Displaying 50 items.
- Belief and truth in hypothesised behaviours (Q274416) (← links)
- Model checking quantum Markov chains (Q394340) (← links)
- Branching-time model-checking of probabilistic pushdown automata (Q394999) (← links)
- Consistency and refinement for interval Markov chains (Q444461) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- Model checking fuzzy computation tree logic (Q529056) (← links)
- Quantitative Kleene coalgebras (Q532394) (← links)
- The well-designed logical robot: learning and experience from observations to the Situation Calculus (Q543604) (← links)
- Constraint Markov chains (Q554215) (← links)
- Probabilistic contracts: a compositional reasoning methodology for the design of systems with stochastic and/or non-deterministic aspects (Q633299) (← links)
- Maximal traces and path-based coalgebraic temporal logics (Q639645) (← links)
- Coalgebraic semantics of modal logics: an overview (Q639647) (← links)
- Generating counterexamples for quantitative safety specifications in probabilistic B (Q652160) (← links)
- Where logic and agents meet (Q657584) (← links)
- CEGAR for compositional analysis of qualitative properties in Markov decision processes (Q746785) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Probabilistic model checking of biological systems with uncertain kinetic rates (Q764350) (← links)
- Raiders of the lost equivalence: probabilistic branching bisimilarity (Q783681) (← links)
- A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces (Q831141) (← links)
- Not all bugs are created equal, but robust reachability can tell the difference (Q832220) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- Means-end relations and a measure of efficacy (Q853789) (← links)
- Formal analysis of PIN block attacks (Q860910) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Minimal probabilistic P systems for modelling ecological systems (Q896706) (← links)
- Minimization of probabilistic models of programs (Q906254) (← links)
- Reachability in recursive Markov decision processes (Q924718) (← links)
- Performability assessment by model checking of Markov reward models (Q968359) (← links)
- Model checking mobile stochastic logic (Q995465) (← links)
- Probabilistic mobile ambients (Q1006650) (← links)
- A note on the attractor-property of infinite-state Markov chains (Q1045897) (← links)
- Approximating labelled Markov processes (Q1398379) (← links)
- Model-checking large structured Markov chains. (Q1400291) (← links)
- Algebraic theory of probabilistic processes. (Q1400293) (← links)
- Testing preorders for probabilistic processes can be characterized by simulations (Q1603706) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms. (Q1603711) (← links)
- SOS specifications for uniformly continuous operators (Q1678172) (← links)
- Verification and control of partially observable probabilistic systems (Q1699230) (← links)
- Markov chains and Markov decision processes in Isabelle/HOL (Q1701041) (← links)
- Symbolic checking of fuzzy CTL on fuzzy program graph (Q1713411) (← links)
- Sublogics of a branching time logic of robustness (Q1740655) (← links)
- Computation tree measurement language (CTML) (Q1798671) (← links)
- On probabilistic timed automata. (Q1853732) (← links)
- Twenty years of rewriting logic (Q1931904) (← links)
- Probabilistic verification of Herman's self-stabilisation algorithm (Q1941879) (← links)
- Deciding bisimilarity and similarity for probabilistic processes. (Q1975973) (← links)
- Quantitative verification of Kalman filters (Q1982642) (← links)
- Probabilistic divide \& congruence: branching bisimilarity (Q2007735) (← links)
