next up previous
Up: Branching Time and Abstraction Previous: Conclusion


S.ABRAMSKY (1987), Observation equivalence as a testing equivalence, TCS 53, pp. 225-241.

L.ACETO, W.J.FOKKINK, R.J. VAN GLABBEEK & A.INGóLFSDóTTIR (1995), Axiomatizing prefix iteration with silent steps, BRICS Research Report RS-95-56, Department of Mathematics and Computer Science, Aalborg University, Aalborg, Denmark. To appear in Information and Computation.

G.J.AKKERMAN & J.C.M.BAETEN (1991), Term rewriting analysis in process algebra, CWI Quarterly 4(4), pp. 257-267.

J.C.M.BAETEN, J.A.BERGSTRA & J.W.KLOP (1987a), On the consistency of Koomen's fair abstraction rule. TCS 51(1/2), pp. 129-176.

J.C.M.BAETEN, J.A.BERGSTRA & J.W.KLOP (1987b), Ready-trace semantics for concrete process algebra with the priority operator, The Computer Journal 30(6), pp. 498-506.

J.C.M.BAETEN & R.J. VAN GLABBEEK (1987), Another look at abstraction in process algebra, proc. ICALP 87 (Th.Ottman ed.) Karlsruhe, Germany, LNCS 267, Springer-Verlag, pp.84-94.

J.C.M.BAETEN & W.P.WEIJLAND (1990), Process Algebra, Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, Cambridge.

J.W. DE BAKKER, J.A.BERGSTRA, J.W.KLOP & J.-J.Ch.MEIJER (1984), Linear time and branching time semantics for recursion with merge, TCS 34, pp. 135-156.

T.BASTEN (1996), Branching bisimulation is an equivalence indeed, to appear in Information Processing Letters.

J. VAN BENTHEM, J. VAN EIJCK & V.STEBLETSOVA (1995?), Modal logic, transition systems and processes, Journal of Logic and Computation 4(5), pp. 811-855.

J.A.BERGSTRA & J.W.KLOP (1984), Process algebra for synchronous communication, Information & Control 60 (1-3), pp. 109-137.

J.A.BERGSTRA & J.W.KLOP (1985), Algebra of communicating processes with abstraction, TCS 37(1), pp. 77-121.

J.A.BERGSTRA & J.W.KLOP (1988), A complete inference system for regular processes with silent moves, proc. Logic Colloquium 1986 (F.R.Drake & J.K.Truss, eds) Hull, North Holland, pp. 21-81.

J.A.BERGSTRA, J.W.KLOP & E.-R.OLDEROG (1987), Failures without chaos: a new process semantics for fair abstraction, Formal Description of Programming Concepts - III, proc. third IFIP WG 2.2 working conf. (M.Wirsing ed.) Ebberup, Denmark 1986, North Holland, pp. 77-103.

B.BLOOM (1995), Structural operational semantics for weak bisimulations, TCS 146, pp. 25-68.

B.BLOOM, S.ISTRAIL & A.R.MEYER (1995), Bisimulation can't be traced, JACM 42(1), pp. 232-268.

A.BOUALI (1992), Weak and branching bisimulation in FCTOOL, Rapports de Recherche No 1575, INRIA, Sophia Antipolis, Valbonne Cedex, France.

S.D.BROOKES, C.A.R.HOARE & A.W.ROSCOE (1984), A theory of communicating sequential processes, JACM 31(3), pp. 560-599.

M.C.BROWNE, E.M.CLARKE & O.GRMBERG (1988), Characterizing finite Kripke structures in propositional temporal logic, TCS 59(1/2), pp. 115-131.

L.CASTELLANO, G. DE MICHELIS & L.POMELLO (1987), Concurrency vs Interleaving: an instructive example, Bulletin of the EATCS 31, pp. 12-15.

F.CHERIEF (1992), Contributions  la smantique du paralllisme: Bisimulations pour le raffinement et le vrai paralllisme, Ph.D.Thesis, Univ. Grenoble, France.

F.CHERIEF & PH.SCHNOEBELEN (1991), t-Bisimulations and full abstraction for refinement of actions, Information Processing Letters 40, pp. 219-222.

S. CHRISTENSEN, H. HüTTEL & C. STIRLING (1995), Bisimulation equivalence is decidable for all context-free processes, Information and Computation 121(2), pp. 143-148.

E.M.CLARKE & E.A. EMERSON (1981), Design and synthesis of synchronization skeletons using branching-time temporal logic, Proceedings of the Workshop on Logics of Programs (D. Kozen, ed.) Yorktown Heights, LNCS 131, Springer-Verlag, pp. 52-71.

