Biological Systems

• N. Bonzanni, K.A. Feenstra, W.J. Fokkink and E. Krepska, What can formal methods bring to systems biology?, in (A. Cavalcanti and D. Dams, eds) Proc. 16th Symposium on Formal Methods - FM'09, Eindhoven, Lecture Notes in Computer Science 5850, pp. 16-22, Springer (November 2009)
• N. Bonzanni, E. Krepska, K.A. Feenstra, W.J. Fokkink, Th. Kielmann, H.E. Bal and J. Heringa, Executing multicellular differentiation: quantitative predictive modelling of C. elegans vulval development, Bioinformatics, 25(16):2049-2056 (August 2009) [Supplementary information]
• E. Krepska, N. Bonzanni, K.A. Feenstra, W.J. Fokkink, Th. Kielmann, H.E. Bal and J. Heringa, Design issues for qualitative modelling of biological cells with Petri nets, in (J. Fisher, ed) Proc. 1st Workshop on Formal Methods for Systems Biology - FMSB'08, Cambridge, Lecture Notes in Bioinformatics 5054, pp. 48-62, Springer (June 2008)

Gossiping and Wireless Protocols

• R. Bakhshi, L. Cloth, W.J. Fokkink and B. Haverkort, Mean-field analysis for the evaluation of gossip protocols, in Proc. 6th Conference on Quantitative Evaluation of SysTems - QEST'09, Budapest, pp. 247-256, IEEE Computer Society Press (September 2009)
• R. Bakhshi, D. Gavidia, W.J. Fokkink and M. van Steen, An analytical model of information dissemination for a gossip-based protocol, Computer Networks, 53(13):2288-2303 (August 2009) special issue on gossiping in distributed systems
• F. Ghassemi, W.J. Fokkink and A. Movaghar, Equational reasoning on ad hoc networks, in (F. Arbab and M. Sirjani, eds) Proc. 3rd Conference on Fundamentals of Software Engineering - FSEN'09, Kish Island, Lecture Notes in Computer Science 5961, pp. 113-128, Springer (April 2009)
• R. Bakhshi, D. Gavidia, W.J. Fokkink and M. van Steen, An analytical model of information dissemination for a gossip-based protocol, in (V. Garg, R. Wattenhofer and K. Kothapalli, eds) Proc. 10th Conference on Distributed Computing and Networking - ICDCN'09 (distributed computing track), Hyderabad, Lecture Notes in Computer Science 5408, pp. 230-242, Springer (January 2009)
• R. Bakhshi, L. Cloth, W.J. Fokkink and B. Haverkort, Mean-field analysis for the evaluation of gossip protocols, ACM SIGMETRICS Performance Evaluation Review, 36(3):31-39 (December 2008) special issue on quantitative analysis of gossiping protocols
• F. Ghassemi, W.J. Fokkink and A. Movaghar, Restricted broadcast process theory, in (A. Cerone and S. Gruner, eds) Proc. 6th Conference on Software Engineering and Formal Methods - SEFM'08, Cape Town, pp. 345-354, IEEE Computer Society Press (November 2008)
• R. Bakhshi, F. Bonnet, W.J. Fokkink and B. Haverkort, Formal analysis techniques for gossiping protocols, ACM SIGOPS Operating Systems Review, 41(5):28-36 (October 2007) special issue on gossip-based computer networking

Distributed Ring Algorithms

• R. Bakhshi, W.J. Fokkink, J. Pang and J.C. van de Pol, Leader election in anonymous rings: Franklin goes probabilistic, in (G. Ausiello, J. Karhumaki, G. Mauri and L. Ong, eds) Proc. 5th Conference on Theoretical Computer Science - TCS'08 (algorithms track), Milano, IFIP International Federation for Information Processing 273, pp. 57-72, Springer (September 2008)
• W.J. Fokkink, A. Kakebeen and J. Pang, Adapting the UPPAAL model of a distributed lift system, in (F. Arbab and M. Sirjani, eds) Proc. 2nd Symposium on Fundamentals of Software Engineering - FSEN'07, Tehran, Lecture Notes in Computer Science 4767, pp. 81-97, Springer (August 2007)
• W.J. Fokkink and J. Pang, Variations on Itai-Rodeh leader election for anonymous rings and their analysis in PRISM, Journal of Universal Computer Science 12(8):981-1006 (September 2006)
• W.J. Fokkink, J.-H. Hoepman and J. Pang, A note on K-state self-stabilization in a ring with K=N, Nordic Journal of Computing 12(1):18-26 (Spring 2005)
• W.J. Fokkink and J. Pang, Simplifying Itai-Rodeh leader election for anonymous rings, in (M. Huth and S. Uchitel, eds) Proc. 4th Workshop on Automated Verification of Critical Systems - AVoCS'04, London, Electronic Notes in Theoretical Computer Science 128(6):53-68, Elsevier (May 2005)
• J. Pang, B. Karstens and W.J. Fokkink, Analyzing the redesign of a distributed lift system in UPPAAL, in (J.S. Dong and J. Woodcock, eds) Proc. 5th Conference on Formal Engineering Methods - ICFEM'03, Singapore, Lecture Notes in Computer Science 2885, pp. 504-522, Springer (November 2003)

