Publications

Differential Topology:

• Good Coverings, Report nr. 3, Mathematical Institute, University of Leiden, The Netherlands 1985.

Counting:

• The third millennium starts on January 1 of the year 2001, position paper, available at http://kilby.stanford.edu/~rvg/millennium.html, December 2, 1999.
• Do we count from 0 or from 1? The ordinal use of cardinal expressions, position paper, available at http://kilby.stanford.edu/~rvg/ordinal.html, December 6, 1999.

Theoretical Computer Science:

1. Notes on the methodology of CCS and CSP, Report CS-R8624, Centre for Mathematics and Computer Science, Amsterdam 1986; Theoretical Computer Science 177(2), 1997, pp. 329-349.
2. Bounded nondeterminism and the approximation induction principle in process algebra, Report CS-R8634, Centre for Mathematics and Computer Science, Amsterdam 1986. Extended abstract in: Proceedings STACS 87, Passau, Germany 1987 (F.J. Brandenburg, G. Vidal-Naquet & M. Wirsing, eds.), LNCS 247, Springer-Verlag, 1987, pp. 336-347.
3. (with J.C.M. Baeten) Another look at abstraction in process algebra, Report CS-R8701, Centre for Mathematics and Computer Science, Amsterdam 1987. Extended abstract in: Proceedings ICALP 87, Karlsruhe, Germany 1987 (Th. Ottman, ed.), LNCS 267, Springer-Verlag, 1987, pp. 84-94.
4. (with J.C.M. Baeten) Merge and termination in process algebra, Report CS-R8716, Centre for Mathematics and Computer Science, Amsterdam 1987; in: Proceedings 7th Conference on Foundations of Software Technology & Theoretical Computer Science, Pune, India 1987 (K.V. Nori, ed.), LNCS 287, Springer-Verlag, 1987, pp. 153-172.
5. (with J.C.M. Baeten) Abstraction and empty process in process algebra, Report CS-R8721, Centre for Mathematics and Computer Science, Amsterdam 1987; Fundamenta Informaticae XII, 1989, pp. 221-242.
6. (with F.W. Vaandrager) Petri net models for algebraic theories of concurrency (extended abstract), in: Proceedings PARLE conference, Eindhoven, The Netherlands 1987, Vol. II (Parallel Languages) (J.W. de Bakker, A.J. Nijman & P.C. Treleaven, eds.), LNCS 259, Springer-Verlag, 1987, pp. 224-242.
1. Unpublished: De semantiek van eindige, sequentiële processen met interne acties, Syllabus processemantieken, deel 2. Handwritten manuscript, in Dutch.
7. (with F.W. Vaandrager) Modular specifications in process algebra - with curious queues, Report CS-R8821, Centre for Mathematics and Computer Science, Amsterdam 1988. Extended abstract in: Proceedings of the Workshop on Algebraic Methods: Theory, Tools and Applications, Passau, Germany 1987 (M. Wirsing & J.A. Bergstra, eds.), LNCS 394, Springer-Verlag, 1989, pp. 465-506.
8. (editor, with E.-R. Olderog and U. Goltz) Combining compositionality and concurrency, summary of a GMD-workshop, Königswinter 1988, Arbeitspapiere der GMD 320, Sankt Augustin, Germany 1988.
   • An operational non-interleaved process graph semantics of CCSP, abstract in: Combining Compositionality and Concurrency, summary of a GMD-workshop, Königswinter, March 1988 (E.-R Olderog, U. Goltz & R.J. van Glabbeek, eds.), Arbeitspapiere der GMD 320, Sankt Augustin, Germany 1988, pp. 18-19.