PH.DARONDEAU & P.DEGANO (1989), About semantic action refinement, Fundamenta Informaticae XIV, pp. 221-234.

R. DE NICOLA & M.HENNESSY (1984), Testing equivalence for processes, TCS 34, pp. 83-133.

R. DE NICOLA, P.INVERARDI & M.NESI (1990), Using axiomatic presentation of behavioural equivalences for manipulating CCS specifications, Automatic Verification Methods for Finite State Systems (J. Sifakis, ed.), LNCS 407, Springer-Verlag, pp. 54-67.

R. DE NICOLA, U.MONTANARI & F.W.VAANDRAGER (1990), Back and forth bisimulations, proc. CONCUR 90 (J.C.M. Baeten & J.W. Klop, eds.) Amsterdam, LNCS 458, Springer-Verlag, pp. 152-165.

R. DE NICOLA & F.W.VAANDRAGER (1990a), Three logics for branching bisimulation, Proc. LICS 90, Philadelphia, IEEE Computer Society Press, Washington, pp. 118-129. Full version in JACM 42(2), pp. 458-487.

R. DE NICOLA & F.W.VAANDRAGER (1990b), Action versus state based logics for transition systems, Proc. Semantics of Systems of Concurrent Processes (I. Guessarian, ed.) La Roche Posay, France, LNCS 469, Springer-Verlag, pp. 407-419.

R.DEVILLERS (1992), Maximality preserving bisimulation, TCS 102, pp. 165-183.

E.A.EMERSON & J.Y.HALPERN (1986), 'Sometimes' and 'Not Never' revisited: on branching time versus linear time temporal logic. JACM 33(1), pp. 151-178.

R.J. VAN GLABBEEK (1990a), Comparative concurrency semantics and refinement of actions, Ph.D. Thesis, Free University, Amsterdam.

R.J. VAN GLABBEEK (1990b), The linear time - branching time spectrum, proc. CONCUR '90 (J.C.M.Baeten & J.W.Klop, eds.) Amsterdam, LNCS 458, Springer-Verlag, pp. 278-297.

R.J. VAN GLABBEEK (1993a), A complete axiomatization for branching bisimulation congruence of finite-state behaviours, proc. MFCS 1993, (A.M.Borzyszkowski & S.Sokolowski, eds.) Gdansk, Poland, LNCS 711, Springer-Verlag, pp. 473-484.

R.J. VAN GLABBEEK (1993b), The linear time - branching time spectrum II, preliminary version available from; extended abstract in proc. CONCUR '93 (E.Best, ed.) Hildesheim, Germany, LNCS 715, Springer-Verlag, pp. 66-81.

R.J. VAN GLABBEEK (1993c), What is branching time and why to use it? Report No. STAN-CS- 93-1486, Stanford University, available from In the Concurrency Column (M. Nielsen, ed.), Bulletin of the EATCS 53, 1994, pp. 190-198.

R.J. VAN GLABBEEK & U.GOLTZ (1990), Refinement of actions in causality based models, proc. REX workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness (J.W. de Bakker, W.-P. de Roever & G. Rozenberg, eds.) Mook, The Netherlands, LNCS 430, Springer-Verlag, pp. 267-300.

R.J. VAN GLABBEEK & F.W. VAANDRAGER (1993), Modular specification of process algebras, TCS 113(2), pp. 293-348.

R.J. VAN GLABBEEK & W.P.WEIJLAND (1989a), Branching time and abstraction in bisimulation semantics (extended abstract), Information Processing 89, proc. IFIP 11th World Computer Congress (G.X.Ritter, ed.) San Francisco, North Holland, pp. 613-618.

R.J. VAN GLABBEEK & W.P.WEIJLAND (1989b), Refinement in branching time semantics, Report CS-R8922, Centrum voor Wiskunde en Informatica, Amsterdam, and proc. AMAST conference, May 1989, Iowa, pp. 197-201.

R.J. VAN GLABBEEK & W.P.WEIJLAND (1990), Branching time and abstraction in bisimulation semantics, Report TUM-I9052, SFB-Bericht Nr. 342/29/90 A, Institut für Informatik, TU. München, Germany. Also Report CS-R9120, CWI, Amsterdam, The Netherlands 1991.

S.GRAF & J.SIFAKIS (1987), Readiness semantics for regular processes with silent actions, proc. ICALP 87 (Th.Ottman, ed.) Karlsruhe, LNCS 267, Springer-Verlag, pp.115-125.

J.F.GROOTE & H. HüTTEL (1994), Undecidable equivalences for basic process algebra, Information and Computation 115(2), pp. 354-371.

