On identification of input/output extended automata with finite bisimilar quotients

Authors:
Changyan Zhou;Ratnesh Kumar
Affiliations:
Magnatech LLC, East Granby, CT;Department of Electrical and Computer Engineering, Iowa State University, Ames, IA
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 15
Cited 1

Automatic functional test generation using the extended finite state machine model

DAC '93 Proceedings of the 30th international Design Automation Conference
A theory of timed automata

Theoretical Computer Science
Symbolic bisimulations

MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Automatic predicate abstraction of C programs

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Lazy abstraction

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Local Model Checking for Value-Passing Processes (Extended Abstract)

TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Bebop: A Symbolic Model Checker for Boolean Programs

Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Symbolic Transition Graph with Assignment

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Construction of Abstract State Graphs with PVS

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Symbolic Model Checking of Infinite State Systems Using Presburger Arithmetic

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Updatable timed automata

Theoretical Computer Science
A classification of symbolic transition systems

ACM Transactions on Computational Logic (TOCL)

Semantic Translation of Simulink Diagrams to Input/Output Extended Finite Automata

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of finding a finite bisimilar abstraction for a class of reactive untimed infinite-state systems, modeled as input-output extended finite automata (I/O-EFA). We identify a lower bound abstraction (that is coarser than any finite bisimilar abstraction), and present an iterative refinement algorithm whose termination guarantees the existence of a finite bisimilar abstraction. The termination condition is weaker than the one given in [15] for the existence of a finite bisimilar quotient, and thus, the paper identifies a larger class of I/O-EFAs possessing a finite bisimilar abstraction (than that given in [15]).