Wan Fokkink - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

2009

A finite equational base for CCS with left merge and communication mergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. tocl, 10(1), 2009. [doi]

PrefaceLuca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna IngÃ³lfsdÃ³ttir, Uwe Nestmann. jlp, 78(4), 2009. [doi]

An Analytical Model of Information Dissemination for a Gossip-Based ProtocolRena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen. icdcn 2009: 230-242 [doi]

An analytical model of information dissemination for a gossip-based protocolRena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen. cn, 53(13):2288-2303, 2009. [doi]

Mean-Field Analysis for the Evaluation of Gossip ProtocolsRena Bakhshi, Lucia Cloth, Wan Fokkink, Boudewijn R. Haverkort. qest 2009: 247-256 [doi]

What Can Formal Methods Bring to Systems Biology?Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, Elzbieta Krepska. fm 2009: 16-22 [doi]

Executing multicellular differentiation: quantitative predictive modelling of ::::C.elegans:::: vulval developmentNicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa. bioinformatics, 25(16):2049-2056, 2009. [doi]

Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval developmentNicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa. bioinformatics, 25(19):2624, 2009. [doi]

On Finite Bases for Weak Semantics: Failures Versus Impossible FuturesTaolue Chen, Wan Fokkink, Rob J. van Glabbeek. sofsem 2009: 167-180 [doi]

Process Algebra: An Algebraic Theory of ConcurrencyWan Fokkink. cai 2009: 47-77 [doi]

Automated Translation and Analysis of a ToolBus Script for AuctionsWan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko. fsen 2010: 308-323 [doi]

Equational Reasoning on Ad Hoc NetworksFatemeh Ghassemi, Wan Fokkink, Ali Movaghar. fsen 2010: 113-128 [doi]

FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid ApplicationsAna-Maria Oprescu, Thilo Kielmann, Wan Fokkink. icdcn 2009: 368-376 [doi]

2008

On the axiomatisability of priorityLuca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir. mscs, 18(1):5-28, 2008. [doi]

Guest Editors ForewordLuca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon. jlp, 75(1):1-2, 2008. [doi]

A Cancellation Theorem for BCCSPLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. FUIN, 88(1-2):1-21, 2008. [doi]

Lifting Non-Finite Axiomatizability Results to Extensions of Process AlgebrasLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi. ifipTCS 2008: 301-316 [doi]

Mechanical Verification of a Two-Way Sliding Window ProtocolBahareh Badban, Wan Fokkink, Jaco van de Pol. wotug 2008: 179-202 [doi]

Leader Election in Anonymous Rings: Franklin Goes ProbabilisticRena Bakhshi, Wan Fokkink, Jun Pang, Jaco van de Pol. ifipTCS 2008: 57-72 [doi]

An Analytical Model of Information Dissemination for a Gossip-based ProtocolRena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen. corr, abs/0810.1571, 2008. [doi]

On the Axiomatizability of Impossible Futures: Preorder versus EquivalenceTaolue Chen, Wan Fokkink. lics 2008: 156-165 [doi]

On finite alphabets and infinite basesTaolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain. iandc, 206(5):492-519, 2008. [doi]

On Finite Bases for Weak Semantics: Failures versus Impossible FuturesTaolue Chen, Wan Fokkink, Rob J. van Glabbeek. corr, abs/0810.4904, 2008. [doi]

Ready to preorder: The case of weak process semanticsTaolue Chen, Wan Fokkink, Rob J. van Glabbeek. ipl, 109(2):104-111, 2008. [doi]

Is Timed Branching Bisimilarity a Congruence Indeed?Wan Fokkink, Jun Pang, Anton Wijs. FUIN, 87(3-4):287-311, 2008. [doi]

Towards Formal Verification of ToolBusScriptsWan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko. amast 2008: 160-166 [doi]

Restricted Broadcast Process TheoryFatemeh Ghassemi, Wan Fokkink, Ali Movaghar. sefm 2008: 345-354 [doi]

