## Abstract

The paper deals with the proof method of verification by augmented finitary abstraction (VAA), which presents an effective approach to the verification of the temporal properties of (potentially infinite-state) reactive systems. The method consists of a two-step process by which, in a first step, the system and its temporal specification are combined an then abstracted into a finite-state Biichi automaton. The second step uses model checking to establish emptiness of the abstracted automaton. The VAA method can be considered as a viable alternative to verification by temporal deduction which, up to now, has been the main method shown to be complete for the verification of infinite-state systems. The paper presents a general recipe for the abstraction of Buchi automata which is shown to be sound, where soundness means that emptiness of the abstract automaton implies emptiness of the concrete (infinite-state) automaton. To make the method applicable for the verification of liveness properties, pure abstraction is sometimes no longer adequate. We show that by augmenting the system by an appropriate (and standardly constructible) progress monitor, we obtain an augmented system, whose computations are essentially the same as the original system, and which may now be abstracted while preserving the desired liveness properties. We then proceed to show that the VAA method is sound and complete for proving all properties expressible by temporal logic (including both safety and liveness). Completeness establishes that whenever an infinite-state Biichi automaton has no computations, there exists a finitary abstraction which abstracts the automaton, augmented by an appropriate progress monitor, into a finite-state Biichi automaton with no computations.

Original language | English |
---|---|

Title of host publication | Computer Science Logic - 13th International Workshop, CSL 1999 - 8th Annual Conference of the EACSL, Proceedings |

Editors | Jörg Flum, Mario Rodriguez-Artalejo |

Publisher | Springer Verlag |

Pages | 141-156 |

Number of pages | 16 |

ISBN (Print) | 3540665366, 9783540665366 |

DOIs | |

State | Published - 1 Jan 1999 |

Event | 13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999 - Madrid, Spain Duration: 20 Sep 1999 → 25 Sep 1999 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1683 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 13th International Workshop on Computer Science Logic, CSL 1999 and held as International Workshops on Computer Science Logic, EACSL 1999 |
---|---|

Country/Territory | Spain |

City | Madrid |

Period | 20/09/99 → 25/09/99 |

## Keywords

- Abstraction
- Completeness
- Deduction
- Fair discrete systems
- Infinite-systems
- Linear temporal logic
- Liveness properties
- Verification

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science (all)