True versus artificial concurrency

Some theoretical issues related to concurrent processed are discussed: formal description of concurrent systems, concurrent systems synchronization, refinement of systems, fairness assumption. These issues are considered on possibly high level of abstraction enabling their proper identification, formulation, and formalization. So-called prefix functions serve as a model of concurrent processes. The notion of prefix functions is a unifying concept for description purposes of a number of existing representations of concurrent processes based on finite set of atomic actions.

[1]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[2]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[3]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[4]  P. S. Thiagarajan,et al.  Elementary Net Systems , 1986, Advances in Petri Nets.

[5]  M. W. Shields.  Non-Sequential Behaviour , 1984, Symposium on Programming.

[6]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[7]  Wojciech Penczek,et al.  Concurrent Systems and Inevitability , 1989, Theor. Comput. Sci..

[8]  Grzegorz Rozenberg.  Behaviour of Elementary Net Systems , 1986 .

[9]  Volker Diekert,et al.  The Book of Traces , 1995 .

[10]  Antoni W. Mazurkiewicz.  Semantics of concurrent systems: a modular fixed-point trace approach , 1984, European Workshop on Applications and Theory in Petri Nets.

[11]  Martín Abadi,et al.  Composing Specifications , 1989, REX Workshop.

[12]  César Fernández.  Non-sequential Processes , 1986, Advances in Petri Nets.