Protocol Validation by Maximal Progress State Exploration
- 1 January 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 32 (1) , 94-97
- https://doi.org/10.1109/tcom.1984.1095950
Abstract
We discuss an efficient variation of state exploration for two communicating finite state machines. In particular, we propose to divide the task of generating all reachable states into two independent subtasks. In each subtask, only the states reachable by forcing maximal progress for one machine are generated. Since the two subtasks are completely independent, and since in most instances the time and storage requirements for each subtask are less than those for the original task, maximal Progress state exploration can save time and/or storage over conventional state exploration.Keywords
This publication has 8 references indexed in Scilit:
- On Communicating Finite-State MachinesJournal of the ACM, 1983
- Maximal progress state explorationPublished by Association for Computing Machinery (ACM) ,1983
- Deadlock Detection for a Class of Communicating Finite State MachinesIEEE Transactions on Communications, 1982
- An improved protocol validation techniqueComputer Networks (1976), 1982
- Towards Analyzing and Synthesizing ProtocolsIEEE Transactions on Communications, 1980
- Finite state description of communication protocolsComputer Networks (1976), 1978
- An Automated Technique of Communications Protocol ValidationIEEE Transactions on Communications, 1978
- Automated Validation of a Communications Protocol: the CCITT X.21 RecommendationIBM Journal of Research and Development, 1978