An approach to unfolding asynchronous communication protocols

Authors:
Yu Lei;S. Purushothaman Iyer
Affiliations:
Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX;Department of Computer Science, North Carolina State University, Raleigh, NC
Venue:
FM'05 Proceedings of the 2005 international conference on Formal Methods
Year:
2005

Citing 7
Cited 2

Model checking using net unfoldings

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
A technique of state space search based on unfolding

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
A New Unfolding Approach to LTL Model Checking

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets

TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
An Improvement of McMillan's Unfolding Algorithm

TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
An Unfolding Algorithm for Synchronous Products of Transition Systems

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Deadlock Checking Using Net Unfoldings

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification

Unfolding concurrent well-structured transition systems

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A false history of true concurrency: from Petri to tools

SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an approach to directly unfold asynchronous communication protocols that are modeled as a group of Extended Finite State Machines (EFSMs) communicating through shared message queues. A novel aspect of our approach is that we reduce the redundancy in representing the states of message queues by storing individual messages separately in our unfolding representation. Our approach can also take advantage of the compositional nature of these protocols to minimize the size of a complete finite prefix of their potentially infinite unfoldings. Our empirical results indicate that our approach can produce very compact state space representations.