Dependence orders for computations of concurrent automata

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

Volumn 900, Issue , 1995, Pages 467-478

  Bracho, Felipe ^a   Droste, Manfred ^b   Kuske, Dietrich ^b  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY;

BINARY RELATION; CONCURRENT AUTOMATA; EQUIVALENCE RELATIONS; FINITE COMPUTATIONS; GRAPH-THEORETIC; LABELED TRANSITION SYSTEMS; TRACE THEORY;

EQUIVALENCE CLASSES;

EID: 21844491675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-59042-0_97     Document Type: Conference Paper

References (27)

1. AALBERSBERG, I.J. and G. ROZENBERG: Theory of traces. Theor. Comp. Science 60 (1988), 1-82.
2. BEDNARCZYK, M.: Categories of asynchronous systems. Ph.D. thesis, University of Sussex, 1987.
3. BOUDOL, G. and I. CASTELLANI: A non-interleaving semantics for CCS based on proved transitions. Yhndam. Inform. 11 (1988), 433-452.
4. BÖRGER, E. and D. ROSENZWEIG: Oceam: Specification and compiler correctness. Part I: Simple mathematical interpreters. To appear.
5. BRACHO, F. and M. DROSTE: From domains to automata with concurrency. In: 20th ICALP, LNCS 700, Springer, 1993, pp. 669-681.
6. BRACHO, F. and M. DROSTE: Labelled domains and automata with concurrency. Theor. Comp. Science, in press.
7. BRACHO, F., M. DROSTE and D. KUSKE: Representation of computations in concurrent automata by dependence orders. Internal report of TU Dresden, MATH-AL-3-1994.
8. BIRKHOFF, G.: Lattice Theory. AMS, Providence, 1973.
9. DIEKERT, V.: Combinatorics on Traces. LNCS 454, Springer, 1990.
10. DROSTE, M.: Concurrency, automata and domains. In: 17th ICALP, LNCS 443, Springer, 1990, pp. 195-208.
11. DROSTE, M.: Concurrent automata and domains. Intern. J. of Found. of Comp. Science 3 (1992), 389-418.
12. DROSTE, M.: A Kleene theorem for recognizable languages over concurrency monoids. In: 21st ICALP, LNCS 820, Springer 1994, pp. 388-399. (Full version to appear in Theor. Comp. Science)
13. DROSTE, M.: Aperiodic languages over concurrency monoids. To appear.
14. DROSTE, M. and R.M. SHORTT: Petri nets and automata with concurrency relations - an adjunction. In: Semantics of Programming Languages and Model Theory (M. Droste, Y. Gurevich, eds.), Gordon and Breach Science Publ., OPA (Amsterdam), 1993, 69-87.
15. GUAIANA, G., A. RESTIVO and S. SALEMI: Star-free trace languages. Theor. Comp. Science 97 (1992), 301-311.
16. KATZ, S. and D. PELED: Defining conditional independence using collapses. In: Semantics for Concurrency (M.Z. Kwiatowska, M.W. Shields, R.M. Thomas, eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, 1990, Springer, 262-280.
17. KUSKE, D.: ModeUe nebenläufiger Prozesse - Monoide, Residuensysteme und Automaten. Dissertation, Universits GHS Essen, 1994.
18. KUSKE, D.: Nondeterministic automata with concurrency relations. Colloquium on Trees in Algebra and Programming, LNCS 787, Springer, 1994, 202-217.
19. LEVY, J.J.: Rèductions correctes et optimales dans leλ-calcul. Ph.D. Thesis, Universitè Paris VII, 1978.
20. Mazurkiewlcz, A.: Concurrent program schemes and their interpretation. DAIMI Report PB-78, Aashus University, Aarhus, 1977.
21. MAZURKIEWICZ, A.: Trace theory. In: Advanced Course on Petri Nets, LNCS 188, Springer, 1985, pp. 279-324.
22. NIELSEN, M., G. ROSENBERG and P.S. THIAGARAJAN: Elementary transition systems. Theor. Comp. Science 96 (1992), 3-33.
23. OCHMANSKI, E.: Regular behaviour of concurrent systems, Bull. Europ. Assoc. for TheoreticM Computer Science 27 (1985), 56-67.
24. PANANGADEN, P., V. SHANBHOGUE and E.W. STARK: Stability and sequentiability in dataflow networks. In: 17th ICALP, LNCS 443, Springer, 1990, pp. 308-321.
25. STARK, E.W.: Connections between a concrete and an abstract model of concurrent systems. In: Proceedings of the 5th Conf. on the Mathematical Foundations of Programming Semantics, LNCS 389, Springer, 1989, pp. 52-74.
26. WINSKEL, G.: Event structures. In: Petri Nets: Applications and Relationships to Other Models of Concurrency (W. Brauer, W. Reisig, G. Rozenberg, eds.), LNCS 255, Springer, 1987, pp. 325-392.
27. WINSKEL, G. and M. NIELSEN: Models for concurrency. In: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear.