Predicate diagrams for the verification of real-time systems

EY Kang, S Merz

Research output: Contribution to journalArticleScientificpeer-review


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 abstractions. They also represent an interface between deductive tools used to establish 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 is a correct 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 mutual-exclusion protocol. Keywords: Real-time systems; verification; abstraction; XTG; predicate diagrams; theorem proving; model checking
Original languageUndefined/Unknown
Pages (from-to)151-165
Number of pages15
JournalElectronic Notes in Theoretical Computer Science
Publication statusPublished - 2006

Bibliographical note

issn: 1571-0661


  • academic journal papers
  • Peer-lijst tijdschrift

Cite this