Infinite behaviour and fairness in concurrent constraint programming
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 348-383
- https://doi.org/10.1007/3-540-56596-5_40
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Concurrency and automata on infinite sequencesPublished by Springer Nature ,2005
- Domain theory in logical form*Annals of Pure and Applied Logic, 1991
- A fully abstract model for concurrent constraint programmingPublished by Springer Nature ,1991
- Semantic DomainsPublished by Elsevier ,1990
- Defining process fairness for non-interleaving concurrencyPublished by Springer Nature ,1990
- Survey of fairness notionsInformation and Software Technology, 1989
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- FairnessPublished by Springer Nature ,1986
- A Compendium of Continuous LatticesPublished by Springer Nature ,1980
- Proving the Correctness of Multiprocess ProgramsIEEE Transactions on Software Engineering, 1977