Using compositional preorders in the verification of sliding window protocol
- 1 January 1997
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The weakest compositional semantic equivalence preserving nexttime-less linear temporal logicPublished by Springer Nature ,2006
- Putting advanced reachability analysis techniques together: The “ARA” toolPublished by Springer Nature ,2005
- Compositional model checkingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Compositional minimisation of finite state systems using interface specificationsFormal Aspects of Computing, 1996
- Compositional failure-based semantic models for Basic LOTOSFormal Aspects of Computing, 1995
- The Temporal Logic of Reactive and Concurrent SystemsPublished by Springer Nature ,1992
- Using truth-preserving reductions to improve the clarity of kripke-modelsPublished by Springer Nature ,1991
- Action versus state based logics for transition systemsPublished by Springer Nature ,1990
- An algorithmic technique for protocol verificationIEEE Transactions on Communications, 1988
- Expressing interesting properties of programs in propositional temporal logicPublished by Association for Computing Machinery (ACM) ,1986