9. (with P.H. Rodenburg) An interpolation theorem in equational logic, Report CS-R8838, Centre for Mathematics and Computer Science, Amsterdam 1988.
10. (with U. Goltz) Equivalence notions for concurrent systems and refinement of actions, Arbeitspapiere der GMD 366, Sankt Augustin, Germany 1989. Extended abstract in: Proceedings 14th Symposium on Mathematical Foundations of Computer Science (MFCS), Poræbka-Kozubnik, Poland 1989 (A. Kreczmar & G. Mirkowska, eds.), LNCS 379, Springer-Verlag, 1989, pp. 237-248.
11. (with W.P. Weijland) Branching time and abstraction in bisimulation semantics (extended abstract), Report CS-R8911, Centre for Mathematics and Computer Science, Amsterdam 1989; in Information Processing 89: Proceedings of the IFIP 11th World Computer Congress, San Fransisco, USA 1989 (G.X. Ritter, ed.), Elsevier Science Publishers B.V. (North Holland), 1989, pp. 613-618.
12. (with W.P. Weijland) Refinement in branching time semantics, Report CS-R8922, Centre for Mathematics and Computer Science, Amsterdam 1989; in: J.W. de Bakker, 25 jaar semantiek, liber amicorum, Centre for Mathematics and Computer Science, Amsterdam 1989, pp. 247-252; and in: Proceedings AMAST Conference, Iowa City, USA 1989, pp. 197-201.
13. (with J.J.M.M. Rutten) The processes of De Bakker and Zucker represent bisimulation equivalence classes, in: J.W. de Bakker, 25 jaar semantiek, liber amicorum, Centre for Mathematics and Computer Science, Amsterdam 1989, pp. 243-246.
14. (with U. Goltz) Partial order semantics for refinement of actions - neither necessary nor always sufficient but appropriate when used with care -, Note CS-N8901, Centre for Mathematics and Computer Science, Amsterdam 1989; Bulletin of the EATCS 38, 1989, pp. 154-163.
15. The refinement theorem for ST-bisimulation semantics, Report CS-R9002, Centre for Mathematics and Computer Science, Amsterdam 1990; in: Proceedings IFIP Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel 1990 (M. Broy & C.B. Jones, eds.), Elsevier Science Publishers B.V. (North-Holland), 1990, pp. 27-52.
16. (with U. Goltz) Refinement of actions in causality based models, Arbeitspapiere der GMD 428, Sankt Augustin, Germany 1990; in: Proceedings REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness, Mook, The Netherlands 1989 (J.W. de Bakker, W.-P. de Roever & G. Rozenberg, eds.), LNCS 430, Springer-Verlag, 1990, pp. 267-300.
17. Comparative concurrency semantics and refinement of actions, Ph.D Thesis, Free University of Amsterdam, Centre for Mathematics and Computer Science, Amsterdam 1990. Second edition available as CWI tract 109, CWI, Amsterdam 1996.
18. (with S.A. Smolka, B. Steffen & C. Tofts) Reactive, generative, and stratified models of probabilistic processes, Report CS-R9020, Centre for Mathematics and Computer Science, Amsterdam 1990; in: Proceedings 5th Annual IEEE Symposium on Logic in Computer Science (LICS 90), Philadelphia, USA, IEEE Computer Society Press, Los Alamitos 1990, pp. 130-141.
19. The linear time - branching time spectrum, Report CS-R9029, Centre for Mathematics and Computer Science, Amsterdam 1990; and Report TUM-I9025, Technical University of Munich, Munich, Germany 1990. Extended abstract in: Proceedings CONCUR '90, Amsterdam (J.C.M. Baeten & J.W. Klop, eds.), LNCS 458, Springer-Verlag, 1990, pp. 278-297.
20. (with U. Goltz) Equivalences and refinement, Report TUM-I9024, Technical University of Munich, Munich, Germany 1990; in: Semantics of Systems of Concurrent Processes, LITP Spring School on Theoretical Computer Science, La Roche-Posay, France 1990, LNCS 469, Springer-Verlag, 1990, pp. 309-333.
21. (with U. Goltz) A deadlock-sensitive congruence for action refinement, Report TUM-I9044, Technical University of Munich, Munich, Germany 1990. Abstract in: Proceedings 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991 (E. Best & G. Rozenberg, eds.), GMD-Studien Nr. 191, Sankt Augustin, Germany 1991, pp. 113-116.
22. (with F.W. Vaandrager) Modular specification of process algebras, Report TUM-I9051, Technical University of Munich, Munich, Germany 1990; Theoretical Computer Science 113(2), 1993, pp. 293-348.
23. (with W.P. Weijland) Branching time and abstraction in bisimulation semantics, Report TUM-I9052, Technical University of Munich, Munich, Germany 1990; and Report CS-R9120, Centre for Mathematics and Computer Science, Amsterdam 1991. Updated version in the Journal of the ACM 43(3), 1996, pp. 555-600.
2. Unpublished: Bisimulations for higher dimensional automata, email message, July 7, 1991.
24. (with I. Czaja & U. Goltz) Interleaving semantics and action refinement with atomic choice, Arbeitspapiere der GMD 594, Sankt Augustin, Germany 1991; in: Advances in Petri Nets 1992 (G. Rozenberg, ed.), LNCS 609, Springer-Verlag, 1992, pp. 89-107.
25. A complete axiomatization for branching bisimulation congruence of finite-state behaviours, Report No. STAN-CS-93-1470, Department of Computer Science, Stanford University, CA 94305, USA; in: Proceedings Mathematical Foundations of Computer Science 1993 (MFCS), Gdansk, Poland, August/September 1993 (A.M. Borzyszkowski & S. Sokolowski, eds.), LNCS 711, Springer-Verlag, 1993, pp. 473-484.
26. The linear time - branching time spectrum II; the semantics of sequential processes with silent moves. Preliminary version available from Boole.stanford.edu. Extended abstract in: Proceedings CONCUR '93, Hildesheim, Germany, August 1993 (E. Best, ed.), LNCS 715, Springer-Verlag, 1993, pp. 66-81.
27. What is branching time and why to use it?, Report No. STAN-CS-93-1486, Department of Computer Science, Stanford University, CA 94305, USA; in: The Concurrency Column (M. Nielsen, ed.), Bulletin of the EATCS 53, June 1994, pp. 190-198; also in: Current Trends in Theoretical Computer Science; Entering the 21st Century (G. Paun, G. Rozenberg & A. Salomaa, eds.), World Scientific, 2001, pp. 469-479.
28. Full Abstraction in Structural Operational Semantics (extended abstract), in: Proceedings of the Third International Conference on Algebraic Methodology and Software Technology (AMAST '93), Twente, The Netherlands, June 1993, (M. Nivat, C. Rattray, T. Rus & G. Scollo, eds.), Workshops in Computing, Springer-Verlag, 1993, pp. 77-84.
29. (with N. Busi & R. Gorrieri) Axiomatising ST-bisimulation equivalence, Technical Report UBLCS-93-26, Laboratory for Computer Science, University of Bologna, 1993; available from ftp.cs.unibo.it and from Boole.stanford.edu; in Proceedings IFIP Working Conference on Programming Concepts, Methods and Calculi, San Miniato, Italy, June 1994 (E,-R. Olderog, ed.), Elsevier Science Publishers B.V. (North-Holland), 1994, pp. 169-188.
30. (with S.A. Smolka & B. Steffen) Reactive, generative and stratified models of probabilistic processes, Report No. STAN-CS-TR-94-1517, Department of Computer Science, Stanford University, CA 94305, USA; available from Boole.stanford.edu; Information and Computation 121(1), 1995, pp. 59-80.
31. On the expressiveness of ACP (extended abstract), available from Boole.stanford.edu; in: ACP94, Workshop on Algebra of Communicating Processes, Utrecht, The Netherlands, May 1994, (A. Ponse, C. Verhoef & S.F.M. van Vlijmen, eds.), Workshops in Computing, Springer-Verlag, 1994, pp. 188-217.
32. The Meaning of Negative Premises in Transition System Specifications II, Report STAN-CS-TN-95-16, Department of Computer Science, Stanford University, CA 94305, USA 1995; available from Boole.stanford.edu. Extended abstract in: Automata, Languages and Programming, Proceedings 23th International Colloquium, ICALP '96, Paderborn, Germany, July 1996 (F. Meyer auf der Heide & B. Monien, eds.), LNCS 1099, Springer, 1996, pp. 502-513.
33. (with W.J. Fokkink) Ntyft/ntyxt Rules Reduce to Ntree Rules, Report CS-R9508, CWI, Amsterdam; and Report STAN-CS-TN-95-17, Department of Computer Science, Stanford University, CA 94305, USA 1995; Information and Computation 126(1), 1996, pp. 1-10.
34. (with G.D. Plotkin) Configuration Structures (extended abstract), in: Proceedings 10th Annual IEEE Symposium on Logic in Computer Science (LICS 95), San Diego, USA, 1995 (D. Kozen, ed.), IEEE Computer Society Press, Los Alamitos 1995.
35. (with F.W. Vaandrager) The difference between splitting in n and n+1, Report CS-R9553, CWI, Amsterdam; Information and Computation 136(2), 1997, pp. 109-142. Abstract in: Proceedings 3rd Workshop on Concurrency and Compositionality, Goslar, March 5-8, 1991 (E. Best & G. Rozenberg, eds.), GMD-Studien Nr. 191, Sankt Augustin, Germany 1991, pp. 117-121.
3. Unpublished: History Preserving Process Graphs, in preparation.
36. Branching Bisimulation as a Tool in the Analysis of Weak Bisimulation, available from Boole.stanford.edu, 1995.
37. (with L. Aceto, W.J. Fokkink & A. Ingólfsdóttir) Axiomatizating prefix iteration with silent steps, BRICS report RS-95-56, Department of Computer Science, University of Aarhus, Denmark 1995; Information and Computation 127(1), 1996, pp. 26-40.
4. Abstract: Petri Nets, Configuration Structures, Propositional Theories and History Preserving Process Graphs, in: Semantics of Concurrent Systems - Foundations and Applications (M. Droste, E.-R. Olderog, B. Steffen & G. Winskel, eds.), Dagstuhl-Seminar-Report 144, Internationales Begegnungs- und Forschungszentrum für Informatik Schloss Dagstuhl, Postfach 15 11 50, D-66041 Saarbrücken, Germany 1996, pp. 14-15.
38. Axiomatizating flat iteration, Report STAN-CS-TN-97-57, Department of Computer Science, Stanford University, CA 94305, USA 1997; in: Proceedings CONCUR '97, Warsaw, Poland, July 1997 (A. Mazurkiewicz & J. Winkowski, eds.), LNCS 1243, Springer, 1997, pp. 228-242.
5. Unpublished: Unique fixed points for unguarded recursion, 1997.
6. Abstract: On the Relative Expressiveness of Petri Nets, Event Structures and Process Algebras, in: Information Systems as Reactive Systems (H.-D. Ehrich, U. Goltz & J. Meseguer, eds.), Dagstuhl-Seminar-Report 200, Internationales Begegnungs- und Forschungszentrum für Informatik Schloss Dagstuhl, Postfach 15 11 50, D-66041 Saarbrücken, Germany 1998, page 12.
39. (editor, with Atocha Aliseda and Dag Westerståhl) Computing Natural Language, CSLI Lecture Notes 81, Center for the Study of Language and Information, Stanford University, 1998.
40. (with P. Rittgen) Scheduling Algebra, Arbeitsberichte des Instituts für Wirtschaftsinformatik 12, Universität Koblenz-Landau, Germany 1998; available from Boole.stanford.edu. Updated version: Report STAN-CS-TN-98-87, Department of Computer Science, Stanford University, CA 94305, USA 1998. Slightly condensed version of the latter in: Proceedings of the Seventh International Conference on Algebraic Methodology and Software Technology (AMAST '98), Amazonia, Brazil, January 1999 (A.M. Haeberer, ed.), LNCS 1548, Springer, 1999, pp. 278-292.
41. (with U. Goltz) Refinement of Actions and Equivalence Notions for Concurrent Systems, Hildesheimer Informatik-Berichte 6/98, Universität Hildesheim, Germany 1998; Acta Informatica 37(4/5), 2001, pp. 229-327.
42. Petri Nets, Configuration Structures and Higher Dimensional Automata, in Proceedings CONCUR '99, Eindhoven, The Netherlands, August 1999 (J.C.M. Baeten & S. Mauw, eds.), LNCS 1664, Springer, 1999, pp. 21-27.
7. (with C. Palamidessi & J. Parrow) Preface to the special issue of Information and Computation dedicated to EXPRESS'97, Information and Computation 156, 2000, p. 1.
43. The linear time - branching time spectrum I; the semantics of concrete, sequential processes, in: Handbook of Process Algebra (J.A. Bergstra, A. Ponse & S.A. Smolka, eds.), Chapter 1, Elsevier, 2001, pp. 3-99.
44. (with B. Bloom & W.J. Fokkink) Precongruence Formats for Decorated Trace Preorders, in: Proceedings 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000), Santa Barbara, USA, 2000, IEEE Computer Society Press, Los Alamitos 2000, pp. 107-118.
8. In preparation: Full Abstraction in Structural Operational Semantics, 2002.
45. Bisimulation, available from Boole.stanford.edu, 2000; written to appear in the (forgotten?) Encyclopedia of Distributed Computing (J.E. Urban & P. Dasgupta, eds.), Kluwer.
46. (with U. Goltz) Well-behaved Flow Event Structures for Parallel Composition and Action Refinement, Technical report no. 2002-01, Institute of Theoretical Computer Science, TU Braunschweig, Germany 2002; Theoretical Computer Science 311, 2004, pp. 463-478.
47. (with D.G. Stork) Token-controlled place refinement in hierarchical Petri nets with application to active document workflow, in: Proceedings 23rd International Conference on Application and Theory of Petri Nets, Adelaide, Australia, June 2002 (J. Esparza & C. Lakos, eds.), LNCS 2360, Springer, 2002, pp. 394-413.
48. (with B. Bloom & W.J. Fokkink) Precongruence Formats for Decorated Trace Semantics, available from Boole.stanford.edu, 2002; Transactions on Computational Logic 5(1), 2004, pp. 26-78.
49. (with D.G. Stork) Query Nets: Interacting Workflow Modules that Ensure Global Termination, in: Proceedings International Conference on Business Process Management, BPM 2003, Eindhoven, The Netherlands, June 2003 (W.M.P. van der Aalst, A.H.M. ter Hofstede & M. Weske, eds.), LNCS 2678, Springer, 2003, pp. 184-199.
50. (with D.J.D. Hughes) Proof Nets for Unit-free Multiplicative-Additive Linear Logic (extended abstract), in: Proceedings 18th Annual IEEE Symposium on Logic in Computer Science, LICS 2003, Ottawa, Canada, June 2003, IEEE Computer Society Press, Los Alamitos 2003, pp. 1-10.
51. (with W.J. Fokkink & P. de Wind) Compositionality of Hennessy-Milner Logic through Structural Operational Semantics, in: Proceedings 14th International Symposium on Fundamentals of Computation Theory, FCT 2003, Malmö, Sweden, August 2003 (A. Lingas & B.J. Nilsson, eds.), LNCS 2751, Springer, 2003, pp. 412-422.
52. (with F.W. Vaandrager) Bundle Event Structures and CCSP, in: Proceedings 14th International Conference on Concurrency Theory, CONCUR 2003, Marseille, France, September 2003 (R. Amadio & D. Lugiez, eds.), LNCS 2761, Springer, 2003, pp. 57-71.
53. The Meaning of Negative Premises in Transition System Specifications II, Journal of Logic and Algebraic Programming 60-61, 2004, pp. 229-258.
9. Copies of slides: Liveness respecting semantics, in: Slide Reprints from the Workshop on Process Algebra: Open Problems and Future Directions, PA '03, Bologna, Italy, July 2003 (L. Aceto, Z. Ésik, W.J. Fokkink & A. Ingólfsdóttir, eds.), BRICS note NS-03-3, Department of Computer Science, University of Aarhus, Denmark, 2003, pp. 59-63.
54. (with L. Aceto, W.J. Fokkink & A. Ingólfsdóttir) Nested Semantics over Finite Trees are Equationally Hard, BRICS report RS-03-27, Department of Computer Science, University of Aarhus, Denmark, 2003; Information and Computation 191(2), 2004, pp. 203-232.
55. (with G.D. Plotkin) Event Structures for Resolvable Conflict, in: Proceedings 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Prague, Czech Republic, August 2004 (J. Fiala, V. Koubek & J. Kratochvíl, eds.), LNCS 3153, Springer, 2004, pp. 550-561.
56. On the Expressiveness of Higher Dimensional Automata (extended abstract), Electronic Notes in Theoretical Computer Science 128(2), April 2005: Proceedings of the 11th International Workshop on Expressiveness in Concurrency, EXPRESS 2004, pp. 5-34.
57. (with D.J.D. Hughes) Proof Nets for Unit-free Multiplicative-Additive Linear Logic, available from Boole.stanford.edu, January 2005; ACM Transactions on Computational Logic 6(4), pp. 784-842.
58. On Cool Congruence Formats for Weak Bisimulations (extended abstract), in: Proceedings International Colloquium on Theoretical Aspects of Computing, ICTAC05, Hanoi, Vietnam, October 2005 (D.V. Hung & M. Wirsing, eds.), LNCS 3722, Springer, 2005, pp. 318-333.
59. The Individual and Collective Token Interpretations of Petri Nets, in: Proceedings 16th International Conference on Concurrency Theory, CONCUR 2005, San Francisco, USA, August 2005 (M. Abadi & L. de Alfaro, eds.), LNCS 3653, Springer, 2005, pp. 323-337.
60. On Specifying Timeouts, in: Short Contributions from the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, PA '05, Bertinoro, Italy, August 2005 (Luca Aceto and Andrew D. Gordon, editors), BRICS Note NS-05-3, Department of Computer Science, University of Aarhus, Denmark 2005, pp. 112-113; Electronic Notes in Theoretical Computer Science 162, 2006, pp. 173-175.
61. (with W.J. Fokkink & P. de Wind) Compositionality of Hennessy-Milner Logic by Structural Operational Semantics, available from Boole.stanford.edu, June 2005; Theoretical Computer Science 354(3), April 2006, pp. 421-440.
62. (with W.J. Fokkink & P. de Wind) Divide and Congruence Applied to η-Bisimulation, Electronic Notes in Theoretical Computer Science 156(1), May 2006: Proceedings of the Second Workshop on Structural Operational Semantics, SOS 2005, Lisbon, Portugal, pp. 97-113.
63. On the Expressiveness of Higher Dimensional Automata, available from Boole.stanford.edu, 2005; Theoretical Computer Science 368(1-2), 2006, pp. 169-194.
10. Abstract: Higher-Dimensional Automata and Other Models of Concurrency, in: Preliminary Proceedings of the Workshop on Geometry and Topology in Concurrency, GETCO '05, San Francisco, USA, August 2005 (Patrick Cousot, Lisbeth Fajstrup, Eric Goubault, Maurice Herlihy, Kim G. Larsen & Martin Rauen, eds.) BRICS Note NS-05-5, Department of Computer Science, University of Aarhus, Denmark 2005, page 1.
64. (with W.J. Fokkink & P. de Wind) Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation, available from Boole.stanford.edu, 3 November 2005; in: Revised Lectures Fourth International Symposium on Formal Methods for Components and Objects, FMCO '05, Amsterdam, The Netherlands, November 2005 (F.S. de Boer, M.M. Bonsangue, S. Graf & W.-P. de Roever, eds.), LNCS 4111, Springer 2006, pp. 195-218.
65. A Characterisation of Weak Bisimulation Congruence, in: Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday (Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk & Roel de Vrijer, eds.), LNCS 3838, Springer 2005, pp. 26-39.
66. (with M. Voorhoeve) Liveness, Fairness and Impossible Futures, in: Proceedings 17th International Conference on Concurrency Theory, CONCUR 2006, Bonn, Germany, August 2006 (C. Baier & H. Hermanns, eds.) LNCS 4137, Springer, 2006, pp. 126-141.
67. (with B. Luttik & N. Trčka) Branching Bisimulation with Explicit Divergence, October 2007.
68. (with P. Mosses) Proceedings of the 3rd Workshop on Structural Operational Semantics, Bonn, Germany, 26th August 2006.
    • Preliminary proceedings (handed out at the workshop) available as pdf.
    • Post-proceedings in Electronic Notes in Theoretical Computer Science 175(1).
    • (with P. Mosses) Preface, in Electronic Notes in Theoretical Computer Science 175(1), Proceedings of the Third Workshop on Structural Operational Semantics, SOS 2006, Bonn, Germany, pp. 1-2.
69. (with Y. Deng, M. Hennessy, C.C. Morgan & C. Zhang) Remarks on Testing Probabilistic Processes, in: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin (L. Cardelli, M. Fiore and G. Winskel, eds.), Electronic Notes in Theoretical Computer Science 172, 2007, pp. 359-397.
70. (with Y. Deng, C.C. Morgan & C. Zhang) Scalar Outcomes Suffice for Finitary Probabilistic Testing, in: Proceedings 16th European Symposium on Programming, ESOP 2007, Braga, Portugal, 24 March - 1 April, 2007 (R. De Nicola, ed.), LNCS 4421, Springer, 2007, pp. 363-378.
71. (with Y. Deng, M. Hennessy, C.C. Morgan & C. Zhang) Characterising Testing Preorders for Finite Probabilistic Processes, in: Proceedings 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007, Wroclaw, Poland, July 2007, IEEE Computer Society Press, Los Alamitos 2007, pp. 313-322.
72. (with M. Hennessy) Proceedings of the 4th Workshop on Structural Operational Semantics, Wroclaw, Poland, 9 July 2007.
    • Preliminary proceedings (handed out at the workshop) available as pdf.
    • Post-proceedings in Electronic Notes in Theoretical Computer Science 192(1).
    • (with M. Hennessy) Preface, in Electronic Notes in Theoretical Computer Science 192(1), Proceedings of the Fourth Workshop on Structural Operational Semantics, SOS 2007, Wroclaw, Poland, pp. 1-3.
73. (with B. Luttik & N. Trčka) Computation Tree Logic with Deadlock Detection, January 2008.
74. (with B. Ploeger) Correcting a Space-Efficient Simulation Algorithm, January 2008.
11. (with T. Chen & W.J. Fokkink) On Finite Bases for Weak Semantics: Failures versus Impossible Futures, February 2008.