- D. Ceolin, P. Groth, V. Maccatrozzo, W.R. van Hage, W.J. Fokkink and A. Nottamkandath, Combining user reputation and provenance analysis for trust assessment,
*ACM Journal of Data and Information Quality*,**7**(1-2):6:1-6:28 (February 2016) - A. Nottamkandath, J. Oosterman, D. Ceolin, G.K.D. de Vries and W.J. Fokkink, Predicting quality of crowdsourced annotations using graph kernels, in
*Proc. 9th IFIP WG11.11 Conference on Trust Management - IFIPTM'15*, Hamburg, IFIP Advances in Information and Communication Technology**454**, pp. 134-148, Springer (May 2015) - D. Ceolin, P. Groth, A. Nottamkandath, W.J. Fokkink and W.R. van Hage, Analyzing user demographics and user behavior for trust assessment, in
*Uncertainty Reasoning for the Semantic Web III - Revised Selected Papers of URSW 2011-2013*, Lecture Notes in Artificial Intelligence**8816**, pp. 219-241, Springer (November 2014) - D. Ceolin, A. Nottamkandath and W.J. Fokkink, Bridging gaps between subjective logic and semantic Web, in
*Uncertainty Reasoning for the Semantic Web III - Revised Selected Papers of URSW 2011-2013*, Lecture Notes in Artificial Intelligence**8816**, pp. 242-264, Springer (November 2014) - D. Ceolin, W.R. van Hage, W.J. Fokkink and A.T. Schreiber, Uncertainty estimation and analysis of categorical Web data, in
*Uncertainty Reasoning for the Semantic Web III - Revised Selected Papers of URSW 2011-2013*, Lecture Notes in Artificial Intelligence**8816**, pp. 265-288, Springer (November 2014) - D. Ceolin, A. Nottamkandath, W.J. Fokkink and V. Maccatrozzo, Towards the definition of an ontology for trust in (Web) data, in
*Proc. 10th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'14*, Riva del Garda, CEUR Workshop Proceedings**1259**, pp. 73-78, CEUR-WS.org (October 2014) - A. Nottamkandath, J. Oosterman, D. Ceolin and W.J. Fokkink, Automated evaluation of crowdsourced annotations in the cultural heritage domain, in
*Proc. 10th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'14*, Riva del Garda, CEUR Workshop Proceedings**1259**, pp. 25-36, CEUR-WS.org (October 2014) - D. Ceolin, L. Moreau, K. O'Hara, W.J. Fokkink, W.R. van Hage, V. Maccatrozzo, A. Sackley, A.T. Schreiber and N. Shadbolt, Two procedures for analyzing the reliability of open government data, in
*Proc. 15th Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems - IPMU'14 - Part I*, Montpellier, Communications in Computer and Information Science**442**, pp. 15-24, Springer (July 2014) - D. Ceolin, A. Nottamkandath and W.J. Fokkink, Efficient semi-automated assessment of annotation trustworthiness,
*Journal of Trust Management***1**(1) (May 2014) special issue of*PST'13* - D. Ceolin, L. Moreau, K. O'Hara, A.T. Schreiber, A. Sackley, W.J. Fokkink, W.R. van Hage and N. Shadbolt, Reliability analyses of open government data, in
*Proc. 9th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'13*, Sydney, CEUR Workshop Proceedings**1073**, pp. 34-39, CEUR-WS.org (October 2013) - D. Ceolin, A. Nottamkandath and W.J. Fokkink, Semi-automated assessment of annotation trustworthiness, in
*Proc. 11th Conference on Privacy, Security and Trust - PST'13*, Tarragona, pp. 325-332, IEEE (July 2013) - C. Dijkshoorn, M. Leyssen, A. Nottamkandath, J. Oosterman, M. Traub, L. Aroyo, A. Bozzon, W.J. Fokkink, G.-J. Houben, H. Hovelmann, L. Jongma, J. van Ossenbruggen, A.T. Schreiber and J. Wielemaker, Personalized nichesourcing: Acquisition of qualitative annotations from niche communities, in
*Proc. 6th Workshop on Personalized Access to Cultural Heritage - PATCH'13*, Rome, CEUR Workshop Proceedings**997**, CEUR-WS.org (June 2013) - D. Ceolin, W.R. van Hage, A.T. Schreiber and W.J. Fokkink, Assessing trust for determining the reliability of information, in (P. van de Laar, J. Tretmans, M. Borth, eds)
*Situation Awareness with Systems of Systems*, pp. 209-228, Springer (February 2013) - D. Ceolin, A. Nottamkandath and W.J. Fokkink, Subjective logic extensions for the semantic web, in
*Proc. 8th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'12*, Boston, CEUR Workshop Proceedings**900**, pp. 27-38, CEUR-WS.org (November 2012) - D. Ceolin, P. Groth, W.R. van Hage, A. Nottamkandath and W.J. Fokkink, Trust evaluation through user reputation and provenance analysis, in
*Proc. 8th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'12*, Boston, CEUR Workshop Proceedings**900**, pp. 15-26, CEUR-WS.org (November 2012) - D.M. Williams, J. de Ruiter and W.J. Fokkink, Model checking under fairness in ProB and its application to fair exchange protocols, in
*Proc. 9th Colloquium on Theoretical Aspects of Computing - ICTAC'12*, Bangalore, Lecture Notes in Computer Science**7521**, pp. 168-182, Springer (September 2012) - D. Ceolin, A. Nottamkandath and W.J. Fokkink, Automated evaluation of annotators for museum collections using subjective logic, in
*Proc. 6th IFIP WG11.11 Conference on Trust Management - IFIPTM'12*, Surat, IFIP Advances in Information and Communication Technology**374**, pp. 232-239, Springer (May 2012) - D. Ceolin, W.R. van Hage, W.J. Fokkink and A.T. Schreiber, Estimating uncertainty of categorical Web data, in
*Proc. 7th Workshop on Uncertainty Reasoning for the Semantic Web - URSW'11*, Bonn, CEUR Workshop Proceedings**778**, pp. 15-26, CEUR-WS.org (October 2011) - W.J. Fokkink, M. Torabi Dashti and A.J. Wijs, Partial order reduction for branching security protocols, in
*Proc. 10th Conference on Application of Concurrency to System Design - ACSD'10*, Braga, pp. 191-200, IEEE (June 2010) - D. Ceolin, W.R. van Hage and W.J. Fokkink, A trust model to estimate the quality of annotations using the Web, in
*Proc. Web Science Conference 2010 - WebSci'10*, Raleigh, North Carolina (April 2010)

