On-the-fly verification of finite transition systems
- 1 October 1992
- journal article
- research article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 1 (2-3) , 251-273
- https://doi.org/10.1007/bf00121127
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Testing for unboundedness of Fifo channelsPublished by Springer Nature ,2005
- A partial approach to model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bounded-memory algorithms for verification on-the-flyLecture Notes in Computer Science, 1992
- “On the fly” verification of behavioural equivalences and preordersPublished by Springer Nature ,1992
- Memory efficient algorithms for the verification of temporal propertiesPublished by American Mathematical Society (AMS) ,1991
- An implementation of an efficient algorithm for bisimulation equivalenceScience of Computer Programming, 1990
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- Development of Veda, a prototyping tool for distributed algorithmsIEEE Transactions on Software Engineering, 1988
- An introduction to FIFO nets— monogeneous nets: A subclass of FIFO netsTheoretical Computer Science, 1985
- Tracing ProtocolsAT&T Technical Journal, 1985