Compositional Branching-Time Measurements

DOI10.1007/978-3-642-54848-2_8zbMath1416.68113OpenAlexW2141884430MaRDI QIDQ5170747

Radu Grosu, Scott D. Stoller, Scott A. Smolka, Junxing Yang, Doron A. Peled, C. R. Ramakrishnan

Publication date: 24 July 2014

Published in: From Programs to Systems. The Systems perspective in Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54848-2_8

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Unnamed Item
• Expressiveness and Closure Properties for Quantitative Languages
• Monitoring Parametric Temporal Logic
• What’s Decidable about Weighted Automata?
• Parametric temporal logic for “model measuring”
• Correct Hardware Design and Verification Methods

This page was built for publication: Compositional Branching-Time Measurements