Compositional failure-based semantic models for Basic LOTOS
- 1 July 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 7 (4) , 440-468
- https://doi.org/10.1007/bf01211218
Abstract
A systematic analysis of trace- and failure-based compositional semantic models for Basic LOTOS is presented. The analysis is motivated by the fact that the weakest known equivalences preserving sufficient information for several typical verification tasks are failure-based, and the weakness of an equivalence can be advantageous for verification. Both the equivalences and the preorders corresponding to the semantic models are covered. The analysis yields in a natural way two compositional semantic models, which are particularly suited for the verification of a general class of liveness properties, a task which cannot be performed with most established models.Keywords
This publication has 20 references indexed in Scilit:
- Introduction to the ISO specification language LOTOSPublished by Elsevier ,2003
- Enhancing compositional reachability analysis with context constraintsACM SIGSOFT Software Engineering Notes, 1993
- Using truth-preserving reductions to improve the clarity of kripke-modelsPublished by Springer Nature ,1991
- CCS expressions, finite state processes, and three problems of equivalenceInformation and Computation, 1990
- An algorithmic procedure for checking safety properties of protocolsIEEE Transactions on Communications, 1989
- Specification-oriented semantics for Communicating ProcessesActa Informatica, 1986
- Notes on Communicating Sequential SystemsPublished by Springer Nature ,1986
- An improved failures model for communicating processesPublished by Springer Nature ,1985
- A Theory of Communicating Sequential ProcessesJournal of the ACM, 1984
- Testing equivalences for processesTheoretical Computer Science, 1984