A context dependent equivalence between processes

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

Volumn 194 LNCS, Issue , 1985, Pages 373-382

  Larsen, Kim Guldstrand ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BISIMULATION EQUIVALENCES; CONCURRENT PROCESS; CONTEXT DEPENDENT; CONTEXT INFORMATION; DEVELOPMENT METHOD; PARAMETERIZED; PARAMETERIZING;

AUTOMATA THEORY;

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

References (20)

1. Brookes, S. D. and Rounds, W. C. “Behavioural Equivalence relations induced by programming logics.” LNCS 154 (1983).
2. Dijkstra. Series in Automatic Computation. Volume: A discipline of programming. Prentice-Hall, 1976.
3. Graf, S. and Sifakis, J. A Modal Characterization of observational congruence on finite terms of CCS. Tech. Rept. Technical Report no. 402, IMAG. 1983. To appear in ICALP’84.
4. Hennessy, M. and Plotkin, G. D. “A term Model for CCS.” LNCS 88 (1980). Proceedings of 9th MFCS Conference.
5. Hennessy, M. A Term model for Synchronous Processes. Tech. Rept. CSR-77-81, University of Edinburgh, Department of Computer Science, 1981.
6. Hennessy, M. and Milner, R. “On Observing Nondeterminism and Concurrency.” LNCS 85 (1980). Proceedings of 7th ICALP.
7. Hennessy, M. and Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Tech. Rept. CSR-133-83, University of Edinburgh, Department of Computer Science, 1983. To appear in JACM.
8. Hoare, C.A.R., Brookes, S.D. and Roscoe, A.W. A Theory of Communicating Sequential Processes. Tech. Rept. PRG-16, Oxford University Computing Laboratory, Programming Research group, 1981.
9. Keller, R. “A fundamental theorem of asynchronous parallel computation.” Parallel Processing, (1975). Ed. T. Feng, Springer Verlag.
10. Milner, R. “An Algebraic Definition of Simulation between Programs.” in: Proc. 2nd International Conference on Artificial Intelligence (1971).
11. Milner, R. “A Calculus of Communicating Systems.” LNCS 92 (1980).
12. Milner, R. “A modal characterisation of observable machine-behaviour.” LNCS 112 (1981).
13. Milner, R. “A Complete Inference System for a Class of Regular Behaviours.” CSR-111-82 (1982). University of Edinburgh, Department of Computer Science.
14. Milner, R. “Calculi for Synchrony and Asynchrony.” Theoretical Computer Science 25 (1983), 267-310.
15. Nicola, R. de and Hennessy, M. Testing Equivalences for Processes. Tech. Rept. SCR-123-82, University of Edinburgh, Department of Computer Science, 1982.
16. Park, D.J. “Concurrency and Automata on Infinite Sequences.” LNCS 104 (1981).
17. Plotkin, Gordon D. A Structural Approach to Operational Semantics. Tech. Rept. DAIMI FN-19, Computer Science Department, Aarhus University, Denmark, September, 1981.
18. Stirling, C. A Proof Theoretic Characterization of Observational Equivalence. Tech. Rept. CSR-132-83, University of Edinburgh, Department of Computer Science, 1983. In Proceedings FCT-TCS Bangalore (1983), To appear in TCS.
19. Stirling, C. A Complete Modal Proof System for a Subset of SCCS. To appear in CAAP’85.
20. Stirling, C. A Complete Modal Proof System for a Subset of CCS. To appear.