An automated proof technique for finite-state machine equivalence

Wenbo Mao, George J. Milne

Research output: Chapter in Book/Conference paperConference paper

1 Citation (Scopus)

Abstract

This paper presents a mechanical technique which allows behavioural equivalence proof between (nondeterministic) finite-state machines (FSMs). Given a pair of FSMs which are recursively described in the syntax of a process algebra, a third FSM which represents the concurrent behaviour of the two original FSMs is constructed. An algorithm is engineered for comparing the two FSMs against this third concurrent FSM. A self-evident proof of the equivalence between the FSMs will be produced; if the two FSMs are not equivalent, a sequnce of events will be returned which distinguishes between them.

Original languageEnglish
Title of host publicationComputer Aided Verification - 3rd Intenational Workshop, CAV 1991, Proceedings
EditorsKim G. Larsen, Arne Skou
PublisherSpringer-Verlag Berlin
Pages233-243
Number of pages11
ISBN (Print)9783540551799
DOIs
Publication statusPublished - 1 Jan 1992
Externally publishedYes
Event3rd International Workshop on Computer Aided Verification, CAV 1991 - Aalborg, Denmark
Duration: 1 Jul 19914 Jul 1991

Publication series

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

Conference

Conference3rd International Workshop on Computer Aided Verification, CAV 1991
CountryDenmark
CityAalborg
Period1/07/914/07/91

Fingerprint Dive into the research topics of 'An automated proof technique for finite-state machine equivalence'. Together they form a unique fingerprint.

Cite this