- M.J.J. Dijkstra, P. Bawono, S. Abeln, K.A. Feenstra, W.J. Fokkink and J. Heringa, Motif-Aware PRALINE: Improving the alignment of motif regions,
*PLOS Computational Biology*,**14**(11):e1006547 (November 2018) - M.J.J. Dijkstra, W.J. Fokkink, J. Heringa, E. van Dijk and S. Abeln, The characteristics of molten globule states and folding pathways strongly depend on the sequence of a protein,
*Molecular Physics*,**116**(21-22):3173-3180 (July 2018) - N. Bonzanni, K.A. Feenstra, W.J. Fokkink and J. Heringa, Petri nets are a biologist's best friend, in
*Proc. 1st Conference on Formal Methods in Macro-Biology - FMMB'14*, Noumea, Lecture Notes in Bioinformatics**8738**, pp. 102-116, Springer (September 2014) - N. Bonzanni, K.A. Feenstra, W.J. Fokkink and E. Krepska, What can formal methods bring to systems biology?, in
*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, T. 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, T. Kielmann, H.E. Bal and J. Heringa, Design issues for qualitative modelling of biological cells with Petri nets, in
*Proc. 1st Workshop on Formal Methods for Systems Biology - FMSB'08*, Cambridge, Lecture Notes in Bioinformatics**5054**, pp. 48-62, Springer (June 2008)