Design Issues for Qualitative Modelling of Biological Cells with Petri NetsElzbieta Krepska, Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa. fmsb 2008: 48-62 [doi]

2007

2006

On the Axiomatizability of PriorityLuca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir. icalp 2006: 480-491 [doi]

The Quest for Equational Axiomatizations of Parallel Composition: Status and Open ProblemsLuca Aceto, Wan Fokkink. ENTCS, 162:43-48, 2006. [doi]

A Finite Equational Base for CCS with Left Merge and Communication MergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. icalp 2006: 492-503 [doi]

A Finite Equational Base for CCS with Left Merge and Communication MergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. corr, abs/cs/0608001, 2006. [doi]

Bisimilarity is not finitely based over BPA with interruptLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain. TCS, 366(1-2):60-81, 2006. [doi]

On Finite Alphabets and Infinite Bases III: SimulationTaolue Chen, Wan Fokkink. concur 2006: 421-434 [doi]

On Finite Alphabets and Infinite Bases II: Completed and Ready SimulationTaolue Chen, Wan Fokkink, Sumit Nain. fossacs 2006: 1-15 [doi]

Divide and Congruence Applied to ::::eta::::-BisimulationWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. ENTCS, 156(1):97-113, 2006. [doi]

Compositionality of Hennessy-Milner logic by structural operational semanticsWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. TCS, 354(3):421-440, 2006. [doi]

Cones and foci: A mechanical framework for protocol verificationWan Fokkink, Jun Pang, Jaco van de Pol. fmsd, 29(1):1-31, 2006. [doi]

Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISMWan Fokkink, Jun Pang. jucs, 12(8):981-1006, 2006. [doi]

2005

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy s mergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. lmcs, 1(1), 2005. [doi]

Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy s MergeLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. corr, abs/cs/0501040, 2005. [doi]

CCS with Hennessy s merge has no finite-equational axiomatizationLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. TCS, 330(3):377-405, 2005. [doi]

PrefaceLuca Aceto, Wan Fokkink, Irek Ulidowski. ENTCS, 128(1):1, 2005. [doi]

Guest editors foreword: Process AlgebraLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik. TCS, 335(2-3):127-129, 2005. [doi]

Finite Equational Bases in Process Algebra: Results and Open QuestionsLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik. BIRTHDAY 2005: 338-367 [doi]

Bisimilarity Is Not Finitely Based over BPA with InterruptLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain. calco 2005: 52-66 [doi]

Verification of a sliding window protocol in µCRL and PVSBahareh Badban, Wan Fokkink, Jan Friso Groote, Jun Pang, Jaco van de Pol. fac, 17(3):342-388, 2005. [doi]

Analyzing a ::::chi:::: model of a turntable system using Spin, CADP and UppaalE. M. Bortnik, Nikola Trcka, Anton Wijs, Bas Luttik, J. M. van de Mortel-Fronczak, Jos C. M. Baeten, Wan Fokkink, J. E. Rooda. jlp, 65(2):51-104, 2005. [doi]

Simplifying Itai-Rodeh Leader Election for Anonymous RingsWan Fokkink, Jun Pang. ENTCS, 128(6):53-68, 2005. [doi]

Is Timed Branching Bisimilarity an Equivalence Indeed?Wan Fokkink, Jun Pang, Anton Wijs. formats 2005: 258-272 [doi]

A Note on K-State Self-stabilization in a Ring with K=NWan Fokkink, Jaap-Henk Hoepman, Jun Pang. njc, 12(1):18-26, 2005.

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching BisimulationWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. FMCO 2006: 195-218 [doi]

Formal Verification of Timed Systems Using Cones and FociWan Fokkink, Jun Pang. ENTCS, 139(1):105-122, 2005. [doi]

A Finite Basis for Failure SemanticsWan Fokkink, Sumit Nain. icalp 2005: 755-765 [doi]

From chi-t to µCRL: Combining Performance and Functional AnalysisAnton Wijs, Wan Fokkink. iceccs 2005: 184-193 [doi]

2004

2003

