Quantitative Model Checking Revisited: Neither Decidable Nor Approximable

DOI10.1007/978-3-540-75454-1_14zbMath1141.68466OpenAlexW1851152565MaRDI QIDQ3510843

Sergio Giro, Pedro R. D'Argenio

Publication date: 3 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75454-1_14

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Model Checking Linear-Time Properties of Probabilistic Systems ⋮ Probabilistic bisimulation for realistic schedulers ⋮ Distributed probabilistic input/output automata: expressiveness, (un)decidability and algorithms ⋮ Information hiding in probabilistic concurrent systems ⋮ Probabilistic Bisimulation for Realistic Schedulers ⋮ On Decision Problems for Probabilistic Büchi Automata

Uses Software

• PRISM
• LiQuor

This page was built for publication: Quantitative Model Checking Revisited: Neither Decidable Nor Approximable