A finite union of DFAs in symbolic model checking of infinite systems

Authors:
Suman Roy;Bhaskar Chakraborty
Affiliations:
Honeywell Technology Solutions Lab. (HTSL), Bangalore, India;Indian Statistical Institute, Kolkata, India
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 8
Cited 0

Testing for unboundedness of fifo channels

STACS '91 Selected papers of the 8th annual symposium on Theoretical aspects of computer science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
On Communicating Finite-State Machines

Journal of the ACM (JACM)
Undecidable Verification Problems for Programs with Unreliable Channels

ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
The Power of QDDs (Extended Abstract)

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract)

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Well-abstracted transition systems: application to FIFO automata

Information and Computation
Symbolic Verification of Infinite Systems using a Finite Union of DFAs

SEFM '04 Proceedings of the Software Engineering and Formal Methods, Second International Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address the model-checking problem of viz. communicating finite-state machines (in short, CFSMs) [1,2,6], an infinite system which are modelled as a collection of finite state automata communicating messages through FIFO queues. Several verification methods have been developed for CFSMs. Since all interesting verification problems are undecidable [4], there is in general no completely automatic verification procedure for this class of systems.