On-the-fly analysis of systems with unbounded, lossy FIFO channels
1998 (English)In: Computer Aided Verification: Proceedings of 10th International Conference, CAV'98 / [ed] Alan J. Hu, Moshe Y. Vardi, 1998, Vol. 1427, 305-318 p.Conference paper (Refereed)
We consider symbolic on-the-fly verification methods for systems of finite-state machines that communicate by exchanging messages via unbounded and lossy FIFO queues. We propose a novel representation formalism, called simple regular expressions (SREs), for representing sets of states of protocols with lossy FIFO channels. We show that the class of languages representable by SREs is exactly the class of downward closed languages that arise in the analysis of such protocols. We give methods for (i) computing inclusion between SREs, (ii) an SRE representing the set of states reachable by executing a single transition in a system, and (iii) an SRE representing the set of states reachable by an arbitrary number of executions of a control loop of a program. All these operations are rather simple and can be carried out in polynomial time. With these techniques, one can construct a semi-algorithm which explores the set of reachable states of a protocol, in order to check various safety properties.
Place, publisher, year, edition, pages
1998. Vol. 1427, 305-318 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 1427
finite state machines, unreliable channels, programs
Engineering and Technology
IdentifiersURN: urn:nbn:se:uu:diva-27321DOI: 10.1007/BFb0028754ISBN: 978-3-540-64608-2ISBN: 978-3-540-69339-0OAI: oai:DiVA.org:uu-27321DiVA: diva2:55216
10th International Conference, CAV'98 Vancouver, BC, Canada, June 28 – July 2, 1998