J.F.GROOTE & F.W.VAANDRAGER (1990), An efficient algorithm for branching bisimulation and stuttering equivalence, proc. ICALP 90 (M.S.Paterson, ed.) Warwick, LNCS 443, Springer- Verlag, pp. 626-638.

M.HENNESSY & R.MILNER (1980), On observing nondeterminism and concurrency, in: Proceedings ICALP 80 ( Bakker & J.van Leeuwen, eds.), LNCS 85, Springer Verlag, pp. 299-309, a preliminary version of:

M.HENNESSY & R.MILNER (1985), Algebraic laws for nondeterminism and concurrency, Journal of the ACM 32(1), pp. 137-161.

M. HENNESSY & G.D.PLOTKIN (1980), A term model for CCS, proc. MFCS 80 (P.Dembi+n ski, ed.), LNCS 88, Springer-Verlag, pp. 261-274.

C.A.R.HOARE (1980), Communicating sequential processes, On the construction of programs (R.McKeag & A.M. Macnaghten, eds.), Cambridge University press, pp. 229-254.

C.A.R.HOARE (1985), Communicating sequential processes, Prentice Hall, London.

B.JONSSON & J.PARROW (1993), Deciding bisimulation equivalences for a class of non-finite-state programs, Information and Computation 107, pp. 272-302.

P.C.KANELLAKIS & S.A.SMOLKA (1990), CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86, pp. 43-68.

L.LAMPORT (1983), What good is temporal logic? Information Processing 83 (R.A.Mason, ed.), North Holland, pp. 657-668.

L.LAMPORT (1986), On interprocess communication. Part 1: Basic formalism, Distributed Computing 1 (2), pp. 77-85.

F.LAROUSSINIE, S.PINCHINAT & Ph.SCHNOEBELEN (1995), Translations between modal logics of reactive systems, TCS 140(1), pp. 53-71.

R.MILNER (1980), A calculus of communication systems, LNCS 92, Springer-Verlag.

R.MILNER (1981), A modal characterisation of observable machine-behaviour, Proceedings CAAP 81, (G.Astesiano & C.Bhm, eds.), LNCS 112, Springer-Verlag, pp. 25-34.

R.MILNER (1983), Calculi for synchrony and asynchrony, TCS 25, pp. 267-310.

R.MILNER (1985), Lectures on a calculus for communicating systems, Seminar on concurrency (S.D.Brookes, A.W.Roscoe & G.Winskel eds.), pp. 197-220, LNCS 97, Springer-Verlag.

R.MILNER (1989), Communication and concurrency, Prentice Hall, London.

E.-R. OLDEROG & C.A.R.HOARE (1986), Specification-oriented semantics for communicating processes, Acta Informatica 23, pp. 9-66.

D.M.R.PARK (1981), Concurrency and automata on infinite sequences, proc. 5th GI Conference (P.Deussen, ed.), LNCS 104, Springer-Verlag, pp. 167-183.

J.PARROW & P.SJöDIN (1992), Multiway synchronization verified with coupled simulation, proc. CONCUR '92 (W.R.Cleaveland, ed.) Stony Brook, NY, USA, LNCS 630, Springer-Verlag, pp. 518-533.

G.L.PETERSON (1881), Myths about the mutual exclusion problem, Information Processing Letters 12(3), pp. 115-116.

I.C.C.PHILLIPS (1987), Refusal testing, TCS 50, pp. 241-284.

A.PNUELI (1985), Linear and branching structures in the semantics and logics of reactive systems, proc. 12th ICALP (W.Brauer, ed.) Nafplion, Greece, LNCS 194, Springer-Verlag, pp. 15-32.

L.POMELLO (1986), Some equivalence notions for concurrent systems. An overview, Advances in Petri Nets 1985 (G.Rozenberg,ed.), LNCS 222, Springer-Verlag, pp. 381-400.

V.R.PRATT (1986), Modeling concurrency with partial orders, International Journal of Parallel Programming 15 (1), pp. 33-71.

W.C.ROUND & S.D.BROOKES (1981), Possible futures, acceptances, refusals and communicating processes, Proceedings 22nd Annual Symposium on Foundations of Computer Science, Nashville 1981, IEEE, New York, pp. 140-149.

I.ULIDOWSKI (1992), Equivalences on observable processes, proc. Seventh Annual IEEE Symposium on Logic in Computer Science (LICS '92), Santa Cruz, California, IEEE Computer Society Press, pp. 148-159.

D.J.WALKER (1990), Bisimulation and divergence, Information & Computation 85(2), pp. 202-241.

W.P.WEIJLAND (1989), Synchrony and asynchrony in process algebra, Ph.D. Thesis, University of Amsterdam.

next up previous
Up: Branching Time and Abstraction Previous: Conclusion

Rob van Glabbeek