| 2009 |
|---|
| 100 | EE | Rena Bakhshi,
Daniela Gavidia,
Wan Fokkink,
Maarten van Steen:
An Analytical Model of Information Dissemination for a Gossip-Based Protocol.
ICDCN 2009: 230-242 |
| 99 | EE | Ana-Maria Oprescu,
Thilo Kielmann,
Wan Fokkink:
FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications.
ICDCN 2009: 368-376 |
| 98 | EE | Taolue Chen,
Wan Fokkink,
Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.
SOFSEM 2009: 167-180 |
| 97 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log. 10(1): (2009) |
| 2008 |
|---|
| 96 | EE | Wan Fokkink,
Paul Klint,
Bert Lisser,
Yaroslav S. Usenko:
Towards Formal Verification of ToolBusScripts.
AMAST 2008: 160-166 |
| 95 | EE | Bahareh Badban,
Wan Fokkink,
Jaco van de Pol:
Mechanical Verification of a Two-Way Sliding Window Protocol.
CPA 2008: 179-202 |
| 94 | EE | Elzbieta Krepska,
Nicola Bonzanni,
K. Anton Feenstra,
Wan Fokkink,
Thilo Kielmann,
Henri E. Bal,
Jaap Heringa:
Design Issues for Qualitative Modelling of Biological Cells with Petri Nets.
FMSB 2008: 48-62 |
| 93 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Mohammad Reza Mousavi:
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
IFIP TCS 2008: 301-316 |
| 92 | EE | Rena Bakhshi,
Wan Fokkink,
Jun Pang,
Jaco van de Pol:
Leader Election in Anonymous Rings: Franklin Goes Probabilistic.
IFIP TCS 2008: 57-72 |
| 91 | EE | Taolue Chen,
Wan Fokkink:
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.
LICS 2008: 156-165 |
| 90 | EE | Fatemeh Ghassemi,
Wan Fokkink,
Ali Movaghar:
Restricted Broadcast Process Theory.
SEFM 2008: 345-354 |
| 89 | EE | Rena Bakhshi,
Daniela Gavidia,
Wan Fokkink,
Maarten van Steen:
An Analytical Model of Information Dissemination for a Gossip-based Protocol
CoRR abs/0810.1571: (2008) |
| 88 | EE | Taolue Chen,
Wan Fokkink,
Rob J. van Glabbeek:
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
CoRR abs/0810.4904: (2008) |
| 87 | EE | Wan Fokkink,
Jun Pang,
Anton Wijs:
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundam. Inform. 87(3-4): 287-311 (2008) |
| 86 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cancellation Theorem for BCCSP.
Fundam. Inform. 88(1-2): 1-21 (2008) |
| 85 | EE | Taolue Chen,
Wan Fokkink,
Bas Luttik,
Sumit Nain:
On finite alphabets and infinite bases.
Inf. Comput. 206(5): 492-519 (2008) |
| 84 | EE | Taolue Chen,
Wan Fokkink,
Rob J. van Glabbeek:
Ready to preorder: The case of weak process semantics.
Inf. Process. Lett. 109(2): 104-111 (2008) |
| 83 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 75(1): 1-2 (2008) |
| 82 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the axiomatisability of priority.
Mathematical Structures in Computer Science 18(1): 5-28 (2008) |
| 2007 |
|---|
| 81 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
CALCO 2007: 65-79 |
| 80 | EE | Wan Fokkink,
Allard Kakebeen,
Jun Pang:
Adapting the UPPAAL Model of a Distributed Lift System.
FSEN 2007: 81-97 |
| 79 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 70(2): 119-120 (2007) |
| 78 | EE | Jun Pang,
Wan Fokkink,
Rutger F. H. Hofman,
Ronald Veldema:
Model checking a cache coherence protocol of a Java DSM implementation.
J. Log. Algebr. Program. 71(1): 1-43 (2007) |
| 77 | EE | Luca Aceto,
Mario Bravetti,
Wan Fokkink,
Andrew D. Gordon:
Guest Editors' Foreword.
J. Log. Algebr. Program. 72(1): 1-2 (2007) |
| 76 | EE | Rena Bakhshi,
François Bonnet,
Wan Fokkink,
Boudewijn R. Haverkort:
Formal analysis techniques for gossiping protocols.
Operating Systems Review 41(5): 28-36 (2007) |
| 2006 |
|---|
| 75 | EE | Taolue Chen,
Wan Fokkink:
On Finite Alphabets and Infinite Bases III: Simulation.
CONCUR 2006: 421-434 |
| 74 | EE | Taolue Chen,
Wan Fokkink,
Sumit Nain:
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.
FoSSaCS 2006: 1-15 |
| 73 | EE | Luca Aceto,
Taolue Chen,
Wan Fokkink,
Anna Ingólfsdóttir:
On the Axiomatizability of Priority.
ICALP (2) 2006: 480-491 |
| 72 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge.
ICALP (2) 2006: 492-503 |
| 71 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
A Finite Equational Base for CCS with Left Merge and Communication Merge
CoRR abs/cs/0608001: (2006) |
| 70 | EE | Wan Fokkink,
Rob J. van Glabbeek,
Paulien de Wind:
Divide and Congruence Applied to eta-Bisimulation.
Electr. Notes Theor. Comput. Sci. 156(1): 97-113 (2006) |
| 69 | EE | Luca Aceto,
Wan Fokkink:
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.
Electr. Notes Theor. Comput. Sci. 162: 43-48 (2006) |
| 68 | EE | Wan Fokkink,
Jun Pang,
Jaco van de Pol:
Cones and foci: A mechanical framework for protocol verification.
Formal Methods in System Design 29(1): 1-31 (2006) |
| 67 | EE | Wan Fokkink,
Jun Pang:
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM.
J. UCS 12(8): 981-1006 (2006) |
| 66 | EE | Wan Fokkink,
Rob J. van Glabbeek,
Paulien de Wind:
Compositionality of Hennessy-Milner logic by structural operational semantics.
Theor. Comput. Sci. 354(3): 421-440 (2006) |
| 65 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci. 366(1-2): 60-81 (2006) |
| 2005 |
|---|
| 64 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Sumit Nain:
Bisimilarity Is Not Finitely Based over BPA with Interrupt.
CALCO 2005: 52-66 |
| 63 | EE | Wan Fokkink,
Rob J. van Glabbeek,
Paulien de Wind:
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation.
FMCO 2005: 195-218 |
| 62 | EE | Wan Fokkink,
Jun Pang,
Anton Wijs:
Is Timed Branching Bisimilarity an Equivalence Indeed?.
FORMATS 2005: 258-272 |
| 61 | EE | Wan Fokkink,
Sumit Nain:
A Finite Basis for Failure Semantics.
ICALP 2005: 755-765 |
| 60 | EE | Anton Wijs,
Wan Fokkink:
From chi-t to µCRL: Combining Performance and Functional Analysis.
ICECCS 2005: 184-193 |
| 59 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Finite Equational Bases in Process Algebra: Results and Open Questions.
Processes, Terms and Cycles 2005: 338-367 |
| 58 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
CoRR abs/cs/0501040: (2005) |
| 57 | EE | Luca Aceto,
Wan Fokkink,
Irek Ulidowski:
Preface.
Electr. Notes Theor. Comput. Sci. 128(1): 1- (2005) |
| 56 | EE | Wan Fokkink,
Jun Pang:
Simplifying Itai-Rodeh Leader Election for Anonymous Rings.
Electr. Notes Theor. Comput. Sci. 128(6): 53-68 (2005) |
| 55 | EE | Wan Fokkink,
Jun Pang:
Formal Verification of Timed Systems Using Cones and Foci.
Electr. Notes Theor. Comput. Sci. 139(1): 105-122 (2005) |
| 54 | EE | Bahareh Badban,
Wan Fokkink,
Jan Friso Groote,
Jun Pang,
Jaco van de Pol:
Verification of a sliding window protocol in µCRL and PVS.
Formal Asp. Comput. 17(3): 342-388 (2005) |
| 53 | EE | E. M. Bortnik,
Nikola Trcka,
Anton Wijs,
Bas Luttik,
J. M. van de Mortel-Fronczak,
Jos C. M. Baeten,
Wan Fokkink,
J. E. Rooda:
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal.
J. Log. Algebr. Program. 65(2): 51-104 (2005) |
| 52 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Logical Methods in Computer Science 1(1): (2005) |
| 51 | | Wan Fokkink,
Jaap-Henk Hoepman,
Jun Pang:
A Note on K-State Self-stabilization in a Ring with K=N.
Nord. J. Comput. 12(1): 18-26 (2005) |
| 50 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Bas Luttik:
CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci. 330(3): 377-405 (2005) |
| 49 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir,
Zoltán Ésik:
Guest editors' foreword: Process Algebra.
Theor. Comput. Sci. 335(2-3): 127-129 (2005) |
| 2004 |
|---|
| 48 | EE | Wan Fokkink,
Jan Friso Groote,
Jun Pang,
Bahareh Badban,
Jaco van de Pol:
Verifying a Sliding Window Protocol in µCRL.
AMAST 2004: 148-163 |
| 47 | EE | Wan Fokkink,
Sumit Nain:
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.
FoSSaCS 2004: 182-194 |
| 46 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log. 5(1): 26-78 (2004) |
| 45 | EE | Wan Fokkink,
Jan Friso Groote,
Michel A. Reniers:
Process Algebra Needs Proof Methodology (Columns: Concurrency).
Bulletin of the EATCS 82: 109-125 (2004) |
| 44 | EE | Luca Aceto,
Wan Fokkink,
Rob J. van Glabbeek,
Anna Ingólfsdóttir:
Nested semantics over finite trees are equationally hard.
Inf. Comput. 191(2): 203-232 (2004) |
| 43 | EE | Luca Aceto,
Wan Fokkink:
Guesteditors'introduction: Special issue on Structural Operational Semantics.
J. Log. Algebr. Program. 60-61: 1-2 (2004) |
| 2003 |
|---|
| 42 | EE | Wan Fokkink,
Rob J. van Glabbeek,
Paulien de Wind:
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.
FCT 2003: 412-422 |
| 41 | EE | Wan Fokkink,
Jun Pang:
Cones and Foci for Protocol Verification Revisited.
FoSSaCS 2003: 267-281 |
| 40 | EE | Stefan Blom,
Wan Fokkink,
Sumit Nain:
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.
ICALP 2003: 109-118 |
| 39 | EE | Jun Pang,
Bart Karstens,
Wan Fokkink:
Analyzing the Redesign of a Distributed Lift System in UPPAAL.
ICFEM 2003: 504-522 |
| 38 | EE | Jun Pang,
Wan Fokkink,
Rutger F. H. Hofman,
Ronald Veldema:
Model Checking a Cache Coherence Protocol for a Java DSM Implementation.
IPDPS 2003: 238 |
| 37 | EE | Wan Fokkink,
Thuy Duong Vu:
Structural operational semantics and bounded nondeterminism.
Acta Inf. 39(6-7): 501-516 (2003) |
| 36 | EE | Thomas Arts,
Wan Fokkink:
Preface.
Electr. Notes Theor. Comput. Sci. 80: (2003) |
| 35 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A note on an expressiveness hierarchy for multi-exit iteration.
Inf. Process. Lett. 87(1): 17-23 (2003) |
| 2002 |
|---|
| 34 | EE | Wan Fokkink,
Natalia Ioustinova,
Ernst Kesseler,
Jaco van de Pol,
Yaroslav S. Usenko,
Yuri A. Yushtein:
Refinement and Verification Applied to an In-Flight Data Acquisition Unit.
CONCUR 2002: 1-23 |
| 33 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Semantics
CoRR cs.LO/0204039: (2002) |
| 2001 |
|---|
| 32 | EE | Stefan Blom,
Wan Fokkink,
Jan Friso Groote,
Izak van Langevelde,
Bert Lisser,
Jaco van de Pol:
µCRL: A Toolset for Analysing Algebraic Specifications.
CAV 2001: 250-254 |
| 31 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
2-Nested Simulation Is Not Finitely Equationally Axiomatizable.
STACS 2001: 39-50 |
| 30 | | Luca Aceto,
Wan Fokkink,
Chris Verhoef:
Conservative Extension in Structural Operational Semantics.
Current Trends in Theoretical Computer Science 2001: 504-524 |
| 29 | EE | Luca Aceto,
Wan Fokkink:
Preface: Process Algebra.
Inf. Process. Lett. 80(1): 1 (2001) |
| 2000 |
|---|
| 28 | EE | Wan Fokkink,
S. P. Luttik:
An omega-Complete Equational Specification of Interleaving.
ICALP 2000: 729-743 |
| 27 | EE | Bard Bloom,
Wan Fokkink,
Rob J. van Glabbeek:
Precongruence Formats for Decorated Trace Preorders.
LICS 2000: 107-118 |
| 26 | EE | Wan Fokkink,
Jasper Kamperman,
Pum Walters:
Lazy rewriting on eager machinery.
ACM Trans. Program. Lang. Syst. 22(1): 45-86 (2000) |
| 25 | | Wan Fokkink:
Rooted Branching Bisimulation as a Congruence.
J. Comput. Syst. Sci. 60(1): 13-37 (2000) |
| 24 | EE | Wan Fokkink:
Language preorder as a precongruence.
Theor. Comput. Sci. 243(1-2): 391-408 (2000) |
| 1999 |
|---|
| 23 | | Wan Fokkink,
Chris Verhoef:
Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories.
FASE 1999: 98-113 |
| 22 | | Luca Aceto,
Wan Fokkink,
Chris Verhoef:
Conservative Extension in Structural Operational Semantics.
Bulletin of the EATCS 69: 110-132 (1999) |
| 1998 |
|---|
| 21 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Cook's Tour of Equational Axiomatizations for Prefix Iteration.
FoSSaCS 1998: 20-34 |
| 20 | EE | Fokko van Dijk,
Wan Fokkink,
Gea Kolk,
Paul van de Ven,
Bas van Vlijmen:
EURIS, a Specification Method for Distributed Interlockings.
SAFECOMP 1998: 296-305 |
| 19 | EE | Wan Fokkink,
Jasper Kamperman,
Pum Walters:
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems.
ACM Trans. Program. Lang. Syst. 20(3): 679-706 (1998) |
| 18 | | Wan Fokkink,
Chris Verhoef:
A Conservative Look at Operational Semantics with Variable Binding.
Inf. Comput. 146(1): 24-54 (1998) |
| 17 | | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
Mathematical Structures in Computer Science 8(3): 193-230 (1998) |
| 16 | EE | Luca Aceto,
Wan Fokkink,
Anna Ingólfsdóttir:
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.
Theor. Comput. Sci. 209(1-2): 163-178 (1998) |
| 1997 |
|---|
| 15 | | Wan Fokkink:
Axiomatizations for the Perpetual Loop in Process Algebra.
ICALP 1997: 571-581 |
| 14 | | Wan Fokkink,
Jaco van de Pol:
Simulation as a Correct Transformation of Rewrite Systems.
MFCS 1997: 249-258 |
| 13 | | Wan Fokkink:
An Axiomatization for Regular Processes in Times Branching Bisimulation.
Fundam. Inform. 32(3-4): 329-340 (1997) |
| 12 | | Luca Aceto,
Wan Fokkink:
An Equational Axiomatization for Multi-Exit Iteration.
Inf. Comput. 137(2): 121-158 (1997) |
| 11 | EE | Wan Fokkink:
Unification for Infinite Sets of Equations Between Finite Terms.
Inf. Process. Lett. 62(4): 183-188 (1997) |
| 10 | EE | Wan Fokkink,
Hans Zantema:
Termination Modulo Equations by Abstract Commutation with an Application to Iteration.
Theor. Comput. Sci. 177(2): 407-423 (1997) |
| 1996 |
|---|
| 9 | | Wan Fokkink:
On the Completeness of the Euations for the Kleene Star in Bisimulation.
AMAST 1996: 180-194 |
| 8 | | Wan Fokkink:
A Complete Axiomatization for Prefix Iteration in Branching Bisimulation.
Fundam. Inform. 26(2): 103-113 (1996) |
| 7 | | Wan Fokkink,
Rob J. van Glabbeek:
Ntyft/Ntyxt Rules Reduce to Ntree Rules.
Inf. Comput. 126(1): 1-10 (1996) |
| 6 | | Luca Aceto,
Rob J. van Glabbeek,
Wan Fokkink,
Anna Ingólfsdóttir:
Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput. 127(1): 26-40 (1996) |
| 1995 |
|---|
| 5 | | Wan Fokkink,
Steven Klusener:
An Effective Axiomatization for Real Time ACP.
Inf. Comput. 122(2): 286-299 (1995) |
| 1994 |
|---|
| 4 | | Wan Fokkink:
The Tyft/Tyxt Format Reduces to Tree Rules.
TACS 1994: 440-453 |
| 3 | | Wan Fokkink,
Hans Zantema:
Basic Process Algebra with Iteration: Completeness of its Equational Axioms.
Comput. J. 37(4): 259-268 (1994) |
| 2 | | Wan Fokkink:
A Complete Equational Axiomatization for Prefix Iteration.
Inf. Process. Lett. 52(6): 333-337 (1994) |
| 1993 |
|---|
| 1 | | Wan Fokkink:
An Elimination Theorem for Regular Behaviours with Integration.
CONCUR 1993: 432-446 |