System Verification with µCRL

• W.J. Fokkink, P. Klint, B. Lisser and Y.S. Usenko, Automated translation and analysis of a ToolBus script for auctions, in (F. Arbab and M. Sirjani, eds) Proc. 3rd Symposium on Fundamentals of Software Engineering - FSEN'09, Kish Island, Lecture Notes in Computer Science 5961, pp. 308-323, Springer (April 2009)
• A. Oprescu, Th. Kielmann and W.J. Fokkink, FTRepMI: Fault-tolerant, sequentially-consistent object replication for grid applications, in (V. Garg, R. Wattenhofer and K. Kothapalli, eds) Proc. 10th Conference on Distributed Computing and Networking - ICDCN'09 (distributed computing track), Hyderabad, Lecture Notes in Computer Science 5408, pp. 368-376, Springer (January 2009) [µCRL specification]
• B. Badban, W.J. Fokkink and J.C. van de Pol, Mechanical verification of a two-way sliding window protocol, in (P.H. Welch et al.) Proc. 9th Conference on Communicating Process Architectures - CPA'08, York, Concurrent Systems Engineering Series 66, pp. 179-202, IOS Press (September 2008)
• W.J. Fokkink, P. Klint, B. Lisser and Y.S. Usenko, Towards formal verification of ToolBus scripts, in (J. Meseguer and G. Rosu, eds) Proc. 12th Conference on Algebraic Methodology And Software Technology - AMAST'08 (tool paper), Urbana, Lecture Notes in Computer Science 5140, pp. 160-166, Springer (July 2008)
• W.J. Fokkink, Modelling Distributed Systems, Texts in Theoretical Computer Science, An EATCS Series, Springer (September 2007)

• W.J. Fokkink, M. Torabi Dashti and A.J. Wijs. Partial order reduction for branching security protocols, In (R. Focardi, ed) Proc. 7th IFIP Workshop on Issues in the Theory of Security - WITS'07, Braga, pp. 178-193 (March 2007)
• J. Pang, W.J. Fokkink, R.F.H. Hofman and R. Veldema, Model checking a cache coherence protocol for a Java DSM implementation, Journal of Logic and Algebraic Programming 71(1):1-43 (March 2007)
• W.J. Fokkink, J. Pang and J.C. van de Pol, Cones and foci: A mechanical framework for protocol verification, Formal Methods in System Design 29(1):1-31 (July 2006)
• E. Bortnik, N. Trcka, A.J. Wijs, S.P. Luttik, J.M. van de Mortel-Fronczak, J.C.M. Baeten, W.J. Fokkink, and J.E. Rooda, Analyzing a χ model of a turntabel system using Spin, CADP and UPPAAL, Journal of Logic and Algebraic Programming 65(2):51-104 (November 2005)
• B. Badban, W.J. Fokkink, J.F. Groote, J. Pang and J.C. van de Pol, Verification of a sliding window protocol in µCRL and PVS, Formal Aspects of Computing 17(3):342-388 (October 2005)
• A.J. Wijs and W.J. Fokkink, From χt to µCRL: combining performance and functional analysis, in Proc. 10th Conference on Engineering of Complex Computer Systems - ICECCS'05, Shanghai, pp. 184-193, IEEE Computer Society Press (June 2005)
• W.J. Fokkink, J.F. Groote, J. Pang, B. Badban and J.C. van de Pol, Verifying a sliding window protocol in µCRL, in (C. Rattray, S. Maharaj and C. Shankland, eds) Proc. 10th Conference on Algebraic Methodology And Software Technology - AMAST'04, Stirling, Lecture Notes in Computer Science 3116, pp. 148-163, Springer (July 2004)
• W.J. Fokkink, J.F. Groote and M.A. Reniers, Process algebra needs proof methodology, in (L. Aceto, ed) The Concurrency Column, Bulletin of the EATCS 82:108-125 (February 2004)
• W.J. Fokkink and J. Pang, Cones and foci for protocol verification revisited, in (A.D. Gordon, ed) Proc. 6th Conference on Foundations of Software Science and Computation Structures - FOSSACS'03, Warsaw, Lecture Notes in Computer Science 2620, pp. 267-281, Springer (April 2003)
• J. Pang, W.J. Fokkink, R.F.H. Hofman and R. Veldema, Model checking a cache coherence protocol for a Java DSM implementation, in Proc. 8th Workshop on Formal Methods for Parallel Programming: Theory and Applications - FMPPTA'03, in conjunction with IPDPS'03, Nice, IEEE Computer Society Press (April 2003)
• W.J. Fokkink, N.Y. Ioustinova, E. Kesseler, J.C. van de Pol, Y.S. Usenko and Y.A. Yushtein, Refinement and verification applied to an in-flight data acquisition unit, in (L. Brim, P. Jancar, M. Kretinsky and A. Kucera, eds) Proc. 13th Conference on Concurrency Theory - CONCUR'02, Brno, Lecture Notes in Computer Science 2421, pp. 1-23, Springer (August 2002)
• S.C.C. Blom, W.J. Fokkink, J.F. Groote, I.A. van Langevelde, B. Lisser and J.C. van de Pol, µCRL: a toolset for analysing algebraic specifications, in (G. Berry, H. Comon and A. Finkel, eds) Proc. 13th Conference on Computer Aided Verification - CAV'01 (tool paper), Paris, Lecture Notes in Computer Science 2102, pp. 250-254, Springer (July 2001)

