The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wan Fokkink: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wan Fokkink
    On the Completeness of the Euations for the Kleene Star in Bisimulation. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:180-194 [Conf]
  2. Wan Fokkink, Jan Friso Groote, Jun Pang, Bahareh Badban, Jaco van de Pol
    Verifying a Sliding Window Protocol in µCRL. [Citation Graph (0, 0)][DBLP]
    AMAST, 2004, pp:148-163 [Conf]
  3. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    Finite Equational Bases in Process Algebra: Results and Open Questions. [Citation Graph (0, 0)][DBLP]
    Processes, Terms and Cycles, 2005, pp:338-367 [Conf]
  4. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain
    Bisimilarity Is Not Finitely Based over BPA with Interrupt. [Citation Graph (0, 0)][DBLP]
    CALCO, 2005, pp:52-66 [Conf]
  5. Stefan Blom, Wan Fokkink, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol
    µCRL: A Toolset for Analysing Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:250-254 [Conf]
  6. Wan Fokkink
    An Elimination Theorem for Regular Behaviours with Integration. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:432-446 [Conf]
  7. Taolue Chen, Wan Fokkink
    On Finite Alphabets and Infinite Bases III: Simulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2006, pp:421-434 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2002, pp:1-23 [Conf]
  9. Wan Fokkink, Chris Verhoef
    Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories. [Citation Graph (0, 0)][DBLP]
    FASE, 1999, pp:98-113 [Conf]
  10. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:412-422 [Conf]
  11. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation. [Citation Graph (0, 0)][DBLP]
    FMCO, 2005, pp:195-218 [Conf]
  12. Wan Fokkink, Jun Pang, Anton Wijs
    Is Timed Branching Bisimilarity an Equivalence Indeed?. [Citation Graph (0, 0)][DBLP]
    FORMATS, 2005, pp:258-272 [Conf]
  13. Taolue Chen, Wan Fokkink, Sumit Nain
    On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:1-15 [Conf]
  14. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
    A Cook's Tour of Equational Axiomatizations for Prefix Iteration. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1998, pp:20-34 [Conf]
  15. Wan Fokkink, Sumit Nain
    On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:182-194 [Conf]
  16. Wan Fokkink, Jun Pang
    Cones and Foci for Protocol Verification Revisited. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:267-281 [Conf]
  17. Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir
    On the Axiomatizability of Priority. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:480-491 [Conf]
  18. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    A Finite Equational Base for CCS with Left Merge and Communication Merge. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:492-503 [Conf]
  19. Stefan Blom, Wan Fokkink, Sumit Nain
    On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:109-118 [Conf]
  20. Wan Fokkink
    Axiomatizations for the Perpetual Loop in Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:571-581 [Conf]
  21. Wan Fokkink, S. P. Luttik
    An omega-Complete Equational Specification of Interleaving. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:729-743 [Conf]
  22. Wan Fokkink, Sumit Nain
    A Finite Basis for Failure Semantics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:755-765 [Conf]
  23. Anton Wijs, Wan Fokkink
    From chi-t to µCRL: Combining Performance and Functional Analysis. [Citation Graph (0, 0)][DBLP]
    ICECCS, 2005, pp:184-193 [Conf]
  24. Jun Pang, Bart Karstens, Wan Fokkink
    Analyzing the Redesign of a Distributed Lift System in UPPAAL. [Citation Graph (0, 0)][DBLP]
    ICFEM, 2003, pp:504-522 [Conf]
  25. Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald Veldema
    Model Checking a Cache Coherence Protocol for a Java DSM Implementation. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:238- [Conf]
  26. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Preorders. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:107-118 [Conf]
  27. Wan Fokkink, Jaco van de Pol
    Simulation as a Correct Transformation of Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:249-258 [Conf]
  28. Fokko van Dijk, Wan Fokkink, Gea Kolk, Paul van de Ven, Bas van Vlijmen
    EURIS, a Specification Method for Distributed Interlockings. [Citation Graph (0, 0)][DBLP]
    SAFECOMP, 1998, pp:296-305 [Conf]
  29. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
    2-Nested Simulation Is Not Finitely Equationally Axiomatizable. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:39-50 [Conf]
  30. Wan Fokkink
    The Tyft/Tyxt Format Reduces to Tree Rules. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:440-453 [Conf]
  31. Wan Fokkink, Thuy Duong Vu
    Structural operational semantics and bounded nondeterminism. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2003, v:39, n:6-7, pp:501-516 [Journal]
  32. Wan Fokkink, Hans Zantema
    Basic Process Algebra with Iteration: Completeness of its Equational Axioms. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1994, v:37, n:4, pp:259-268 [Journal]
  33. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence Formats for Decorated Trace Semantics [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  34. Luca Aceto, Wan Fokkink, Chris Verhoef
    Conservative Extension in Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1999, v:69, n:, pp:110-132 [Journal]
  35. Wan Fokkink, Jan Friso Groote, Michel Reners
    Process Algebra Needs Proof Methodology (Columns: Concurrency). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:82, n:, pp:109-125 [Journal]
  36. Luca Aceto, Wan Fokkink, Irek Ulidowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:1, pp:1-0 [Journal]
  37. Thomas Arts, Wan Fokkink
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:80, n:, pp:- [Journal]
  38. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Divide and Congruence Applied to eta-Bisimulation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:97-113 [Journal]
  39. Wan Fokkink, Jun Pang
    Simplifying Itai-Rodeh Leader Election for Anonymous Rings. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:6, pp:53-68 [Journal]
  40. Wan Fokkink, Jun Pang
    Formal Verification of Timed Systems Using Cones and Foci. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:139, n:1, pp:105-122 [Journal]
  41. Luca Aceto, Wan Fokkink
    The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:43-48 [Journal]
  42. Bahareh Badban, Wan Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol
    Verification of a sliding window protocol in µCRL and PVS. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2005, v:17, n:3, pp:342-388 [Journal]
  43. Wan Fokkink, Jun Pang, Jaco van de Pol
    Cones and foci: A mechanical framework for protocol verification. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2006, v:29, n:1, pp:1-31 [Journal]
  44. Wan Fokkink
    A Complete Axiomatization for Prefix Iteration in Branching Bisimulation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:26, n:2, pp:103-113 [Journal]
  45. Wan Fokkink
    An Axiomatization for Regular Processes in Times Branching Bisimulation. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:3-4, pp:329-340 [Journal]
  46. Luca Aceto, Wan Fokkink
    An Equational Axiomatization for Multi-Exit Iteration. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:121-158 [Journal]
  47. Luca Aceto, Wan Fokkink, Rob J. van Glabbeek, Anna Ingólfsdóttir
    Nested semantics over finite trees are equationally hard. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:191, n:2, pp:203-232 [Journal]
  48. Luca Aceto, Rob J. van Glabbeek, Wan Fokkink, Anna Ingólfsdóttir
    Axiomatizing Prefix Iteration with Silent Steps. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:127, n:1, pp:26-40 [Journal]
  49. Wan Fokkink, Rob J. van Glabbeek
    Ntyft/Ntyxt Rules Reduce to Ntree Rules. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:1, pp:1-10 [Journal]
  50. Wan Fokkink, Steven Klusener
    An Effective Axiomatization for Real Time ACP. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:122, n:2, pp:286-299 [Journal]
  51. Wan Fokkink, Chris Verhoef
    A Conservative Look at Operational Semantics with Variable Binding. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:146, n:1, pp:24-54 [Journal]
  52. Luca Aceto, Wan Fokkink
    Preface: Process Algebra. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:1, pp:1- [Journal]
  53. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
    A note on an expressiveness hierarchy for multi-exit iteration. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:17-23 [Journal]
  54. Wan Fokkink
    A Complete Equational Axiomatization for Prefix Iteration. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:6, pp:333-337 [Journal]
  55. Wan Fokkink
    Unification for Infinite Sets of Equations Between Finite Terms. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:4, pp:183-188 [Journal]
  56. Wan Fokkink
    Rooted Branching Bisimulation as a Congruence. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:1, pp:13-37 [Journal]
  57. Luca Aceto, Wan Fokkink
    Guesteditors'introduction: Special issue on Structural Operational Semantics. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2004, v:60, n:, pp:1-2 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:65, n:2, pp:51-104 [Journal]
  59. Wan Fokkink, Jun Pang
    Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:8, pp:981-1006 [Journal]
  60. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  61. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
    A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 1998, v:8, n:3, pp:193-230 [Journal]
  62. Wan Fokkink, Jaap-Henk Hoepman, Jun Pang
    A Note on K-State Self-stabilization in a Ring with K=N. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2005, v:12, n:1, pp:18-26 [Journal]
  63. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:163-178 [Journal]
  64. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik
    Guest editors' foreword: Process Algebra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:335, n:2-3, pp:127-129 [Journal]
  65. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    CCS with Hennessy's merge has no finite-equational axiomatization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:3, pp:377-405 [Journal]
  66. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain
    Bisimilarity is not finitely based over BPA with interrupt. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:1-2, pp:60-81 [Journal]
  67. Wan Fokkink
    Language preorder as a precongruence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:243, n:1-2, pp:391-408 [Journal]
  68. Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind
    Compositionality of Hennessy-Milner logic by structural operational semantics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:354, n:3, pp:421-440 [Journal]
  69. Wan Fokkink, Hans Zantema
    Termination Modulo Equations by Abstract Commutation with an Application to Iteration. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:177, n:2, pp:407-423 [Journal]
  70. Bard Bloom, Wan Fokkink, Rob J. van Glabbeek
    Precongruence formats for decorated trace semantics. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:1, pp:26-78 [Journal]
  71. Wan Fokkink, Jasper Kamperman, Pum Walters
    Lazy rewriting on eager machinery. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2000, v:22, n:1, pp:45-86 [Journal]
  72. Wan Fokkink, Jasper Kamperman, Pum Walters
    Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1998, v:20, n:3, pp:679-706 [Journal]
  73. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
    Ready to Preorder: Get Your BCCSP Axiomatization for Free! [Citation Graph (0, 0)][DBLP]
    CALCO, 2007, pp:65-79 [Conf]
  74. Wan Fokkink, Allard Kakebeen, Jun Pang
    Adapting the UPPAAL Model of a Distributed Lift System. [Citation Graph (0, 0)][DBLP]
    FSEN, 2007, pp:81-97 [Conf]
  75. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  76. Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
    A Finite Equational Base for CCS with Left Merge and Communication Merge [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  77. Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:70, n:2, pp:119-120 [Journal]
  78. Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald Veldema
    Model checking a cache coherence protocol of a Java DSM implementation. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:71, n:1, pp:1-43 [Journal]
  79. Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon
    Guest Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:72, n:1, pp:1-2 [Journal]

  80. Towards Formal Verification of ToolBusScripts. [Citation Graph (, )][DBLP]


  81. What Can Formal Methods Bring to Systems Biology? [Citation Graph (, )][DBLP]


  82. Leader Election in Anonymous Rings: Franklin Goes Probabilistic. [Citation Graph (, )][DBLP]


  83. Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. [Citation Graph (, )][DBLP]


  84. On the Axiomatizability of Impossible Futures: Preorder versus Equivalence. [Citation Graph (, )][DBLP]


  85. Brief announcement: asynchronous bounded expected delay networks. [Citation Graph (, )][DBLP]


  86. Brief announcement: a shared disk on distributed storage. [Citation Graph (, )][DBLP]


  87. Mean-Field Analysis for the Evaluation of Gossip Protocols. [Citation Graph (, )][DBLP]


  88. Restricted Broadcast Process Theory. [Citation Graph (, )][DBLP]


  89. On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. [Citation Graph (, )][DBLP]


  90. An Analytical Model of Information Dissemination for a Gossip-Based Protocol. [Citation Graph (, )][DBLP]


  91. FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications. [Citation Graph (, )][DBLP]


  92. Embedded Network Protocols for Mobile Devices. [Citation Graph (, )][DBLP]


  93. Equational Reasoning on Ad Hoc Networks. [Citation Graph (, )][DBLP]


  94. Automated Translation and Analysis of a ToolBus Script for Auctions. [Citation Graph (, )][DBLP]


  95. Design Issues for Qualitative Modelling of Biological Cells with Petri Nets. [Citation Graph (, )][DBLP]


  96. Process Algebra: An Algebraic Theory of Concurrency. [Citation Graph (, )][DBLP]


  97. Mechanical Verification of a Two-Way Sliding Window Protocol. [Citation Graph (, )][DBLP]


  98. Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. [Citation Graph (, )][DBLP]


  99. Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. [Citation Graph (, )][DBLP]


  100. An analytical model of information dissemination for a gossip-based protocol. [Citation Graph (, )][DBLP]


  101. An Analytical Model of Information Dissemination for a Gossip-based Protocol [Citation Graph (, )][DBLP]


  102. On Finite Bases for Weak Semantics: Failures versus Impossible Futures [Citation Graph (, )][DBLP]


  103. Modal Logic and the Approximation Induction Principle [Citation Graph (, )][DBLP]


  104. Asynchronous Bounded Expected Delay Networks [Citation Graph (, )][DBLP]


  105. Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.085secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002