论文信息 - CSP-programs with individual tokens

CSP-programs with individual tokens

We define a subclass of predicate/transition-nets and show how to translate CSP-programs into such nets. We consider a subset of CSP for which Hennessy, Li and Plotkin have given an operational semantics in [HLP]. We show that the firing sequences of our net translation correspond to this operational semantics. Additionally, we also give a non-interleaving semantics to CSP by considering unfoldings and processes of the net translation.

Wolfgang Reisig | Ursula Goltz

[1] W. Li,et al. A First Attempt at Translating CSP into CCS , 1981, ICDCS.

[2] Wolfgang Reisig,et al. Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness , 1984, ICALP.

[3] Wolfgang Reisig,et al. The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[4] Glynn Winskel,et al. Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[5] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[6] Glynn Winskel,et al. A New Definition of Morphism on Petri Nets , 1984, STACS.

[7] Kurt Lautenbach,et al. System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[8] Alan Mycroft,et al. On the Relationship of CCS and Petri Nets , 1984, ICALP.

[9] C. A. R. Hoare,et al. Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[10] Kurt Lautenbach,et al. Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.