Term Rewriting

• W.J. Fokkink, J.F.Th. Kamperman and H.R. Walters, Lazy rewriting on eager machinery, ACM Transactions on Programming Languages and Systems 22(1):45-86 (January 2000)
• W.J. Fokkink and C. Verhoef, Conservative extension in positive/negative conditional term rewriting with applications to software renovation factories, in (J.-P. Finance, ed) Proc. 2nd Conference on Fundamental Approaches to Software Engineering - FASE'99, Amsterdam, Lecture Notes in Computer Science 1577, pp. 98-113, Springer (March 1999)
• W.J. Fokkink, J.F.Th. Kamperman and H.R. Walters, Within ARM's reach: compilation of left-linear rewrite systems via minimal rewrite systems, ACM Transactions on Programming Languages and Systems 20(3):679-706 (May 1998)
• W.J. Fokkink and J.C. van de Pol, Simulation as a correct transformation of rewrite systems, in (I. Privara and P. Ruzicka, eds) Proc. 22nd Symposium on Mathematical Foundations of Computer Science - MFCS'97, Bratislava, Lecture Notes in Computer Science 1295, pp. 249-258, Springer (August 1997)
• W.J. Fokkink and H. Zantema, Termination modulo equations by abstract commutation with an application to iteration, Theoretical Computer Science 177(2):407-423 (May 1997) special issue of ACP'95

Structural Operational Semantics

