Summary: Verifying Interacting Finite State Machines :
Complexity Issues
Adnan Aziz Vigyan Singhal
Robert K. Brayton ?
Email: fadnan,vigyan,braytong@cs.berkeley.edu
Fax: 1 (510) 643­5052
Department of Electrical Engineering and Computer Sciences
University of California, Berkeley, CA 94720, USA
Abstract. In this report we carry out a computational complexity anal­
ysis of a simple model of concurrency consisting of interacting finite state
machines with fairness constraints (IFSMs). This model is based on spec­
ification languages used for system specification by actual formal verifi­
cation tools, and it allows compact representation of complex systems.
We categorize the complexity of two problems arising in this model that
are of fundamental importance:
Formal verification Given a property (expressed as a formula in the
logic CTL), deciding if it holds of a system of IFSMs is PSPACE­
complete.
Trace universality Given a system of IFSMs, deciding if the set of
output traces generated by the system is universal is EXPSPACE­

Source: Aziz, Adnan - Department of Electrical and Computer Engineering, University of Texas at Austin

Collections: Computer Technologies and Information Sciences