The topology of Mazurkiewicz traces

Theoretical Computer Science

Volumn 305, Issue 1-3, 2003, Pages 237-258

  Kummetz, Ralph ^a   Kuske, Dietrich ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING; TOPOLOGY; TREES (MATHEMATICS);

CONCURRENT SYSTEMS;

COMPUTER SCIENCE;

EID: 0042530413     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00694-1     Document Type: Conference Paper

References (18)

1. S. Abramsky, A. Jung, Domain theory, in: S. Abramsky, D.M. Gabbay, T.S.T. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, Oxford, 1994, pp. 1-168.
2. P. Bonizzoni, G. Mauri, G. Pighizzini. About infinite traces, in: V. Diekert (Ed.), Proc. ASMICS Workshop Free Partially Commutative Monoids, Kochel am See, October 1989, Report TUM-I9002, TU München, 1990, pp. 1-10.
3. Cartier P., Foata D. Problèmes combinatoires de commutation et réarrangements. Lecture Notes in Mathematics. Vol. 85:1969;Springer, Berlin, Heidelberg, New York.
4. Diekert V. On the concatenation of infinite traces. Theoret. Comput. Sci. 113:1993;35-54.
5. Diekert V., Gastin P. Approximating traces. Acta Informatica. 35:1998;567-593.
6. V. Diekert, Y. Métivier, Partial commutation and traces, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Vol. 3, Springer, Berlin, Heidelberg, 1997, pp. 457-533.
7. Diekert V., Rozenberg G. The Book of Traces. 1995;World Scientific, Singapore.
8. Droste M. Concurrent automata and domains. Internat. J. Found. Comput. Sci. 3:1992;389-418.
9. Gastin P., Petit A. Infinite traces, The Book of Traces, Chap. 11. 1995;World Scientific, Singapore.
10. Gastin P., Rozoy B. The poset of infinitary traces. Theoret. Comput. Sci. 125:1993;167-204.
11. R. Kummetz, From partial orders with projections to domains. Extended abstract, in: S. Brookes, A. Jung, M. Mislove, A. Scedrov (Eds.), Mathematical Foundations of Programming Semantics, Fifteenth Conference, Electronic Notes in Theoretical Computer Science, Vol. 20, 1999, 12p.
12. R. Kummetz, Partially ordered sets with projections and their topology. Ph.D. Thesis, Technische Universität Dresden, 2000.
13. Kuratowski K. Topology. 1966-1968;Academic Press, New York.
14. Kwiatkowska M. A metric for traces. Inform. Proc. Lett. 35:1990;129-135.
15. Majster-Cederbaum M., Baier C. Metric completion versus ideal completion. Theoret. Comput. Sci. 170:1996;145-171.
16. A. Mazurkiewicz, Concurrent program schemes and their interpretations. DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
17. Mazurkiewicz A. Trace theory. Brauer W.et al. Petri Nets, Applications and Relationship to other Models of Concurrency. Lecture Notes in Computer Science. Vol. 255:1987;279-324 Springer, Berlin.
18. Pierce R.S. Existence and uniqueness theorems for extensions of zero-dimensional compact metric spaces. Trans. Amer. Math. Soc. 148:1970;1-21.