• W.J. Fokkink, R.J. van Glabbeek and P. de Wind, Divide and congruence: from decomposition of modalities to preservation of branching bisimulation, in (F.S. de Boer, M.M. Bonsangue, S. Graf and W.P. de Roever, eds) Proc. 4th Symposium on Formal Methods for Components and Objects - FMCO'05, Amsterdam, Lecture Notes in Computer Science 4111, pp. 195-218, Springer (October 2006)
• W.J. Fokkink, R.J. van Glabbeek and P. de Wind, Divide and congruence applied to eta-bisimulation, in (P.D. Mosses and I. Ulidowski, eds) Proc. 2nd Workshop on Structural Operational Semantics - SOS'05, Lisbon, Electronic Notes in Theoretical Computer Science 156(1):97-113, Elsevier (May 2006)
• W.J. Fokkink, R.J. van Glabbeek and P. de Wind, Compositionality of Hennessy-Milner logic by structural operational semantics, Theoretical Computer Science 354(3):421-440 (April 2006) special issue of FCT'03
• B. Bloom, W.J. Fokkink and R.J. van Glabbeek, Precongruence formats for decorated trace semantics, ACM Transactions on Computational Logic 5(1):26-78 (January 2004)
• W.J. Fokkink, R.J. van Glabbeek and P. de Wind, Compositionality of Hennessy-Milner logic through structural operational semantics, in (A. Lingas and B.J. Nilsson, eds) Proc. 14th Symposium on Fundamentals of Computation Theory - FCT'03, Malmo, Lecture Notes in Computer Science 2751, pp. 412-422, Springer (August 2003)
• W.J. Fokkink and T.D. Vu, Structural operational semantics and bounded nondeterminism, Acta Informatica 39(6/7):501-516 (June 2003)
• L. Aceto, W.J. Fokkink and C. Verhoef, Conservative extension in structural operational semantics, in (G. Paun, G. Rozenberg and A. Salomaa, eds) Current Trends in Theoretical Computer Science - Entering the 21st Century, pp. 504-524, World Scientific (March 2001)
• L. Aceto, W.J. Fokkink and C. Verhoef, Structural operational semantics, in (J.A. Bergstra, A. Ponse and S.A. Smolka, eds) Handbook of Process Algebra, pp. 197-292, Elsevier (February 2001)
• W.J. Fokkink, Language preorder as a precongruence, Theoretical Computer Science 243(1/2):391-408 (July 2000)
• B. Bloom, W.J. Fokkink and R.J. van Glabbeek, Precongruence formats for decorated trace preorders, in Proc. 15th Symposium on Logic in Computer Science - LICS'00, Santa Barbara, pp. 107-118, IEEE Computer Society Press (June 2000)
• W.J. Fokkink, Rooted branching bisimulation as a congruence, Journal of Computer and System Sciences 60(1):13-37 (February 2000)
• L. Aceto, W.J. Fokkink and C. Verhoef, Conservative extension in structural operational semantics, in (M. Nielsen, ed) The Concurrency Column, Bulletin of the EATCS 69:110-132 (October 1999)
• W.J. Fokkink and C. Verhoef, A conservative look at operational semantics with variable binding, Information and Computation 146(1):24-54 (October 1998)
• W.J. Fokkink and R.J. van Glabbeek, Ntyft/ntyxt rules reduce to ntree rules, Information and Computation 126(1):1-10 (April 1996)
• W.J. Fokkink, The tyft/tyxt format reduces to tree rules, in (M. Hagiya and J.C. Mitchell, eds) Proc. 2nd Symposium on Theoretical Aspects of Computer Software - TACS'94, Sendai, Lecture Notes in Computer Science 789, pp. 440-453, Springer (April 1994)

Process Algebra

• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and M.R. Mousavi, Lifting non-finite axiomatizability results to extensions of process algebras, Acta Informatica, To appear
• M. Gazda and W.J. Fokkink, Modal logic and the approximation induction principle, in (D. Gorla and S. Froschle, eds) Proc. 16th Workshop on Expressiveness in Concurrency - EXPRESS'09, Bologna, Electronic Proceedings in Theoretical Computer Science 8, pp. 41-50 (September 2009)
• W.J. Fokkink, Process algebra: An algebraic theory of concurrency, in (S. Bozapalidis and G. Rahonis, eds) Proc. 3rd Conference on Algebraic Informatics - CAI'09, Thessaloniki, Lecture Notes in Computer Science 5725, pp. 47-77, Springer (May 2009)
• T. Chen, W.J. Fokkink and R.J. van Glabbeek, On finite bases for weak semantics: failures versus impossible futures, in (M. Nielsen, A. Kucera, P.B. Miltersen, C. Palamidessi. P. Tuma and F. Valencia, eds) Proc. 35th Conference on Current Trends in Theory and Practice of Computer Science - SOFSEM'09 (foundations of computer science track), Spindleruv Mlyn, Lecture Notes in Computer Science 5404, pp. 167-180, Springer (January 2009)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S.P. Luttik, A finite equational base for CCS with left merge and communication merge, ACM Transactions on Computational Logic, 10(1) (January 2009)
• T. Chen, W.J. Fokkink and R.J. van Glabbeek, Ready to preorder: the case of weak process semantics, Information Processing Letters, 109(2):104-111 (December 2008)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, A cancellation theorem for BCCSP, Fundamenta Informaticae, 88(1/2):1-21 (November 2008)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and M.R. Mousavi, Lifting non-finite axiomatizability results to extensions of process algebras, in Proc. 5th Conference on Theoretical Computer Science - TCS'08 (logic and semantics track), Milano, IFIP International Federation for Information Processing 273, pp. 301-316, Springer (September 2008)
• T. Chen and W.J. Fokkink, On the axiomatizability of impossible futures: preorder versus equivalence, in Proc. 23rd Symposium on Logic in Computer Science - LICS'08, Pittsburgh, pp. 156-165, IEEE Computer Society Press (June 2008)
• T. Chen, W.J. Fokkink, S.P. Luttik and S. Nain, On finite alphabets and infinite bases, Information and Computation 206(5):492-519 (May 2008) special issue of CONCUR'06
• L. Aceto, T. Chen, W.J. Fokkink and A. Ingolfsdottir, On the axiomatizability of priority, Mathematical Structures in Computer Science, 18(1):5-28 (February 2008)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, Ready to preorder: get your BCCSP axiomatization for free!, in (T. Mossakowski, U. Montanari, and M. Haveraaen, eds) Proc. 2nd Conference on Algebra and Coalgebra in Computer Science - CALCO'07, Bergen, Lecture Notes in Computer Science 4624, pp. 65-79, Springer (August 2007)
• W.J. Fokkink and J.W. Klop, Computing with actions and communications, Proc. Joint BeNeLuxFra Conference on Mathematics, Gent, Bulletin of the Belgian Mathematical Society - Simon Stevin, 13(5):789--805 (December 2006)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S. Nain, Bisimilarity is not finitely based over BPA with interrupt, Theoretical Computer Science 366(1/2):60-81 (November 2006) special issue of CALCO'05
• L. Aceto and W.J. Fokkink, The quest for equational axiomatizations of parallel composition: Status and open problems, in (L. Aceto and A.D. Gordon, eds) Proc. Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, Bertinoro, Electronic Notes in Theoretical Computer Science 162:43-48, Elsevier (September 2006)
• T. Chen and W.J. Fokkink, On finite alphabets and infinite bases III: Simulation, in (C. Baier and H. Hermanns, eds) Proc. 17th Conference on Concurrency Theory - CONCUR'06, Bonn, Lecture Notes in Computer Science 4137, pp. 421-434, Springer (August 2006)
• L. Aceto, T. Chen, W.J. Fokkink and A. Ingolfsdottir, On the axiomatizability of priority, in (M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, eds) Proc. 33rd Colloquium on Automata, Languages and Programming - ICALP'06 (logic and semantics track), Venice, Lecture Notes in Computer Science 4052, pp. 480-491, Springer (July 2006)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S.P. Luttik, A finite equational base for CCS with left merge and communication merge, in (M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, eds) Proc. 33rd Colloquium on Automata, Languages and Programming - ICALP'06 (logic and semantics track), Venice, Lecture Notes in Computer Science 4052, pp. 492-503, Springer (July 2006)
• T. Chen, W.J. Fokkink and S. Nain, On finite alphabets and infinite bases II: Completed and ready simulation, in (L. Aceto and A. Ingolfsdottir, eds) Proc. 9th Conference on Foundations of Software Science and Computation Structures - FOSSACS'06, Vienna, Lecture Notes in Computer Science 3921, pp. 1-15, Springer (March 2006)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S.P. Luttik, Finite equational bases in process algebra: Results and open questions, in (A. Middeldorp, V. van Oostrom, F. van Raamsdonk and R. de Vrijer, eds) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, Amsterdam, Lecture Notes in Computer Science 3838, pp. 338-367, Springer (December 2005)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S. Nain, Bisimilarity is not finitely based over BPA with interrupt, in (J.L. Fiadeiro, N. Harman, M. Roggenbach, and J. Rutten, eds) Proc. 1st Conference on Algebra and Coalgebra in Computer Science - CALCO'05, Swansea, Lecture Notes in Computer Science 3629, pp. 52-66, Springer (September 2005)
• W.J. Fokkink and S. Nain, A finite basis for failure semantics, in (L. Caires, G.F. Italiano, L. Monteiro, C. Palamidessi, and M. Yung, eds) Proc. 32nd Colloquium on Automata, Languages and Programming - ICALP'05 (logic and semantics track), Lisbon, Lecture Notes in Computer Science 3580, pp. 755-765, Springer (July 2005)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S.P. Luttik, Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge, Logical Methods in Computer Science 1(1:3), 12 pages (March 2005)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and S.P. Luttik, CCS with Hennessy's merge has no finite equational axiomatization, Theoretical Computer Science 333(3):377-405 (February 2005) special issue of EXPRESS'03
• L. Aceto, W.J. Fokkink, R.J. van Glabbeek and A. Ingolfsdottir, Nested semantics over finite trees are equationally hard, Information and Computation 191(2):203-232 (June 2004)
• W.J. Fokkink and S. Nain, On finite alphabets and infinite bases: from ready pairs to possible worlds, in (I. Walukiewicz, ed) Proc. 7th Conference on Foundations of Software Science and Computation Structures - FOSSACS'04, Barcelona, Lecture Notes in Computer Science 2987, pp. 182-194, Springer (March 2004)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, A note on an expressiveness hierarchy for multi-exit iteration, Information Processing Letters 87(1):17-23 (July 2003)
• S.C.C. Blom, W.J. Fokkink and S. Nain, On the axiomatizability of ready traces, ready simulation and failure traces, in (J.C.M. Baeten, J.K. Lenstra, J. Parrow and G.J. Woeginger, eds) Proc. 30th Colloquium on Automata, Languages and Programming - ICALP'03 (logic and semantics track), Eindhoven, Lecture Notes in Computer Science 2719, pp. 109-118, Springer (June 2003)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, 2-nested simulation is not finitely equationally axiomatizable, in (A. Ferreira and H. Reichel, eds) Proc. 18th Symposium on Theoretical Aspects of Computer Science - STACS'01, Dresden, Lecture Notes in Computer Science 2010, pp. 39-50, Springer (February 2001)
• J.A. Bergstra, W.J. Fokkink and A. Ponse, Process algebra with recursive operations, in (J.A. Bergstra, A. Ponse and S.A. Smolka, eds) Handbook of Process Algebra, pp. 333-389, Elsevier (February 2001)
• W.J. Fokkink and S.P. Luttik, An omega-complete equational specification of interleaving, in (U. Montanari, J.D.P. Rolim and E. Welzl, eds) Proc. 27th Colloquium on Automata, Languages and Programming - ICALP'00 (logic and semantics track), Geneva, Lecture Notes in Computer Science 1853, pp. 729-743, Springer (July 2000)
• W.J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, An EATCS Series, Springer (January 2000)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, On a question of A. Salomaa: the equational theory of regular expressions over a singleton alphabet is not finitely based, Theoretical Computer Science 209(1/2):163-178 (December 1998)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, A menagerie of non-finitely based process semantics over BPA*: from ready simulation to completed traces, Mathematical Structures in Computer Science 8(3):193-230 (June 1998)
• L. Aceto, W.J. Fokkink and A. Ingolfsdottir, A Cook's tour of equational axiomatizations for prefix iteration, in (M. Nivat, ed) Proc. 1st Conference on Foundations of Software Science and Computation Structures - FOSSACS'98, Lisbon, Lecture Notes in Computer Science 1378, pp. 20-34, Springer (April 1998)
• L. Aceto and W.J. Fokkink, An equational axiomatization for multi-exit iteration, Information and Computation 137(2):121-158 (September 1997)
• W.J. Fokkink, Axiomatizations for the perpetual loop in process algebra, in (P. Degano, R. Gorrieri and A. Marchetti-Spaccamela, eds) Proc. 24th Colloquium on Automata, Languages and Programming - ICALP'97 (logic and semantics track), Bologna, Lecture Notes in Computer Science 1256, pp. 571-581, Springer (July 1997)
• W.J. Fokkink, On the completeness of the equations for the Kleene star in bisimulation, in (M. Wirsing and M. Nivat, eds) Proc. 5th Conference on Algebraic Methodology and Software Technology - AMAST'96, Munich, Lecture Notes in Computer Science 1101, pp. 180-194, Springer (July 1996)
• L. Aceto, W.J. Fokkink, R.J. van Glabbeek and A. Ingolfsdottir, Axiomatizing prefix iteration with silent steps, Information and Computation 127(1):26-40 (May 1996)
• W.J. Fokkink, A complete axiomatization for prefix iteration in branching bisimulation, Fundamenta Informaticae 26(2):103-113 (May 1996)
• W.J. Fokkink, A complete equational axiomatization for prefix iteration, Information Processing Letters 52(6):333-337 (December 1994)
• W.J. Fokkink and H. Zantema, Basic process algebra with iteration: completeness of its equational axioms, Computer Journal 37(4):259-267 (April 1994) special issue on Process Algebra

