Fundamentals of modelling concurrency using discrete relational structures

Acta Informatica

Volumn 34, Issue 5, 1997, Pages 367-388

  Janicki, Ryszard ^a   Koutny, Maciej ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES;

CAUSAL PARTIAL ORDER; CONCURRENCY THEORY; DISCRETE RELATIONAL STRUCTURE; EXTENSION COMPLETENESS;

MATHEMATICAL MODELS;

EID: 0031295333     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050090     Document Type: Article

References (40)

1. Abraham U., Ben-David S., Magidor M.: On global-time and inter-process communication. In: Kwiatkowska M.Z., Shields M.W., Thomas R.M. (Eds.), Semantics for Concurrency, Leicester 1990. Workshops in Computing, 311-323. Berlin, Heidelberg: Springer 1990
2. Anger F.D.: On Lamport's interprocess communication model. ACM TOPLAS 11,3 (1989), 404-417.
3. Berghammer R., Schmidt G.: Discrete ordering relations. Discrete Mathematics 43 (1983), 1-7.
4. Best E., Devillers R.: Sequential and concurrent behaviour in Petri net theory. Theoretical Computer Science 55 (1987), 87-136.
5. Best E., Fernández C.: Nonsequential processes: a Petri net view. Berlin, Heidelberg: Springer 1988
6. Best E., Koutny M.: Petri net semantics of priority systems. Theoretical Computer Science 94,1 (1992), 141-158.
7. de Boer F., Palamidessi C., Best E.: Concurrent constraint programming with information removal. Draft paper (1995).
8. Brookes S. D., Hoare C. A. R., Roscoe A. W.: A theory of communicating sequential systems. Journal of ACM 31 (1984), 560-599.
9. Diekert V., Rozenberg G. (eds.): The book on traces. Singapore: World Scientific 1995
10. Fishburn P.C.: Intransitive indifference with unequal indifference intervals. J. Math. Psych. 7 (1970), 144-149.
11. Fishburn P.C.: Interval orders and interval graphs. New York: J. Wiley 1985
12. Fräisse R.: Theory of relations. Amsterdam: North Holland 1986
13. Gaifman H., Pratt V.: Partial order models of concurrency and the computation of function. In: Proc. of Symposium on Logic in Computer Science (1987), 72-85.
14. Gerber R., Lee I.: A resource-based prioritized bisimulation for real-time systems. Information and Computation 113,1 (1994), 103-142.
15. van Glabbeek R., Vaandrager F.: Petri net models for algebraic theories of concurrency. In: de Bakker J.W., Nijman A.J., Treleaven P.C. (Eds.), PARLE, Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 259, 224-242. Berlin, Heidelberg: Springer 1987
16. Janicki R.: A formal semantics for concurrent systems with a priority relation. Acta Informatica 24 (1987), 33-5:5.
17. Janicki R., Koutny M.: Invariants and paradigms of concurrency theory. In: Aarts E.H.L., van Leeuwen J., Rem M. (Eds.), PARLE, Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 506, 59-74. Berlin, Heidelberg: Springer 1991
18. Janicki R., Koutny M.: Structure of concurrency. Theoretical Computer Science 112 (1993), 5-52.
19. Janicki R., Koutny M.: Order structures and generalisations of Szpilrajn's theorem. In: Shyamasundar R.K. (Ed.), Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science 761, 348-357. Berlin, Heidelberg: Springer 1993
20. Janicki R., Koutny M.: Representations of discrete interval orders and semi-orders. J. Inform. Process. Cybernet. EIK 30,3 (1994), 161-168.
21. Janicki R., Koutny M.: Deriving histories of nets with priority relations. In: PARLE, Parallel Architectures and Languages Europe. Lecture Notes in Computer Science 817, 623-634. Berlin, Heidelberg: Springer 1994
22. Janicki R., Koutny M.: Semantics of inhibitor nets. Information and Computation 123,1 (1995), 1-17.
23. Janicki R., Lauer P.: Specification and analysis of concurrent systems: the COSY approach. Springer-Verlag (1992).
24. Lamport L.: The mutual exclusion problem: Part I - a theory of interprocess communication; Part II -statements and solutions. Journal of ACM 33,2 (1986), 313-326.
25. Katz S., Peled D.: Interleaving set temporal logic. Theoretical Computer Science 75 (1990), 263-287.
26. Mazurkiewicz A.: Trace theory. In: Brauer W., Reisig W., Rozenberg G. (Eds.), Petri Nets: Applications and Relationships to Other Models of Concurrency. Advances in Petri Nets 1986, Part II. Lecture Notes in Computer Science 255, 297-324. Berlin, Heidelberg: Springer 1987
27. Milner R.: Communication and concurrency. Prentice Hall (1989).
28. Nielsen M., Engberg U., Larsen K.S.: Fully abstract models for a process language with refinement. In: de Bakker J.W., de Roever W.-P., Rozenberg G. (Eds.), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Lecture Notes in Computer Science 354, 523-548. Berlin, Heidelberg: Springer 1988
29. Peterson J.L.: Petri net theory and the modeling of systems. Englewood Cliffs: Prentice Hall (1981).
30. Plotkin G., Pratt V.: Teams can see pomsets. Unpublished memo, available electronically as pub/pp2.tex by anonymous FTP from Boole.Stanford.EDU.
31. Pratt V.: Modelling concurrency with partial orders. Int. Journal of Parallel Programming 15,1 (1986), 33-71.
32. Reisig W.: Petri nets. An introduction. Berlin, Heidelberg: Springer 1985
33. Rozenberg G., Verraedt R.: Subset languages of Petri nets. Theoretical Computer Science 26 (1983), 301-323.
34. Salwicki A., Müldner T.: On algorithmic properties of concurrent programs. In: Engeler E. (Ed.), Logic of Programs. Lecture Notes in Computer Science 125, 169-197. Berlin, Heidelberg: Springer 1981
35. Schmidt G., Stroehlein T.: Relations and graphs. Berlin, Heidelberg: Springer 1993
36. Shields M.W.: Concurrent machines. The Computer Journal 28,5 (1985), 449-465.
37. Shields M.W.: On the non-sequential behaviours of systems posessing a general free-choice property. CSR-92-81, Dept. of Computer Science, University of Edinburgh, 1981.
38. Szpilrajn E.: Sur l'extension de l'ordre partial. Fundamenta Mathematicae 16 (1930), 386-389.
39. Vogler W.: Failure semantics based on interval semiwords is a congruence for refinement. Distributed Computing 4 (1991), 139-162.
40. Wiener N.: A contribution to the theory of relative position. Proc. Camb. Philos. Soc. 17 (1914), 441-449.