- M.A. Goorden, C. Dingemans, M.A. Reniers, J.M. van de Mortel-Fronczak, W.J. Fokkink and J.E. Rooda,
**Supervisory control of multilevel discrete-event systems with a bus structure**, in*Proc. 2019 European Control Conference - ECC'19*, Naples, IEEE (June 2019) To appear - L. Swartjes, M.A. Reniers and W.J. Fokkink,
**Deducing causes for the absence of states in supervised systems**, in*Proc. 6th Conference on Control, Decision and Information Technologies - CoDIT'19*, Paris, IEEE (April 2019) To appear - L. Swartjes, D.A. van Beek, W.J. Fokkink and J.A.W.M. van Eekelen, Model-based design of supervisory controllers for baggage handling systems,
*Simulation Modelling Practice and Theory*,**78**:28-50 (November 2017) - A.C. van Hulst, M.A. Reniers and W.J. Fokkink, Maximally permissive controlled system synthesis for non-determinism and modal logic,
*Discrete Event Dynamic Systems*,**27**(1):109-142 (March 2017) - L. Swartjes, M.A. Reniers, D.A. van Beek and W.J. Fokkink, Why is my supervisor empty? Finding causes for the unreachability of states in synthesized supervisors, in
*Proc. 13th Workshop on Discrete Event Systems - WODES'16*, Xi'an, pp. 14-21, IEEE (May 2016) - A.C. van Hulst, M.A. Reniers and W.J. Fokkink, Maximal synthesis for Hennessy-Milner logic,
*ACM Transactions on Embedded Computing Systems*,**14**(1) (January 2015) - A.C. van Hulst, M.A. Reniers and W.J. Fokkink, Maximally permissive controlled system synthesis for modal logic, in
*Proc. 41th Conference on Current Trends in Theory and Practice of Computer Science - SOFSEM'15 (foundations of computer science track)*, Pec pod Snezkou, Lecture Notes in Computer Science**8939**, pp. 240-241, Springer (January 2015) - A.C. van Hulst, M.A. Reniers and W.J. Fokkink, Maximal synthesis for Hennessy-Milner logic with the box modality, in
*Proc. 12th Workshop on Discrete Event Systems - WODES'14*, Cachan, pp. 278-285, IEEE (May 2014) - D.A. van Beek, W.J. Fokkink, D. Hendriks, A. Hofkamp, J. Markovski, J.M. van de Mortel-Fronczak and M.A. Reniers, CIF 3: Model-based engineering of supervisory controllers, in
*Proc. 20th Conference on Tools and Algorithms for the Construction and Analysis of Systems - TACAS'14*, Grenoble, pp. 575-580, Lecture Notes in Computer Science**8413**, Springer (April 2014) - A.C. van Hulst, M.A. Reniers and W.J. Fokkink, Maximal synthesis for Hennessy-Milner logic, in
*Proc. 13th Conference on Application of Concurrency to System Design - ACSD'13*, Barcelona, pp. 1-10, IEEE (July 2013)

- W.J. Fokkink, Distributed Algorithms: An Intuitive Approach
*(2nd edition)*, MIT Press (January 2018) - W.J. Fokkink, Distributed Algorithms: An Intuitive Approach, MIT Press (December 2013) Chinese and Russian translations will appear in December 2018
- R. Bakhshi, J. Endrullis, W.J. Fokkink and J. Pang, Fast leader election in anonymous rings with bounded expected delay,
*Information Processing Letters***111**(17):864-870 (September 2011) - E. Krepska, T. Kielmann, W.J. Fokkink and H.E. Bal, HipG: Parallel processing of large-scale graphs,
*ACM SIGOPS Operating Systems Review***45**(2):3-13 (July 2011) special issue of*ICDCN'11* - E. Krepska, T. Kielmann, W.J. Fokkink and H.E. Bal, A high-level framework for distributed processing of large-scale graphs, in
*Proc. 12th Conference on Distributed Computing and Networking - ICDCN'11 (distributed computing track)*, Bangalore, Lecture Notes in Computer Science**6522**, pp. 155-166, Springer (January 2011) - S.J.J. Vijzelaar, H. Bos and W.J. Fokkink, Brief announcement: A shared disk on distributed storage, in
*Proc. 29th Symposium on Principles of Distributed Computing - PODC'10*, Zurich, pp. 79-80, ACM (July 2010) - R. Bakhshi, J. Endrullis, W.J. Fokkink and J. Pang, Brief announcement: Asynchronous bounded expected delay networks, in
*Proc. 29th Symposium on Principles of Distributed Computing - PODC'10*, Zurich, pp. 392-393, ACM (July 2010) - R. Bakhshi, W.J. Fokkink, J. Pang and J.C. van de Pol, Leader election in anonymous rings: Franklin goes probabilistic, in
*Proc. 5th Conference on Theoretical Computer Science - IFIP TCS'08 (algorithms track)*, Milano, IFIP International Federation for Information Processing**273**, pp. 57-72, Springer (September 2008) - 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
*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)