Timed Systems

• W.J. Fokkink, J. Pang and A.J. Wijs, Is timed branching bisimilarity a congruence indeed?, Fundamenta Informaticae 87(3/4):287-311 (September 2008)
• W.J. Fokkink and J. Pang, Formal verification of timed systems using cones and foci, in (I. Ulidowski, ed) Proc. 6th Workshop on Real-Time Systems - ARTS'04, Stirling, Electronic Notes in Theoretical Computer Science 139(1):105-122, Elsevier (November 2005)
• W.J. Fokkink, J. Pang and A.J. Wijs, Is timed branching bisimilarity an equivalence indeed?, in (P. Petterson and W. Yi, eds) Proc. 3rd Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'05), Uppsala, Lecture Notes in Computer Science 3829, pp. 258-272, Springer (September 2005)
• W.J. Fokkink, An axiomatization for regular processes in timed branching bisimulation, Fundamenta Informaticae 32(3/4):329-340 (December 1997)
• J.A. Bergstra, W.J. Fokkink and C.A. Middelburg, Algebra of timed frames, Journal of Computer Mathematics 61(3/4):227-255 (April 1996)
• W.J. Fokkink and A.S. Klusener, An effective axiomatization for real time ACP, Information and Computation 122(2):286-299 (November 1995)
• W.J. Fokkink, An elimination theorem for regular behaviours with integration, in (E. Best, ed) Proc. 4th Conference on Concurrency Theory - CONCUR'93, Hildesheim, Lecture Notes in Computer Science 715, pp. 432-446, Springer (August 1993) Kim Larsen writes in One 2 Many 2 One: Evolution of Timed Systems Modeling and Analysis that this paper "highly influenced the tool EPSILON, a pre-runner for UPPAAL"

