Testing equivalences and fully abstract models for probabilistic processes
- 16 June 2005
- book chapter
- Published by Springer Nature
- p. 126-138
- https://doi.org/10.1007/bfb0039056
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Linear and branching structures in the semantics and logics of reactive systemsPublished by Springer Nature ,2005
- Reactive, generative, and stratified models of probabilistic processesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bisimulation through probabilistic testing (preliminary report)Published by Association for Computing Machinery (ACM) ,1989
- A fully abstract trace model for dataflow networksPublished by Association for Computing Machinery (ACM) ,1989
- Refusal testingTheoretical Computer Science, 1987
- Observation equivalence as a testing equivalenceTheoretical Computer Science, 1987
- Notes on Communicating Sequential SystemsPublished by Springer Nature ,1986
- Testing equivalences for processesTheoretical Computer Science, 1984
- Process algebra for synchronous communicationInformation and Control, 1984
- Full abstraction for a simple parallel programming languagePublished by Springer Nature ,1979