Bridging the gap between fair simulation and trace inclusion

Yonit Kesten, Nir Piterman, Amir Pnueli

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

15 Scopus citations

Abstract

The paper considers the problem of checking abstraction between two finite-state fair discrete systems. In automata-theoretic terms this is trace inclusion between two Streett automata. We propose to reduce this problem to an algorithm for checking fair simulation between two generalized Büchi automata. For solving this question we present a new triply nested μ-calculus formula which can be implemented by symbolic methods. We then show that every trace inclusion of this type can be solved by fair simulation, provided we augment the concrete system (the contained automaton) by appropriate auxiliary variables. This establishes that fair simulation offers a complete method for checking trace inclusion. We illustrate the feasibility of the approach by algorithmically checking abstraction between finite state systems whose abstraction could only be verified by deductive methods up to now.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsWarren A. Hunt, Fabio Somenzi
PublisherSpringer Verlag
Pages381-393
Number of pages13
ISBN (Print)3540405240, 9783540405245
DOIs
StatePublished - 1 Jan 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2725
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Bridging the gap between fair simulation and trace inclusion'. Together they form a unique fingerprint.

Cite this