PROCESSES WITH PROBABILITIES, PRIORITY AND TIME

Simple item page
dc.contributor.authorTofts, Chriseng
dc.date.accessioned2008-05-20T23:31:25Z
dc.date.available2008-05-20T23:31:25Z
dc.date.computerscience1999-05-27eng
dc.date.issued1993-12-01eng
dc.description.abstractA probabilistic calculus, derived from Milner's SCCS, WSCCS is presented. We define a notion of bisimulation for probabilistic processes and show that it is a congruence. A simple equational characterisation is shown to be both sound and complete for finite processes. We present many examples including some extended ones. The larger examples show both the expressive power of WSCCS and the availability of simple proof methods for some complex systems.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1993-531-36eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31343
dc.identifier.urihttp://hdl.handle.net/1880/46554
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titlePROCESSES WITH PROBABILITIES, PRIORITY AND TIMEeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1993-531-36.pdf
Size:
2.91 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications