Show simple item record  

dc.contributor.authorReeves, Steve
dc.contributor.authorStreader, David
dc.date.accessioned2008-10-06T03:56:46Z
dc.date.available2008-10-06T03:56:46Z
dc.date.issued2004-02
dc.identifier.citationReeves, S. & Streader, D. (2004). Unifying state and process determinism. (Working paper 02/2004). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1001
dc.description.abstractIf a coin is given to a deterministic robot that interacts with a deterministic vending machine then is the drink that the robot is delivered determined? Using process definitions of determinism from CSP, CCS or ACP the answer is "no", whereas state-based definitions of determinism can reasonably be construed as giving the answer "yes". In order to unify what we see as discrepancies in state- and action-based notions of determinism we will consider process algebras over two sets of actions: the active or casual actions of the robot and the passive or reactive actions of the vending machine. In addition we will add priority to the actions and when two τ actions are possible then the τ action with the highest priority will be executed.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherUniversity of Waikato, Department of Computer Scienceen_US
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.subjectprocess algebraen_US
dc.subjectdeterminismen_US
dc.subjectabstractionen_US
dc.subjecthiding stateen_US
dc.titleUnifying state and process determinismen_US
dc.typeWorking Paperen_US
uow.relation.series02/2004
pubs.elements-id52762


Files in this item

This item appears in the following Collection(s)

Show simple item record