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.
- Temporal logic with recursion (Q2051830) (← links)
- Model checking for entanglement swapping (Q2112108) (← links)
- eBCSgen 2.0: modelling and analysis of regulated rule-based systems (Q2112172) (← links)
- The satisfiability problem for a quantitative fragment of PCTL (Q2140493) (← links)
- Trust evidence logic (Q2146059) (← links)
- Automatic verification of concurrent stochastic systems (Q2147696) (← links)
- Modelling accuracy and trustworthiness of explaining agents (Q2148840) (← links)
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination (Q2182734) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- Multi-scale verification of distributed synchronisation (Q2225471) (← links)
- Towards general axiomatizations for bisimilarity and trace semantics (Q2237336) (← links)
- Automaton-ABC: a statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models (Q2238218) (← links)
- Automatic verification of competitive stochastic systems (Q2248068) (← links)
- Preface to the special issue on probabilistic model checking (Q2248070) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Model checking for probabilistic timed automata (Q2248072) (← links)
- Bayesian statistical model checking with application to Stateflow/Simulink verification (Q2248081) (← links)
- Probabilization of logics: completeness and decidability (Q2254552) (← links)
- Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes (Q2257984) (← links)
- An AGM-style belief revision mechanism for probabilistic spatio-temporal logics (Q2269133) (← links)
- Logical characterization of branching metrics for nondeterministic probabilistic transition systems (Q2272986) (← links)
- Towards light-weight probabilistic model checking (Q2336743) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- Symbolic model checking for probabilistic timed automata (Q2373877) (← links)
- Comparative branching-time semantics for Markov chains (Q2387196) (← links)
- Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes (Q2407982) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- A propositional linear time logic with time flow isomorphic to \(\omega^2\) (Q2447179) (← links)
- Probabilistic verification and approximation (Q2478551) (← links)
- Deciding probabilistic bisimilarity over infinite-state probabilistic systems (Q2482725) (← links)
- Model checking expected time and expected reward formulae with random time bounds (Q2494794) (← links)
- A modular approach to defining and characterising notions of simulation (Q2495641) (← links)
- Statistical probabilistic model checking with a focus on time-bounded properties (Q2509358) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- Quantitative \(\mu\)-calculus and CTL defined over constraint semirings (Q2576952) (← links)
- On the verification of qualitative properties of probabilistic processes under fairness constraints. (Q2583540) (← links)
- A stochastic games framework for verification and control of discrete time stochastic hybrid systems (Q2628473) (← links)
- An efficient algorithm to determine probabilistic bisimulation (Q2633253) (← links)
- Nondeterministic probabilistic Petri net -- a new method to study qualitative and quantitative behaviors of system (Q2637309) (← links)
- Model checking differentially private properties (Q2680992) (← links)
- Refinement Sensitive Formal Semantics of State Machines With Persistent Choice (Q2810972) (← links)
- (Q2842863) (← links)
- Weak Probabilistic Anonymity (Q2864392) (← links)
- Exogenous Probabilistic Computation Tree Logic (Q2870286) (← links)
- Modular Games for Coalgebraic Fixed Point Logics (Q2873663) (← links)
- Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics (Q2919451) (← links)
- A Tutorial on Interactive Markov Chains (Q2937729) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- Computing Behavioral Relations for Probabilistic Concurrent Systems (Q2937734) (← links)
- On Quantitative Modelling and Verification of DNA Walker Circuits Using Stochastic Petri Nets (Q2941140) (← links)
