Robust PCTL model checking

DOI10.1145/2185632.2185673zbMath1361.68140OpenAlexW1987073190WikidataQ57801157 ScholiaQ57801157MaRDI QIDQ2986774

Alessandro D'Innocenzo, Alessandro Abate, Joost-Pieter Katoen

Publication date: 16 May 2017

Published in: Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2185632.2185673

zbMATH Keywords

Markov chainsPCTLapproximate probabilistic bisimulation

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (9)

Compositional abstraction-based synthesis for networks of stochastic switched systems ⋮ Compositional abstraction of large-scale stochastic systems: a relaxed dissipativity approach ⋮ Verification of General Markov Decision Processes by Approximate Similarity Relations and Policy Refinement ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context ⋮ Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations ⋮ A probabilistic calculus of cyber-physical systems ⋮ Compositional abstraction-based synthesis of general MDPs via approximate probabilistic relations ⋮ Automated verification and synthesis of stochastic hybrid systems: a survey

This page was built for publication: Robust PCTL model checking