A compositional hierarchical monitoring automaton construction for LTL

Authors:
Deepak D'Souza;Raj Mohan Matteplackel
Affiliations:
Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Year:
2012

Citing 7
Cited 0

Using Z: specification, refinement, and proof

Using Z: specification, refinement, and proof
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Simple on-the-fly automatic verification of linear temporal logic

Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
A compositional approach to CTL* verification

Theoretical Computer Science - Formal methods for components and objects
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Modeling in Event-B: System and Software Engineering

Modeling in Event-B: System and Software Engineering
From MITL to timed automata

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we give a compositional (or inductive) construction of monitoring automata for LTL formulas. Our construction is similar in spirit to the compositional construction of Kesten and Pnueli [5]. We introduce the notion of hierarchical Büchi automata and phrase our constructions in the framework of these automata. We give detailed constructions for all the principal LTL operators including past operators, along with proofs of correctness of the constructions.