Mathematics

• W.J. Fokkink, J.C. van de Pol and S. Vijay, Which two-sorted algebras of Booleans and naturals have a finite basis?, Algebra Universalis 52(4):469-485 (February 2005)
• W.J. Fokkink, Unification for infinite sets of equations between finite terms, Information Processing Letters 62(4):183-188 (May 1997)
• Z.B. Wang, R.J. Fokkink and W.J. Fokkink, A relation between partitions and the number of divisors, American Mathematical Monthly 102(4):345-347 (April 1995)
• R.J. Fokkink, W.J. Fokkink and J. van de Lune, Fast computation of an alternating sum, Nieuw Archief voor Wiskunde 12(1/2):13-18 (March/July 1994)

Railway Interlockings

• W.J. Fokkink, J.F. Groote, M.J. Hollenberg and S.F.M. van Vlijmen, LARIS 1.0: LAnguage for Railway Interlocking Specifications, in (A.M.H. Gerards, M. Hazewinkel, J.W. Klop and N.M. Temme, eds) CWI Publications Miscellaneous, Stichting Mathematisch Centrum (February 2000)
• F.J. van Dijk, W.J. Fokkink, G.P. Kolk, P.H.J. van de Ven and S.F.M. van Vlijmen, EURIS, a specification method for distributed interlockings, in (W. Ehrenberger, ed) Proc. 17th Conference on Computer Safety, Reliability and Security - SAFECOMP'98, Heidelberg, Lecture Notes in Computer Science 1516, pp. 296-305, Springer (October 1998)
• W.J. Fokkink and P.R. Hollingshead, Verification of interlockings: from control tables to ladder logic diagrams, in (J.F. Groote, S.P. Luttik and J.J. van Wamel, eds) Proc. 3rd Workshop on Formal Methods for Industrial Critical Systems - FMICS'98, Amsterdam, pp. 171-185, Stichting Mathematisch Centrum (May 1998)
• J.A. Bergstra, W.J. Fokkink, W.M.T. Mennen and S.F.M. van Vlijmen, Spoorweglogica via EURIS, Quaestiones Infinitae XXII, Zeno Institute of Philosophy (October 1997) In Dutch
• W.J. Fokkink, Safety criteria for the vital processor interlocking at Hoorn-Kersenboogerd, in (J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto and S. Sone, eds) Proc. 5th Conference on Computers in Railways - COMPRAIL'96, Volume I: Railway Systems and Management, Berlin, pp. 101-110, Computational Mechanics Publications (August 1996)

Theses

• W.J. Fokkink, Clocks, Trees and Stars in Process Theory, PhD thesis, University of Amsterdam, Dissertation Series DS-1994-09, Institute for Logic, Language and Computation (December 1994) Hard copies available on request
• W.J. Fokkink, Lifschitz Stratifications of Analytic Sets, MSc thesis, University of Amsterdam (August 1990)

Technical Reports

• Y.A. Yushtein, E. Kesseler, W.J. Fokkink, J.C. van de Pol, Y.S. Usenko and N.Y. Yustinova, KTVFM study on relevance of formal methods for the Royal Netherlands Navy, Report CR-2002-492, National Aerospace Laboratory, Amsterdam (2002)
• J.A. Bergstra, W.J. Fokkink and C.A. Middelburg, A logic for signal-inserted timed frames, Logic Group Preprint Series 155, Utrecht University, Utrecht (1996)
• C. Bonini, W.J. Fokkink and A. Lesch, A reference model for teleconferencing systems, Report CS-R9502, CWI, Amsterdam (1995)
• W.J. Fokkink and J.J. van Wamel, An algebraic specification of interest products, Report CR-9201, University of Amsterdam, Amsterdam (1992) Confidential
• W.J. Fokkink, Checking the equations for the mathematical representation of A-CRL, SPECS Working Paper A5.16.3 (1992)
• W.J. Fokkink, A simple specification language combining processes, time and data, Report CS-R9209, CWI, Amsterdam (1992)

