scientific article; zbMATH DE number 7280017
From MaRDI portal
Publication:5137353
zbMath1448.68285MaRDI QIDQ5137353
Marta Kwiatkowska, Christel Baier
Publication date: 2 December 2020
Full work available at URL: https://link.springer.com/article/10.1007/s004460050046
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
Symbolic model checking for probabilistic timed automata ⋮ The satisfiability problem for a quantitative fragment of PCTL ⋮ Model Checking Probabilistic Systems ⋮ Comparative branching-time semantics for Markov chains ⋮ Experiments with deterministic \(\omega\)-automata for formulas of linear temporal logic ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ Compositional probabilistic verification through multi-objective model checking ⋮ On-the-Fly Stuttering in the Construction of Deterministic ω-Automata ⋮ On the use of MTBDDs for performability analysis and verification of stochastic systems. ⋮ Reachability in recursive Markov decision processes ⋮ Task-structured probabilistic I/O automata ⋮ Preface to the special issue on probabilistic model checking ⋮ Model checking for probabilistic timed automata ⋮ The satisfiability problem for a quantitative fragment of PCTL ⋮ Branching bisimulation congruence for probabilistic systems ⋮ Quantitative Analysis under Fairness Constraints ⋮ Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes ⋮ Weak Probabilistic Anonymity ⋮ Exogenous Probabilistic Computation Tree Logic ⋮ Automatic verification of real-time systems with discrete probability distributions.