A note on an expressiveness hierarchy for multi-exit iterationLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. ipl, 87(1):17-23, 2003. [doi]

PrefaceThomas Arts, Wan Fokkink. ENTCS, 80, 2003. [doi]

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure TracesStefan Blom, Wan Fokkink, Sumit Nain. icalp 2003: 109-118 [doi]

Structural operational semantics and bounded nondeterminismWan Fokkink, Thuy Duong Vu. ACTA, 39(6-7):501-516, 2003. [doi]

Compositionality of Hennessy-Milner Logic through Structural Operational SemanticsWan Fokkink, Rob J. van Glabbeek, Paulien de Wind. fct 2003: 412-422 [doi]

Cones and Foci for Protocol Verification RevisitedWan Fokkink, Jun Pang. fossacs 2003: 267-281 [doi]

Analyzing the Redesign of a Distributed Lift System in UPPAALJun Pang, Bart Karstens, Wan Fokkink. icfem 2003: 504-522 [doi]

Model Checking a Cache Coherence Protocol for a Java DSM ImplementationJun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald Veldema. ipps 2003: 238 [doi]

2002

Precongruence Formats for Decorated Trace SemanticsBard Bloom, Wan Fokkink, Rob J. van Glabbeek. corr, cs.LO/0204039, 2002. [doi]

Refinement and Verification Applied to an In-Flight Data Acquisition UnitWan Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein. concur 2002: 1-23 [doi]

2001

2000

Precongruence Formats for Decorated Trace PreordersBard Bloom, Wan Fokkink, Rob J. van Glabbeek. lics 2000: 107-118 [doi]

Rooted Branching Bisimulation as a CongruenceWan Fokkink. jcss, 60(1):13-37, 2000.

Language preorder as a precongruenceWan Fokkink. TCS, 243(1-2):391-408, 2000. [doi]

An ::::omega::::-Complete Equational Specification of InterleavingWan Fokkink, Bas Luttik. icalp 2000: 729-743 [doi]

Lazy rewriting on eager machineryWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 22(1):45-86, 2000. [doi]

1999

Conservative Extension in Structural Operational SemanticsLuca Aceto, Wan Fokkink, Chris Verhoef. eatcs, 69:110-132, 1999.

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation FactoriesWan Fokkink, Chris Verhoef. FASE 1999: 98-113

1998

A Cook s Tour of Equational Axiomatizations for Prefix IterationLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. fossacs 1998: 20-34 [doi]

A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed TracesLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. mscs, 8(3):193-230, 1998.

On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely BasedLuca Aceto, Wan Fokkink, Anna Ingólfsdóttir. TCS, 209(1-2):163-178, 1998. [doi]

A Conservative Look at Operational Semantics with Variable BindingWan Fokkink, Chris Verhoef. iandc, 146(1):24-54, 1998.

Within ARM s Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite SystemsWan Fokkink, Jasper Kamperman, Pum Walters. TOPLAS, 20(3):679-706, 1998. [doi]

EURIS, a Specification Method for Distributed InterlockingsFokko van Dijk, Wan Fokkink, Gea Kolk, Paul van de Ven, Bas van Vlijmen. safecomp 1998: 296-305 [doi]

1997

An Equational Axiomatization for Multi-Exit IterationLuca Aceto, Wan Fokkink. iandc, 137(2):121-158, 1997.

Unification for Infinite Sets of Equations Between Finite TermsWan Fokkink. ipl, 62(4):183-188, 1997. [doi]

An Axiomatization for Regular Processes in Times Branching BisimulationWan Fokkink. FUIN, 32(3-4):329-340, 1997.

Termination Modulo Equations by Abstract Commutation with an Application to IterationWan Fokkink, Hans Zantema. TCS, 177(2):407-423, 1997. [doi]

Axiomatizations for the Perpetual Loop in Process AlgebraWan Fokkink. icalp 1997: 571-581

Simulation as a Correct Transformation of Rewrite SystemsWan Fokkink, Jaco van de Pol. mfcs 1997: 249-258

PreviousNext