Automata-Based CSL Model Checking

DOI10.1007/978-3-642-22012-8_21zbMath1334.68135OpenAlexW2152523762WikidataQ59416328 ScholiaQ59416328MaRDI QIDQ3012926

Flemming Nielson, David N. Jansen, Holger Hermanns, Li-jun Zhang

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Approximation algorithms (68W25) Temporal logic (03B44)

Related Items (3)

Measuring the constrained reachability in quantum Markov chains ⋮ Precisely deciding CSL formulas through approximate model checking for CTMCs ⋮ Multiphase until formulas over Markov reward models: an algebraic approach

Uses Software

• PRISM
• MRMC

Cites Work

• Efficient CSL Model Checking Using Stratification
• Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
• Analysing Biochemical Oscillation through Probabilistic Model Checking
• Model-checking continuous-time Markov chains
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata-Based CSL Model Checking