Deterministic Behavioural Models for Concurrency

This paper offers three candidates for a deterministic, noninterleaving, behaviour model which generalizes Hoare traces to the noninterleaving situation. The three models are all proved equivalent in the rather strong sense of being equivalent as categories. The models are: deterministic labelled event structures, generalized trace languages in which the independence relation is context-dependent, and deterministic languages of pomsets.

[1]  P. S. Thiagarajan,et al.  A Trace Semantics for Petri Nets (Extended Abstract) , 1992, ICALP.

[2]  Peter H. Starke,et al.  Traces and semiwords , 1984, Symposium on Computation Theory.

[3]  Glynn Winskel,et al.  A Classification of Models for Concurrency , 1993, CONCUR.

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[6]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[7]  Glynn Winskel,et al.  A Classiication of Models for Concurrency , 2007 .

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

[9]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[10]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[11]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[12]  P. S. Thiagarajan,et al.  A Trace Semantics for Petri Nets , 1995, Inf. Comput..

[13]  Glynn Winskel,et al.  Models for Concurrency , 1994 .