Domain Equations for Probabilistic Processes (Extended Abstract)
Open Access
- 1 January 1997
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 7, 34-54
- https://doi.org/10.1016/s1571-0661(05)80465-7
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Trees and semanticsTheoretical Computer Science, 1997
- The complexity of probabilistic verificationJournal of the ACM, 1995
- Denotational semantics in the cpo and metric approachTheoretical Computer Science, 1994
- Processes with probabilities, priority and timeFormal Aspects of Computing, 1994
- Solving reflexive domain equations in a category of complete metric spacesJournal of Computer and System Sciences, 1989
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spacesInformation Processing Letters, 1989
- On the uniqueness of fixed points of endofunctors in a category of complete metric spacesInformation Processing Letters, 1988
- Synchronization treesTheoretical Computer Science, 1984
- Calculi for synchrony and asynchronyTheoretical Computer Science, 1983
- Processes and the denotational semantics of concurrencyInformation and Control, 1982