Concurrency, automata and domains

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

Volumn 443 LNCS, Issue , 1990, Pages 195-208

  Droste, Manfred ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

BINARY RELATION; CONCURRENT AUTOMATA; CONCURRENT SYSTEMS; LABELED TRANSITION SYSTEMS; OPERATIONAL MODEL; SCOTT DOMAINS;

AUTOMATA THEORY;

EID: 0346334794     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0032032     Document Type: Conference Paper

References (26)

1. I.J. Aalbersberg, G. Rozenberg: Theory of traces, Theoret. Comp. Science 60 (1988), 1–82.
2. M. Bednarczyk: Categories of asynchronous systems, PhD Thesis, University of Sussex, 1987.
3. G. Berry: Stable models of typed λ-calculi, in: 5TH ICALP, Lecture Notes in Computer Science, vol. 62, Springer, 1978, pp. 72–89.
4. G. Berry, J.-J. Lévy: Minimal and optimal computations of recursive programs, J. ACM 26 (1979), 148–175.
5. G. Boudol: Computational semantics of term rewriting, in: Algebraic Methods in Semantics (M. Nivat, J.C. Reynolds, eds.), Cambridge University Press, 1985, pp. 169–236.
6. G. Boudol, I. Castellani: A non-interleaving semantics for CCS based on proved transitions, Fundam. Inform. 11 (1988), 433–452.
7. T. Coquand, C. Gunter, G. Winskel: DI-domains as a model of polymorphism, in: Mathematical Foundations of Programming Language Semantics (M. Main, A. Melton, M. Mislove, D. Schmidt, eds), Lecture Notes in Computer Science, vol 298, Springer, 1988, pp. 344–363.
8. P.L. Curien: Categorical Combinators, Sequential Algorithms and Functional Programming, Research Notes in Theoretical Computer Science, Pitman, London, 1986.
9. M. Droste: Event structures and domains, Theoret. Comp. Science 68 (1989), 37–47.
10. M. Droste: Recursive domain equations for concrete data structures, Information and computation 82 (1989), 65–80.
11. M. Droste: Concurrent automata and dI-domains, to appear.
12. M. Droste, R. Göbel: Universal domains in the theory of denotational semantics of programming languages, Proc. IEEE Symposium on ‘Logic in Computer Science’, Philadelphia, 1990, to appear.
13. C.A.R. Hoare: Communicating sequential processes, Comm. ACM 21 (1978), 666–676.
14. G. Huet, J.-J. Lévy: Call-by-need computations in non-ambiguous linear term rewriting systems, IRIA-LABORIA Report 359 (1979).
15. G. Kahn, G. Plotkin: Domaines concretes, IRIA-LABORIA Report 336, Paris (1978).
16. J.-J. Lévy: Optimal reductions in the lambda calculus, in: To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism (J.P. Seldin, J.R. Hindley, eds.), Academic Press, 1980, pp. 159–191.
17. R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.
18. P. Panangaden, E.W. Stark: Computations, residuals and the power of indeterminacy, in: 15th ICALP, 1988, Lecture Notes in Computer Science, vol 317, Springer, 1988, pp. 439–454.
19. D. Scott: Domains for denotational domains, in: 9th ICALP, Lecture Notes in Computer Science, vol. 140, Springer, 1982, pp. 577–613.
20. E.W. Stark: Concurrent transition systems, Theoret. Comp. Science 64 (1989), 221–269.
21. E.W. Stark: Compositional relational semantics for indeterminate dataflow networks, in: Proc., Category Theory and Computer Science, Lecture Notes in Computer Science, vol. 389, Springer, 1989, pp. 52–74.
22. E.W. Stark: Connections between a concrete and an abstract model of concurrent systems, in: 5th Conf. on the Mathematical Foundations of Programming Semantics, Lecture Notes in Computer Science, Springer, 1989, to appear.
23. J. Stoy: Denotational Semantics: The Scott-Strachy Approach to Programming Languages, MIT Press, Cambridge, Mass., 1977.
24. G. Winskel: Events in Computation, PhD Thesis, Edinburgh, 1981.
25. G. Winskel: Event structures, in: Petri Nets: Applications and Relationships to Other Models of Concurrency (W. Brauer, W. Reisig, G. Rozenberg, eds.), Lecture Notes in Computer Science, vol. 255, Springer, 1987, pp. 325–392.
26. G. Zhang: DI-domains as information systems, in: 16th ICALP, Springer, 1989, to app.