A complete proof system for SCCS with modal assertions
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 392-410
- https://doi.org/10.1007/3-540-16042-6_22
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Power domains and predicate transformers: A topological viewPublished by Springer Nature ,2005
- A term model for CCSPublished by Springer Nature ,2005
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- A complete modal proof system for a subset of SCCSPublished by Springer Nature ,1985
- A Logic for the Specification and Proof of Controllable Processes of CCSPublished by Springer Nature ,1985
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Testing equivalences for processesPublished by Springer Nature ,1983
- Domains for denotational semanticsPublished by Springer Nature ,1982
- A modal characterisation of observable machine-behaviourLecture Notes in Computer Science, 1981
- On observing nondeterminism and concurrencyLecture Notes in Computer Science, 1980