Predicate Diagrams for the Verification of Real-Time Systems

We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed automata and constructs for modeling data, possibly over infinite domains. Predicate diagrams are succinct and intuitive representations of Boolean ions. They also represent an interface between deductive tools used to h the correctness of an abstraction, and model checking tools that can verify behavioral properties of finite-state models. The contribution of this paper is to extend the format of predicate diagrams to timed systems. We also establish a set of verification conditions that are sufficient to prove that a given predicate diagram rect abstraction of an extended timed graph. The formalism is supported by a toolkit, and we demonstrate its use at the hand of Fischer's real-time mutualexclusion protocol. s: Real-time systems, verification, abstraction, XTG, predicate diagrams, theorem proving, mod...

• Type: Journal
• Year: 2006
• Where: ENTCS
• Authors: Eun-Young Kang, Stephan Merz
• Keywords: Diagrams, ENTCS 2006, Extended Timed Graph, Real-time Systems