On the Merits of Temporal Testers

DOI10.1007/978-3-540-69850-0_11zbMath1143.68046OpenAlexW1487629853MaRDI QIDQ3512440

No author found.

Publication date: 15 July 2008

Published in: 25 Years of Model Checking (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69850-0_11

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (11)

Learning infinite-word automata with loop-index queries ⋮ From LTL to deterministic automata. A safraless compositional approach ⋮ Effective Synthesis of Asynchronous Systems from GR(1) Specifications ⋮ Temporal Logic and Fair Discrete Systems ⋮ Automata Theory and Model Checking ⋮ Multi-Valued Reasoning about Reactive Systems ⋮ Quantitative monitoring of STL with edit distance ⋮ Bridging the gap between single- and multi-model predictive runtime verification ⋮ Synthesis of Reactive(1) designs ⋮ Organising LTL monitors over distributed systems with a global clock ⋮ The compound interest in relaxing punctuality

This page was built for publication: On the Merits of Temporal Testers