From domains to automata with concurrency

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

Volumn 700 LNCS, Issue , 1993, Pages 669-681

  Bracho, Felipe ^a   Droste, Manfred ^b  

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

^b UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS TRANSITION SYSTEM; CONCURRENT SYSTEMS; LABELLED TRANSITION SYSTEMS; MINIMAL AUTOMATON; OPERATIONAL MODEL; TRACE THEORY;

AUTOMATA THEORY;

EID: 21144483216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56939-1_111     Document Type: Conference Paper

References (24)

1. I.J. Aalbersberg, G. Rozenberg: Theory of traces, Theoret. Comp. Science 60 (1988), 1-82.
2. P. Bachmann, Phan Minh Dung: Nondeterministic computations-structure and axioms, Elektron. Inf.verarb. Kybern. EIK 22 (1986), 243-261.
3. M. Bednarczyk: Categories of asynchronous systems, Ph.D. Thesis, University of Sussex, 1987.
4. G. Berry, J.-J. Levy: Minimal and optimal computations of recursive programs, J. ACM 26 (1979), 148-175.
5. G. Boudol, I. Castellani: A non-interleaving semantics for CCS based on proved transitions, Fundam. Inform. 11 (1988), 433-452.
6. F. Bracho, M. Droste: Domains and automata with concurrency, internal report, Universidad Nacional Autónoma de México and Universitht Essen, Nov. 1992.
7. P. L. Curien: Categorical Colnbiuators, Sequential Algorithms and Functional Programming, Research Notes in Computer Science, Pitman, London, 1986.
8. M. Droste: Concurrency, automata and domains, in: 17 th ICALP, Lecture Notes in Computer Science 443, Springer, 1990, 195-208.
9. M. Droste: Concurrent automata and domains, Intern. J. Of Foundations of Comp. Science, in press.
10. M. Droste, 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., Reading 1993, in press.
11. C.A.R. Hoare: Communicating sequential processes, Comm. ACM 21 (1978), 666-676.
12. G. Huet, J.-J. Levy: Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979).
13. S. Katz, D. Peled: Defining conditional independence using collapses, in: 'Semantics for Concurrency' (M.Z Kwiatkowska, M.W. Shields, R.M. Thomas, eds.), Proc. of the Int. BCS-FACS Workshop at Leicester, 1990, Springer, 262-280.
14. J.-J. Levy: Optimal reductions in the lambda calculus, in: 'To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism' (J.P. Seldin, J.R. ttindley, eds.), Academic Press, New York, 1980, 159-191.
15. A. Mazurkiewicz: Concurrent program schemes and their interpretations, DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
16. R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer, 1980.
17. th ICALP, Lecture Notes in Computer Science 317, Springer 1988, 439-454.
18. M.W. Shields: Concurrent machines, Comp. J. 28 (1985), 449-465.
19. E.W. Stark: Concurrent transition systems, Theorel. Comp. Science 64 (1989), 221-269.
20. E.W. Stark: Compositional relational semantics for indeterminate dataflow networks, in: Proc., Category Theory and Computer Science, Lecture Nares in Computer Science, 389, Springer, 1989, 52-74.
21. E.W. Stark: Dataflow networks are fibrations, in: 'Category Theory and Computer Science', Proc. Paris, Lecture Notes in Computer Science, 530, Springer, 1991, 261-281.
22. th Conference on the Mathematical Foundations of Programming Semanties, Lecture Notes in Computer Science, 442 Springer, 1989, pp. 53-79.
23. G. Winskel: Event structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science 255, Springer, 1987, pp. 325-392.
24. G. Winskel, M. Nielsen: 'Models for Concurrency', draft copy of Oct. 1991, in: Handbook of Logic in Computer Science (S. Abramsky, D.M. Gabbay, T.S.E. Maibaum, eds.), to appear.