Equational abstractions

José Meseguer, Miguel Palomino, Narciso Martí-Oliet

Research output: Chapter in Book/Report/Conference proceedingConference contribution


Abstraction reduces the problem of whether an infinite state system satisfies a temporal logic property to model checking that property on a finite state abstract version. The most common abstractions are quotients of the original system. We present a simple method of defining quotient abstractions by means of equations collapsing the set of states. Our method yields the minimal quotient system together with a set of proof obligations that guarantee its executability and can be discharged with tools such as those in the Maude formal environment.

Original languageEnglish (US)
Title of host publicationAutomated Deduction - CADE-19 - 19th International Conference on Automated Deduction, Proceedings
EditorsFranz Baader
Number of pages15
ISBN (Print)3540405593, 9783540405597
StatePublished - 2003
Event19th International Conference on Automated Deduction, CADE 2003 - Miami Beach, United States
Duration: Jul 28 2003Aug 2 2003

Publication series

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


Other19th International Conference on Automated Deduction, CADE 2003
Country/TerritoryUnited States
CityMiami Beach

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this