Denotational, causal, and operational determinism in event structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1059, Issue , 1996, Pages 272-286

  Rensink, Arend ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

Behavioural models; Concurrent languages; Determinism; Event structures; Partial order models; Trees

Indexed keywords

ALGEBRA;

BEHAVIOURAL MODEL; CONCURRENT LANGUAGES; DETERMINISM; EVENT STRUCTURES; PARTIAL ORDER; TREES;

FORESTRY;

EID: 84947918689     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61064-2_43     Document Type: Conference Paper

References (14)

1. P. Darondeau and P. Degano. Causal trees = interleaving + causality. In Guessarian, ed., Semantics of Systems of Concurrent Processes, vol. 469 of LNCS, pp. 239-255. Springer, 1990.
2. J. Engelfriet. Branching processes of Petri nets. Acta Inf., 28:575-591, 1991.
3. J. Meseguer, U. Montanari, and V. Sassone. On the semantics of Petri nets. In W. R. Cleaveland, ed., Concur '92, vol. 630 of LNCS, pp. 286-301. Springer, 1992.
4. M. Nielsen, G. D. Plotkin, and G. Winskel. Petri nets, event structures and domains, part 1. Theoretical Comput. Sci., 13:85-108, 1981.
5. M. Nielsen, V. Sassone, and G. Winskel. Relationships between models for concurrency. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, eds., A Decade of Concurrency, vol. 803 of LNCS, pp. 425-476. Springer, 1994.
6. A. Rensink. Deterministic pomsets. Hildesheimer Informatik-Berichte 94/30, Universitgt Hildesheim, Nov. 1994.
7. A. Rensink. A complete theory of deterministic event structures. In I. Lee and S. A. Smolka, eds., Concur '95: Concurrency Theory, vol. 962 of LNCS, pp. 160-174. Springer, 1995.
8. A. Rensink. Denotational, causal, and operational determinism in event structures. Hildesheimer Informatik-Berichte 95/29, Universits Hildesheim, Sept. 1995.
9. A. Rensink. Further deterministic behavioural models for concurrency. Hildesheimer Informatik-Berichte 95/30, Universits Hildesheim, Oct. 1995.
10. V. Sassone. On the Semantics of Petri Nets: Processes, Unfoldings and Infinite Computations. PhD thesis, Universits de Pisa, Mar. 1994. Available as TD-6/94.
11. V. Sassone, M. Nielsen, and G. Winskel. A classification of models for concurrency. In E. Best, ed., Concur '93, vol. 715 of LNCS, pp. 82-96. Springer, 1993.
12. V. Sassone, M. Nielsen, and G. Winskel. Deterministic behavioural models for concurrency. In A. M. Borzyszkowski and S. Sokolowski, eds., Mathematical Foundations of Computer Science 1993, vol. 711 of LNCS, pp. 682-692. Springer, 1993.
13. F. W. Vaandrager. Determinism → (event structure isomorphism = step sequence equivalence). Theoretical Comput. Sci., 79:275-294, 1991.
14. G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, eds., Petri Nets: Applications and Relationships to Other Models of Concurrency, vol. 255 of LNCS, pp. 325-392. Springer, 1987.