- F. Ghassemi and W.J. Fokkink, Reliable restricted broadcast process theory,
*Fundamenta Informaticae*,**165**(1):1-41 (February 2019) - F. Ghassemi and W.J. Fokkink, Model checking mobile ad hoc networks,
*Formal Methods in System Design*,**49**(3):159-189 (December 2016) - F. Ghassemi, S. Ahmadi, W.J. Fokkink and A. Movaghar, Model checking MANETs with arbitrary mobility, in
*Proc. 5th Conference on Fundamentals of Software Engineering - FSEN'13*, Tehran, Lecture Notes in Computer Science**8161**, pp. 217-232, Springer (April 2013) - A. Shamsaie, W.J. Fokkink and J. Habibi, Analysis of gossip-based information propagation in wireless mesh networks, in
*Proc. 8th European Performance Engineering Workshop - EPEW'11*, Borrowdale, Lecture Notes in Computer Science**6977**, pp. 174-188, Springer (October 2011) - F. Ghassemi, M. Talebi, A. Movaghar and W.J. Fokkink, Stochastic restricted broadcast process theory, in
*Proc. 8th European Performance Engineering Workshop - EPEW'11*, Borrowdale, Lecture Notes in Computer Science**6977**, pp. 72-86, Springer (October 2011) - R. Bakhshi, D. Gavidia, W.J. Fokkink and M. van Steen, A modeling framework for gossip-based information spread, in
*Proc. 8th Conference on Quantitative Evaluation of SysTems - QEST'11*, Aachen, pp. 245-254, IEEE (September 2011) - F. Ghassemi, W.J. Fokkink and A. Movaghar, Verification of mobile ad hoc networks: An algebraic approach,
*Theoretical Computer Science***412**(28):3262-3282 (June 2011) - R. Bakhshi, L. Cloth, W.J. Fokkink and B. Haverkort, Mean-field framework for performance evaluation of push-pull gossip protocols,
*Performance Evaluation***68**(2):157-179 (February 2011) special issue of*QEST'09* - F. Ghassemi, W.J. Fokkink and A. Movaghar, Equational reasoning on mobile ad hoc networks,
*Fundamenta Informaticae***103**(1):1-41, November 2010 - R. Bakhshi, J. Endrullis, S. Endrullis, W.J. Fokkink and B. Haverkort, Automating the mean-field method for large dynamic gossip networks, in
*Proc. 7th Conference on Quantitative Evaluation of SysTems - QEST'10*, Williamsburg, pp. 241-250, IEEE (September 2010) - F. Ghassemi, A. Movaghar and W.J. Fokkink, Towards performance evaluation of mobile ad hoc network protocols, in
*Proc. 10th Conference on Application of Concurrency to System Design - ACSD'10*, Braga, pp. 85-92, IEEE (June 2010) - 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 (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
*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
*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
*Proc. 6th Conference on Software Engineering and Formal Methods - SEFM'08*, Cape Town, pp. 345-354, IEEE (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

