Algebra and Theory of Order-Deterministic Pomsets

Notre Dame Journal of Formal Logic

Volumn 37, Issue 2, 1996, Pages 283-321

  Rensink, Arend ^a  

^a UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845657714     PISSN: 00294527     EISSN: 19390726     Source Type: Journal    
DOI: 10.1305/ndjfl/1040046090     Document Type: Article

References (26)

1. Aalbersberg, J. J., and G. Rozenberg, “Theory of traces,” Theoretical Computer Science, vol. 60 (1988), pp. 1-82.
2. Aceto, L., “Full abstraction for series-parallel pomsets,” pp. 1-25 in TAPSOFT’91, Volume 1, edited by S. Abramsky and T. S. E. Maibaum, vol. 493 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1991.
3. Baeten, J. C. M., and W. P. Weijland, Process Algebra, Cambridge University Press, Cambridge, 1990.
4. Boudol, G., and I. Castellani, “Permutations of transitions: An event structure semantics for CCS and SCCS,” pp. 411-427 in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, vol. 354 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989.
5. Corradini, A., H. Ehrig, M. Löwe, U. Montanari, and F. Rossi, “An event structure semantics for safe graph grammars,” pp. 423-446 in Programming Concepts, Methods and Calculi, edited by E.-R. Olderog, vol. A-56 of IFIP Transactions, North-Holland, Amsterdam, 1994.
6. De Nicola, R., and A. Labella, “A completeness theorem for nondeterministic Kleene algebras,” pp. 536-545 in Mathematical Foundations of Computer Science 1994, edited by I. Prívara, B. Rovan, and P. Ruzicka, vol. 841 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994. 5.2, 5.2.
7. Gischer, J. L., “The equational theory of pomsets,” Theoretical Computer Science, vol. 61 (1988), pp. 199-224.
8. Grabowski, J., “On partial languages,” Fundamenta Informaticæ, vol. 4 (1981), pp. 427-498.
9. Groote, J. F., Process Algebra and Structured Operational Semantics, Ph.D. thesis, University of Amsterdam, 1991. 3.2, 3.2.
10. Heering, J., “Partial evaulation and ω-completeness of algebraic specifications,” Theoretical Computer Science, vol. 43 (1986), pp. 149-167. 3.2, 3.2.
11. Jónsson, B., “Arithmetic of ordered sets,” pp. 3-41 in Ordered Sets, edited by I. Rival, Reidel, Dordrecht, 1982.
12. Kröger, F., Temporal Logic of Programs, vol. 8 of EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin, 1987.
13. Lazrek, A., P. Lescanne, and J.-J. Thiel, “Tools for proving inductive equalities, relative completeness, and ω-completeness,” Information and Computation, vol. 84 (1990), pp. 47-70.
14. Mazurkiewicz, A., “Concurrent program schemes and their interpretations,” DAIMI Report PB-78, Aarhus University, 1977. 5.2.
15. Mazurkiewicz, A., “Basic notions of trace theory,” pp. 285-363 in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, vol. 354 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989.
16. Milner, R., Communication and Concurrency. Prentice-Hall, Englewood Cliffs, 1989.
17. Nielsen, M., U. Engberg, and K. G. Larsen, “Fully abstract models for a process language with refinement,” pp. 523-549 in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, vol. 354 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989.
18. Nielsen, M., V. Sassone, and G. Winskel, “Relationships between models for concurrency,” pp. 425-476 in A Decade of Concurrency, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, vol. 803 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1994.
19. Pratt, V. R., “Modeling concurrency with partial orders,” International Journal of Parallel Programming, vol. 15 (1986), pp. 33-71.
20. Rensink, A., “Posets for configurations” pp. 269-285 in Concur’92, edited by W. R. Cleaveland, vol. 630 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1992.
21. Rensink, A., “Deterministic pomsets,” Hildesheimer Informatik-Berichte 30/94, Institut für Informatik, University of Hildesheim, 1994. 1, 5.3.3.
22. Rensink, A., “A complete theory of deterministic event structures,” pp. 160-174 in Concur’95: Concurrency Theory, edited by I. Lee and S. A. Smolka, vol. 962 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995. 5.3.3, 5.3.3.
23. Rensink, A., “Denotational, causal, and operational determinism in event structures,” pp. 272-286 in Trees in Algebra and Programming—CAAP’96, edited by H. Kirchner, vol. 1059 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1996. MR 1415912 1.2.6.
24. Rutten, J. J. M. M., “Processes as terms: Non well-founded models for bisimulation,” Mathematical Structures in Computer Science, vol. 2 (1992), pp. 257-275.
25. Winskel, G., “Event structures,” pp. 325-392 in Petri Nets: Applications and Relationships to Other Models of Concurrency, edited by W. Brauer, W. Reisig, and G. Rozenberg, vol. 255 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1987.
26. Winskel, G., “An introduction to event structures,” pp. 364-397 in Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, vol. 354 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1989.