A complete modal proof system for a subset of SCCS
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 253-266
- https://doi.org/10.1007/3-540-15198-2_16
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Axiomatising finite delay operatorsActa Informatica, 1984
- Fairness and related properties in transition systems ? a temporal logic to deal with fairnessActa Informatica, 1983
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- A unified approach for studying the properties of transition systemsTheoretical Computer Science, 1982
- A proof technique for communicating sequential processesActa Informatica, 1981
- A Proof System for Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1980
- The ?Hoare logic? of concurrent programsActa Informatica, 1980
- An axiomatic proof technique for parallel programs IActa Informatica, 1976
- A fundamental theorem of asynchronous parallel computationPublished by Springer Nature ,1975