From Model Checking to Model Measuring

DOI10.1007/978-3-642-40184-8_20zbMath1390.68428OpenAlexW43626140MaRDI QIDQ2842114

Jan Otop, Thomas A. Henzinger

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://repository.ist.ac.at/175/60/report.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (9)

Edit Distance for Pushdown Automata ⋮ Model measuring for discrete and hybrid systems ⋮ Introduction to Model Checking ⋮ Quantitative safety and liveness ⋮ Optimal repair for omega-regular properties ⋮ Computing branching distances with quantitative games ⋮ A weakness measure for GR(1) formulae ⋮ A weakness measure for GR(1) formulae ⋮ Faster algorithms for quantitative verification in bounded treewidth graphs

This page was built for publication: From Model Checking to Model Measuring