- S.J.J. Vijzelaar and W.J. Fokkink, Creating Büchi automata for multi-valued model checking, in
*Proc. 37th IFIP WG 6.1 Conference on Formal Techniques for Distributed Objects, Components, and Systems - FORTE'17*, Neuchâtel, Lecture Notes in Computer Science**10321**, pp. 210-224, Springer (June 2017) - S.J.J. Vijzelaar and W.J. Fokkink, Multi-valued simulation and abstraction using lattice operations,
*ACM Transactions on Embedded Computing Systems*,**16**(2), 26 pages (January 2017) special issue of*ACSD'15* - L. Lockefeer, D.M. Williams and W.J. Fokkink, Formal specification and verification of TCP extended with the window scale option,
*Science of Computer Programming*,**118**:3-23 (January 2016) special issue of*FMICS'14* - S.J.J. Vijzelaar and W.J. Fokkink, Multi-valued abstraction using lattice operations, in
*Proc. 15th Conference on Application of Concurrency to System Design - ACSD'15*, Brussels, pp. 70-79, IEEE (June 2015) - L. Lockefeer, D.M. Williams and W.J. Fokkink, Formal specification and verification of TCP extended with the window scale option, in
*Proc. 19th Workshop on Formal Methods for Industrial Critical Systems - FMICS'14*, Florence, Lecture Notes in Computer Science**8718**, pp. 63-77, Springer (September 2014) - S. Vijzelaar, K. Verstoep, H.E. Bal and W.J. Fokkink, Bonsai: cutting models down to size, in
*Proc. 9th Andrei Ershov Memorial Conference on Perspectives of Systems Informatics - PSI'14*, St. Petersburg, Lecture Notes in Computer Science**8974**, pp. 361-375, Springer (June 2014) - D. Remenska, J. Templon, T.A.C. Willemse, H.E. Bal, K. Verstoep, W.J. Fokkink, P. Charpentier, R. Graciani Diaz, E. Lanciotti, S. Roiser and K. Ciba, Analysis of DIRAC's behavior using model checking with process algebra,
*Journal of Physics: Conference Series*,**396**(5), 10 pages (December 2012) - D. Remenska, T.A.C. Willemse, K. Verstoep, W.J. Fokkink, H.E Bal and J. Templon, Using model checking to analyze the system behavior of the LHC production grid, in
*Proc. 12th Symposium on Cluster, Cloud and Grid Computing - CCGrid'12*, Ottawa, pp. 335-343, IEEE/ACM (May 2012) - S.J.J. Vijzelaar, K. Verstoep, W.J. Fokkink and H.E. Bal, Distributed MAP in the SpinJa model checker, in
*Proc. 10th Workshop on Parallel and Distributed Methods in verifiCation - PDMC'11*, Snowbird, Electronic Proceedings in Theoretical Computer Science**72**, pp. 84-90 (July 2011) - D. Galataki, A. Radulescu, K. Verstoep and W.J. Fokkink, Embedded network protocols for mobile devices, in
*Proc. 15th Workshop on Formal Methods for Industrial Critical Systems - FMICS'10*, Antwerp, Lecture Notes in Computer Science**6371**, pp. 164-179, Springer (September 2010) - W.J. Fokkink, P. Klint, B. Lisser and Y.S. Usenko, Automated translation and analysis of a ToolBus script for auctions, in
*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, T. Kielmann and W.J. Fokkink, FTRepMI: Fault-tolerant, sequentially-consistent object replication for grid applications, in
*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
*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
*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, A. Kakebeen and J. Pang, Adapting the UPPAAL model of a distributed lift system, in
*Proc. 2nd Symposium on Fundamentals of Software Engineering - FSEN'07*, Tehran, Lecture Notes in Computer Science**4767**, pp. 81-97, Springer (August 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
*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
*The Concurrency Column*,*Bulletin of the EATCS***82**:108-125 (February 2004) - J. Pang, B. Karstens and W.J. Fokkink, Analyzing the redesign of a distributed lift system in UPPAAL, in
*Proc. 5th Conference on Formal Engineering Methods - ICFEM'03*, Singapore, Lecture Notes in Computer Science**2885**, pp. 504-522, Springer (November 2003) - W.J. Fokkink and J. Pang, Cones and foci for protocol verification revisited, in
*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
*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
*Proc. 13th Conference on Computer Aided Verification - CAV'01 (tool paper)*, Paris, Lecture Notes in Computer Science**2102**, pp. 250-254, Springer (July 2001)

