Topology, monitorable properties and runtime verification

DOI10.1016/j.tcs.2014.02.052zbMath1359.68164OpenAlexW2036862954MaRDI QIDQ2453532

Volker Diekert, Martin Leucker

Publication date: 10 June 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.02.052

zbMATH Keywords

topologyruntime verificationomega-regular languagemonitorable property

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

On monitoring linear temporal properties

Cites Work

• Fragments of first-order logic over infinite words
• Pure future local temporal logics are expressively complete for Mazurkiewicz traces
• Monitoring the Full Range of ω-Regular Properties of Stochastic Systems
• Monitoring of Real-Time Properties
• Decision problems forω-automata
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Topology, monitorable properties and runtime verification