Another look at abstraction in process algebra: Extended abstract

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

Volumn 267 LNCS, Issue , 1987, Pages 84-94

  Baeten, J C M ^a   van Glabbeek, R J ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY;

COMMUNICATING PROCESS; EXTENDED ABSTRACTS; IN-PROCESS; SILENT STEP; SYSTEM VERIFICATIONS;

ABSTRACTING;

EID: 85034735655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18088-5_8     Document Type: Conference Paper

References (14)

1. J.C. M. BAETEN, J.A. BERGSTRA & J.W. KLOP, Conditional axioms and α/β-calculus in process algebra, report CS-R8502, Centre for. & Comp. Sci., Amsterdam 1985, to appear in: Proc. IFIP Conf. on Formal Description of Progr. Concepts (M.Wirsing, ed.), Gl. Avernæs 1986, North-Holland.
2. J.C.M. BAETEN, J.A. BERGSTRA & J.W. KLOP, On the consistency of Koomen’s fair abstraction rule, to appear in Theor. Comp. Sci. 51 (1/2).
3. J.C. BAETEN & R.J. VAN GLABBEEK, Another look at abstraction in process algebra, report CS-R8701, Centre for. & Comp. Sci., Amsterdam 1987.
4. J.A. BERGSTRA & J.W. KLOP, Process algebra for synchronous communication, Inf. & Control 60 (1/3), pp. 109–137, 1984.
5. J.A. BERGSTRA & J.W. KLOP, Algebra of communicating processes with abstraction, Theor. Comp. Sci. 37 (1), pp. 77–121, 1985.
6. J.A. BERGSTRA & J.W. KLOP, Algebra of communicating processes, Proc. CWI Symp. & Comp. Sci. (J. de Bakker, M.Hazewinkel & J.Lenstra eds.), pp. 89–138, North-Holland, 1986.
7. J.A. BERGSTRA, J.W. KLOP & E.-R. OLDEROG, Failures without chaos: a new process semantics for fair abstraction, report CS-R8625, Centre for. & Comp. Sci., Amsterdam 1986, to appear in: Proc. IFIP Conf. on Formal Description of Progr. Concepts (M.Wirsing, ed.), Gl. Avernæs 1986, North-Holland.
8. S.D. BROOKES, C.A.R. HOARE & A.W. ROSCOE, A theory of communicating sequential processes, JACM 31 (3), pp. 560–599, 1984.
9. R.J. VAN GLABBEEK, Bounded nondeterminism and the approximation induction principle in process algebra, Proc. STACS 87 (F.Brandenburg, G.Vidal-Naquet & M.Wirsing, eds.), Springer LANCS 247, pp. 336–347, 1987.
10. C.A.R. HOARE, Communicating sequential processes, Prentice Hall 1985.
11. R. MILNER, A calculus of communicating systems, Springer LNCS 92, 1980.
12. R. MILNER, Lectures on a calculus of communicating systems, (S.D.Brookes, A.W. Roscoe & G.Winskel, eds.), pp. 197–220, Springer LNCS 197, 1985.
13. D.M.R. PARK, Concurrency and automata on infinite sequences, Proc. 5th GI Conf.(P. Deussen, ed.), Springer LNCS 104, pp. 167–183, 1981.
14. J.L.M. VRANCKEN, The algebra of communicating processes with empty process, report FVI 86-01, Dept. of Comp. Sci., Univ. of Amsterdam 1986.