SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 51, Issue 1-2, 1987, Pages 129-176

On the consistency of Koomen's Fair Abstraction Rule

(3) Baeten, J C M a Bergstra, J A a,b Klop, J W c

a UNIVERSITY OF AMSTERDAM (Netherlands)

b UTRECHT UNIVERSITY (Netherlands)

c CWI (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - ALGEBRA;

ALGEBRA OF COMMUNICATING PROCESSES WITH SILENT STEPS; APPROXIMATION INDUCTION PRINCIPLE; FAIR ABSTRACTION RULE;

COMPUTER METATHEORY;

EID: 0023477035 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(87)90052-1 Document Type: Article

Times cited : (95)

References (29)

1
- 0346572688
- Kluwer Programmatuurkunde, Deventer, The Netherlands, (in Dutch).
- (1986) Procesalgebra
- Baeten¹

2
- 0000265326
- Syntax and defining equations for an interrupt mechanism in process algebra
- (1986) Fund. Inform. , vol.9 , pp. 127-168
- Baeten¹ Bergstra² Klop³

3
- 0004715349
- Conditional axioms and α/β calculus in process algebra
- M. Wirsing, North-Holland, Amsterdam, Ebberup 1986
- (1987) IFIP Conf. on Formal Description of Programming Concepts
- Baeten¹ Bergstra² Klop³

4
- 85034608105
- Compactness in semantics for merge and fair merge
- E. Clarke, D. Kozen, Lecture Notes in Computer Science, Springer, Berlin
- (1983) Proc. Workshop Logics of Programs , vol.164 , pp. 18-33
- de Bakker¹ Zucker²

5
- 0020982655
- Processes and a fair semantics for the ADA rendez-vous
- J. Días, Lecture Notes in Computer Science, Springer, Berlin
- (1983) Proc. 10th ICALP , vol.154 , pp. 52-66
- de Bakker¹ Zucker²

6
- 0348035069
- An abstraction mechanism for process algebras
- Mathematisch Centrum, Amsterdam
- (1983) Report IW-231/83
- Bergstra¹ Klop²

7
- 0021870594
- Algebra of communicating processes with abstraction
- (1985) Theoret. Comput. Sci. , vol.37 , Issue.1 , pp. 77-121
- Bergstra¹ Klop²

8
- 0002868140
- Verification of an alternating bit protocol by means of process algebra
- W. Bibel, K.P. Jantke, Mathematical Methods of Specification and Synthesis of Software Systems '85, Akademie-Verlag, Berlin
- (1986) Mathematical Research , vol.31 , pp. 9-23
- Bergstra¹ Klop²

9
- 84910510276
- Fair FIFO queues satisfy an algebraic criterion for protocol correctness
- Centrum voor Wiskunde en Informatica, Amsterdam
- (1984) Report CS-R 8405
- Bergstra¹ Klop²

10
- 0002388050
- A complete inference system for regular processes with silent moves
- Centrum voor Wiskunde en Informatica, Amsterdam, Hull Proc. Logic Colloquium 1986
- (1984) Report CS-R 8420
- Bergstra¹ Klop²

11
- 0347008402
- Algebra of communicating processes
- J.W. de Bakker, M. Hazewinkel, J.K. Lenstra, North-Holland, Amsterdam
- (1986) Proc. CWI Symp. on Mathematics and Computer Science , pp. 89-138
- Bergstra¹ Klop²

12
- 0022079986
- Top-down design and the algebra of communicating processes
- (1985) Sci. Comput. Programming , vol.5 , Issue.2 , pp. 171-199
- Bergstra¹ Tucker²

13
- 84915852105
- A fair calculus of communicating systems
- University of Edinburgh
- (1983) Report CSR-137-83
- Costa¹ Stirling²

14
- 84915852104
- Infinitary languages and fully abstract models for fair asynchrony
- Rennes
- (1984) Report CNRS-IRISA
- Darondeau¹

15
- 85034645660
- Bounded nondeterminism and the Approximation Induction Principle in process algebra
- F.J. Brandenburg, G. Vidal-Naquet, M. Wirsing, Lecture Notes in Computer Science, Springer, Berlin
- (1987) Proc. STACS , vol.247 , pp. 336-347
- Van Glabbeek¹

16
- 84915884000
- Modelling fair processes
- Washington, DC
- (1984) Proc. 16th ACM Symp. on Theory of Computing
- Hennessy¹

17
- 0021597460
- Axiomatising finite delay operators
- (1984) Acta Inform , vol.21 , pp. 61-88
- Hennessy¹

18
- 84915840211
- An algebraic theory of fair asynchronous communicating processes
- W. Brauer, Lecture Notes in Computer Science, Springer, Berlin
- (1985) Proc. 12th ICALP , vol.194 , pp. 260-269
- Hennessy¹

19
- 0022013695
- Algebraic specification and verification of communication protocols
- (1985) Sci. Comput. Programming , vol.5 , pp. 1-36
- Koomen¹

20
- 84915852103
- A modular approach to protocol verification using process algebra
- State University of Utrecht, The Netherlands
- (1986) Report LGPS 6
- Koymans¹ Mulder²

21
- 84915852102
- Fixed-point equations with parameters in the projective model
- Centrum voor Wiskunde en Informatica, Amsterdam
- (1986) Report CS-R8606
- Kranakis¹

22
- 38249042113
- Merging regular processes by means of fixed-point theory
- (1986) Theoret. Comput. Sci. , vol.45 , pp. 193-260
- Meyer¹

23
- 0003276135
- A Calculus of Communicating Systems
- Springer, Berlin
- (1980) Lecture Notes in Computer Science , vol.92
- Milner¹

24
- 84945924340
- Concurrency and automata on infinite sequences
- P. Denssen, Lecture Notes in Computer Science, Springer, Berlin
- (1981) Proc. 5th GI Conf. , vol.104 , pp. 167-183
- Park¹

25
- 19344376280
- Fairness properties in process algebra
- Department of Computer Science, Uppsala University
- (1985) Ph.D. Thesis
- Parrow¹

26
- 0347639109
- Verification of two communication protocols by means of process algebra
- Centrum voor Wiskunde en Informatica, Amsterdam
- (1986) Report CS-R8608
- Vaandrager¹

27
- 0039972043
- The algebra of communicating processes with empty process
- University of Amsterdam
- (1986) Report FVI 86-01
- Vrancken¹

28
- 84915852100
- Another look at abstraction in process algebras
- Centre for Mathematics and Computer Science, Amsterdam, Karlsruhe Proc. 14th ICALP 1987
- (1987) Report CS-R8701
- Baeten¹ van Glabbeek²

29
- 84915852100
- Abstraction and empty process in process algebra
- Centre for Mathematics and Computer Science, Amsterdam
- (1987) Report CS-R8721
- Baeten¹ van Glabbeek²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.