Exposure

• L. Aceto, J.C.M. Baeten, W.J. Fokkink, A. Ingolfsdottir and U. Nestmann, Applying concurrency research in industry - report on a strategic workshop, in (L. Aceto, ed) The Concurrency Column, Bulletin of the EATCS 94:113-129 (February 2008)
• W.J. Fokkink and W. Hendriksen, Heldere kijk op het ontwerp van embedded systemen, Bits & Chips (May 2005) In Dutch
• W.J. Fokkink, M. Karki, J.C. van de Pol, A. Rennoch, I. Schieferdecker and M. Sihvonen, Three countries' offensive towards testing with advanced languages, ERCIM News 58 (July 2004) special issue on Automated Software Engineering
• W.J. Fokkink, H. Garavel and J.C. van de Pol, CWI and INRIA join forces on safety-critical systems, ERCIM News 58 (July 2004) special issue on Automated Software Engineering
• Th. Arts and W.J. Fokkink, 8th Workshop on Formal Methods for Industrial Critical Systems, ERCIM News 54 (July 2003) special issue on Applications and Service Platforms for the Mobile User
• W.J. Fokkink and I.A. van Langevelde, Firm foundations for telecom standards, CWI Annual Report 2002, pp. 26-27 (July 2003)
• H. Eertink, W.J. Fokkink, I.A. van Langevelde and H. Hermanns, The Systems Validation Centre in retrospect, Nieuwsbrief voor de Nederlandse Vereniging voor Theoretische Informatica 7:33-37 (February 2003)
• H. Eertink, W.J. Fokkink, I.A. van Langevelde and H. Hermanns, Systems Validation Centre shows benefits of formal methods, ERCIM News 52 (January 2003) special issue on Embedded Systems
• W.J. Fokkink, I.A. van Langevelde, S.P. Luttik and Y.S. Usenko, How can I be sure that my DVD player understands my TV?, ERCIM News 47 (October 2001) special issue on Ambient Intelligence

Editorials

• L. Aceto, J.C.M. Baeten, W.J. Fokkink, A. Ingolfsdottir and U. Nestmann, Special issue of the IFIP WG1.8 Workshop on Applying Concurrency Research in Industry, Journal of Logic and Algebraic Programming, 78(4) (April 2009)
• L. Aceto, M. Bravetti, W.J. Fokkink and A.D. Gordon, Special issue of the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, Part III, Journal of Logic and Algebraic Programming, 75(1) (February-March 2008)
• L. Aceto, M. Bravetti, W.J. Fokkink and A.D. Gordon, Special issue of the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, Part II, Journal of Logic and Algebraic Programming, 72(1) (June 2007)
• L. Aceto, M. Bravetti, W.J. Fokkink and A.D. Gordon, Special issue of the Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond, Part I, Journal of Logic and Algebraic Programming, 70(2) (February 2007)
• L. Aceto, W.J. Fokkink, A. Ingolfsdottir and Z. Esik, Special issue of the Workshop on Process Algebra: Open Questions and Future Directions, Theoretical Computer Science 335(2/3) (May 2005)
• L. Aceto, W.J. Fokkink and I. Ulidowski, Proc. 1st Workshop on Structural Operational Semantics- SOS'05, Electronic Notes in Theoretical Computer Science 128(1), Elsevier (May 2005)
• L. Aceto and W.J. Fokkink, Special issue on Structural Operational Semantics, Journal of Logic and Algebraic Programming 60-61 (July-December 2004)
• Th. Arts and W.J. Fokkink, Proc. 8th Workshop on Formal Methods for Industrial Critical Systems- FMICS'03, Electronic Notes in Theoretical Computer Science 80, Elsevier (August 2003)
• L. Aceto and W.J. Fokkink, Special issue on Process Algebra, Information Processing Letters 80(1) (October 2001)

Liber Amicori

• Wan Fokkink, A Roel-based expert system, in Liber Amicorum Roel de Vrijer, VU (September 2009)
• Wan Fokkink, Chris Temme, Dirk Temme and Riet Temme, Haring in tomatensaus, in Liber Amicorum Nico Temme, CWI (May 2005) In Dutch
• Wan Fokkink and Judi Romijn, Meetlat Mieke, in Liber Amicorum Mieke Brune, CWI (May 2005) In Dutch
• Wan Fokkink, Prof. de Bakker, or how I learned to stop worrying and love the boss, in Liber Amicorum Jaco de Bakker, CWI (August 2002)