- W.J. Fokkink and R.J. van Glabbeek, Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity,
*Information and Computation***257**:79-113 (December 2017) - W.J. Fokkink, R.J. van Glabbeek and S.P. Luttik, Divide and congruence III: Stability & divergence, in
*Proc. 28th Conference on Concurrency Theory - CONCUR'17*, Berlin, LIPIcs**85**, pp. 15:1-15:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (September 2017) - W.J. Fokkink and R.J. van Glabbeek, Precongruence formats with lookahead through modal decomposition, in
*Proc. 26th Conference on Computer Science Logic - CSL'17*, Stockholm, LIPIcs**82**, pp. 25:1-25:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (August 2017) - W.J. Fokkink and R.J. van Glabbeek, Divide and congruence II: Delay and weak bisimilarity, in
*Proc. 31st Symposium on Logic in Computer Science - LICS'16*, New York, pp. 778-787, IEEE Computer Society Press (July 2016) - M. Gazda and W.J. Fokkink, Turning GSOS into equations for linear time-branching time semantics,
*The Computer Journal***56**(1):34-44 (January 2013) - D. Gebler and W.J. Fokkink, Compositionality of probabilistic Hennessy-Milner logic through structural operational semantics, in
*Proc. 23rd Conference on Concurrency Theory - CONCUR'12*, Newcastle upon Tyne, Lecture Notes in Computer Science**7454**, pp. 395-409, Springer (September 2012) - W.J. Fokkink, R.J. van Glabbeek and P. de Wind, Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity,
*Information and Computation***214**:59-85 (May 2012) - M. Gazda and W.J. Fokkink, Modal logic and the approximation induction principle,
*Mathematical Structures in Computer Science***22**(1):175-201 (April 2012) special issue of*EXPRESS'09* - M. Gazda and W.J. Fokkink, Congruence from the operator's point of view: Compositionality requirements on process semantics, in
*Proc. 7th Workshop on Structural Operational Semantics - SOS'10*, Paris, Electronic Proceedings in Theoretical Computer Science**32**, pp. 15-25 (August 2010) - M. Gazda and W.J. Fokkink, Modal logic and the approximation induction principle, in
*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, R.J. van Glabbeek and P. de Wind, Divide and congruence: From decomposition of modalities to preservation of branching bisimulation, in
*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 η-bisimulation, in
*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
*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, 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, 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
*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
*Proc. 2nd Symposium on Theoretical Aspects of Computer Software - TACS'94*, Sendai, Lecture Notes in Computer Science**789**, pp. 440-453, Springer (April 1994)

- T. Chen, W.J. Fokkink and R.J. van Glabbeek, On the axiomatizability of impossible futures,
*Logical Methods in Computer Science*,**11**(3) (September 2015) - L. Aceto, W.J. Fokkink, A. Ingolfsdottir and M.R. Mousavi, Lifting non-finite axiomatizability results to extensions of process algebras,
*Acta Informatica***47**(3):147-177 (May 2010) - W.J. Fokkink, Process algebra: An algebraic theory of concurrency, in
*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
*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 - IFIP 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 (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
*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
*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
*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
*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
*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
*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
*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
*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
*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
*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
*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
*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, 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
*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
*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
*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
*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

- 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
*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
*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
*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"

- W.J. Fokkink, J.F.T. 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
*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.T. 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
*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*

- A. Fantechi, W.J. Fokkink and A. Morzenti, Some trends in formal methods applications to railway signaling, in (S. Gnesi, T. Margarita, eds)
*Formal Methods for Industrial Critical Systems: A Survey of Applications*, pp. 63-84, Wiley-IEEE (February 2013) There is a Chinese translation - W.J. Fokkink, J.F. Groote, M.J. Hollenberg and S.F.M. van Vlijmen,
*LARIS 1.0: LAnguage for Railway Interlocking Specifications*, in*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
*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
*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
*Proc. 5th Conference on Computers in Railways - COMPRAIL'96, Volume I: Railway Systems and Management*, Berlin, pp. 101-110, Computational Mechanics Publications (August 1996)

- E. Chatzikalymnios, D. Grune, W.J. Fokkink, B. Hond and P. Rutgers, Detecting useless transitions in pushdown automata,
*Information and Computation*, special issue of*LATA'17*, To appear - D. Grune, W.J. Fokkink, E. Chatzikalymnios, B. Hond and P. Rutgers, Detecting useless transitions in pushdown automata, in
*Proc. 11th Conference on Language and Automata Theory and Applications - LATA'17*, Umea, Lecture Notes in Computer Science**10168**, pp. 421-434, Springer (March 2017) - 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)

- 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)

- K.R. Apt and W.J. Fokkink, Gratis kennis voor de wereld: Wetenschappelijke uitgeverijen onder druk,
*De Groene Amsterdammer*, 47 (November 2013) In Dutch - 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
*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 - T. 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 - 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

- 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) - T. 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)

- Wan Fokkink, Tuk op de millenniumbug, in
*Liber Amicorum Jan Bergstra*, UvA (December 2016) In Dutch - 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)