From model checking to model measuring

DOI10.1007/978-3-642-40184-8_20MaRDI QIDQ2842114zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Model measuring for discrete and hybrid systems
• Model measuring for hybrid systems
• scientific article; zbMATH DE number 1405643
• Simulation distances
• Parametric temporal logic for “model measuring”

Cited in

(17)

• Formal model of internal measurement: Alternate changing between recursive definition and domain equation
• Faster algorithms for quantitative verification in bounded treewidth graphs
• Computing branching distances with quantitative games
• Model measuring for discrete and hybrid systems
• Moving Arrows and Four Model Checking Results
• Model measuring for hybrid systems
• Introduction to model checking
• Edit distance for pushdown automata
• Compositional branching-time measurements
• A weakness measure for GR(1) formulae
• A weakness measure for GR(1) formulae
• Quantitative safety and liveness
• Optimal repair for omega-regular properties
• Deterministic weighted automata under partial observability
• On Skolem-hardness and saturation points in Markov decision processes
• Safety and liveness of quantitative properties and automata
• Quantitative language automata

This page was built for publication: From model checking to model measuring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2842114)