Bibtex Record:
@workingpaper{
Author = {Reeves, S.V. and Streader, D.},
Title = {Unifying state and process determinism},
Publisher = {Department of Computer Science, The University of Waikato},
Number = {02/2004},
Pages = {1-10},
Month = {February},
Abstract = {If 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 t actions are possible then the t action with the highest priority will be executed.},
Keywords = {Process algebra, determinism, abstraction, hiding state},
Year = {2004}
}