Wan Fokkink

Research Interests: protocol verification, safety critical systems, testing, security, process algebra, structural operational semantics, model checking, term rewriting. Address: CWI Department of Software Engineering SEN2 (Specification and Analysis of Embedded Systems) Kruislaan 413, 1098 SJ Amsterdam, The Netherlands Room: M342 Tel.: +31 20 592 4104 Fax: +31 20 592 4199 Email: wan@cwi.nl

• One day a week I work at the Department of Theoretical Computer Science at the Vrije Universiteit Amsterdam (room: U334, tel: +31 20 444 7736, email: wanf@cs.vu.nl)
• More about Wan Fokkink

Some Professional Activities

• Guest editor of a special issue of the Journal of Logic and Algebraic Programming on structural operational semantics (with Luca Aceto), submission deadline: March 2, 2003
• Program chair of FMICS'2003 (with Thomas Arts)
• Program committee member of the 8th Dutch Testing Day
• Organisation of the Workshop on Process Algebra: Open Problems and Future Directions in Bertinoro, Italy, July 21-25, 2003 (with Luca Aceto, Zoltan Ésik and Anna Ingólfsdóttir)
• Project manager of the Systems Validation Centre
• Project leader of a project on Improving the quality of embedded systems by formal design and systematic testing
• Coordinator of the CWI Security Platform
• Steering committee member of SAFE-NL

Further Links

• Our group has a lively weekly seminar

Course Material

• Protocol Validation: This course is based on the µCRL tool set
• Process Algebra: This course is based on

  W.J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag, 2000

• Formal Languages (in Dutch): This course is based on

  P. Linz, An Introduction to Formal Languages (3rd edition), Jones and Bartlett, 2001

• Logic Programming: This course is based on

  I. Bratko, PROLOG Programming for Artificial Intelligence (3rd edition), Addison-Wesley, 2000

Publications

1. B. Bloom, W.J. Fokkink and R.J. van Glabbeek, Precongruence formats for decorated trace semantics, ACM Transactions on Computational Logic, To appear
2. 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'2002, Brno, Lecture Notes in Computer Science 2421, pp. 1-23, Springer-Verlag (August 2002)
3. 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:34-35 (October 2001), Special issue on ambient intelligence
4. L. Aceto and W.J. Fokkink, Preface, Information Processing Letters, 80(1):1 (October 2001), Special issue on process algebra
5. 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'2001, Paris, Lecture Notes in Computer Science 2102, pp. 250-254, Springer-Verlag (July 2001)
6. 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)
7. 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)
8. 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)
9. L. Aceto, W.J. Fokkink and A. Ingólfsdóttir, 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'2001, Dresden, Lecture Notes in Computer Science 2010, pp. 39-50, Springer-Verlag (February 2001)
10. W.J. Fokkink, Language preorder as a precongruence, Theoretical Computer Science 243(1/2):391-408 (July 2000)
11. 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'2000, Geneva, Lecture Notes in Computer Science 1853, pp. 729-743, Springer-Verlag (July 2000)
12. 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'2000, Santa Barbara, pp. 107-118, IEEE Computer Society Press (June 2000)
13. W.J. Fokkink, Rooted branching bisimulation as a congruence, Journal of Computer and System Sciences 60(1):13-37 (February 2000)
14. 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)
15. 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)
16. W.J. Fokkink, Introduction to Process Algebra, Texts in Theoretical Computer Science, An EATCS Series, Springer-Verlag (January 2000)
17. 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)
18. 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-Verlag (March 1999)
19. L. Aceto, W.J. Fokkink and A. Ingólfsdóttir, 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)
20. W.J. Fokkink and C. Verhoef, A conservative look at operational semantics with variable binding, Information and Computation 146(1):24-54 (October 1998)
21. 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-Verlag (October 1998)
22. L. Aceto, W.J. Fokkink and A. Ingólfsdóttir, 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)
23. 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)
24. 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)
25. L. Aceto, W.J. Fokkink and A. Ingólfsdóttir, 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-Verlag (April 1998)
26. W.J. Fokkink, An axiomatization for regular processes in timed branching bisimulation, Fundamenta Informaticae 32(3/4):329-340 (December 1997)
27. 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
28. L. Aceto and W.J. Fokkink, An equational axiomatization for multi-exit iteration, Information and Computation 137(2):121-158 (September 1997)
29. 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-Verlag (August 1997)
30. 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, Bologna, Lecture Notes in Computer Science 1256, pp. 571-581, Springer-Verlag (July 1997)
31. W.J. Fokkink, Unification for infinite sets of equations between finite terms, Information Processing Letters 62(4):183-188 (May 1997)
32. 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)
33. 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)
34. 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-Verlag (July 1996)
35. L. Aceto, W.J. Fokkink, R.J. van Glabbeek and A. Ingólfsdóttir, Axiomatizing prefix iteration with silent steps, Information and Computation 127(1):26-40 (May 1996)
36. W.J. Fokkink, A complete axiomatization for prefix iteration in branching bisimulation, Fundamenta Informaticae 26(2):103-113 (May 1996)
37. W.J. Fokkink and R.J. van Glabbeek, Ntyft/ntyxt rules reduce to ntree rules, Information and Computation 126(1):1-10 (April 1996)
38. 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)
39. L. Aceto, W.J. Fokkink, R.J. van Glabbeek and A. Ingólfsdóttir, Axiomatizing prefix iteration with silent steps, in (B. Bjorner, M. Larsson and B. Nordström, eds) Proc. 7th Nordic Workshop on Programming Theory, Göteborg, Programming Methodology Group Report 86, pp. 26-46, Chalmers University of Technology (January 1996)
40. W.J. Fokkink and A.S. Klusener, An effective axiomatization for real time ACP, Information and Computation 122(2):286-299 (November 1995)
41. W.J. Fokkink and H. Zantema, Prefix iteration in basic process algebra: applying termination techniques, in (A. Ponse, C. Verhoef and S.F.M. van Vlijmen, eds) Proc. 2nd Workshop on the Algebra of Communicating Processes - ACP'95, Eindhoven, Report CS-95-14, pp. 139-156, Eindhoven University of Technology (May 1995)
42. Wang Zheng Bing, 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)
43. 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)
44. W.J. Fokkink, A complete equational axiomatization for prefix iteration, Information Processing Letters 52(6):333-337 (December 1994)
45. 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
46. 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-Verlag (April 1994)
47. 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)
48. 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-Verlag (August 1993)
49. W.J. Fokkink, Lifschitz Stratifications of Analytic Sets, MSc thesis, University of Amsterdam (August 1990)

Technical Reports

1. Y.A. Yushtein, E. Kesseler, W.J. Fokkink, J.C. van de Pol, Y.S. Usenko and N.Y. Ioustinova, KTVFM study on relevance of formal methods for the Royal Netherlands Navy, Report CR-2002-492, National Aerospace Laboratory, Amsterdam (2002)
2. 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)
3. C. Bonini, W.J. Fokkink and A. Lesch, A reference model for teleconferencing systems, Report CS-R9502, CWI, Amsterdam (1995)
4. W.J. Fokkink and J.J. van Wamel, An algebraic specification of interest products, Report CR-9201, University of Amsterdam, Amsterdam (1992), Confidential
5. W.J. Fokkink, Checking the equations for the mathematical representation of A-CRL, SPECS Working Paper A5.16.3 (1992)
6. W.J. Fokkink, A simple specification language combining processes, time and data, Report CS-R9209, CWI, Amsterdam (1992)