| 2013 | ||
|---|---|---|
| j67 | Maciej Gazda, Wan Fokkink: Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics. Comput. J. 56(1): 34-44 (2013) | |
| 2012 | ||
| j66 | Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind: Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity. Inf. Comput. 214: 59-85 (2012) | |
| j65 | Maciej Gazda, Wan Fokkink: Modal logic and the approximation induction principle. Mathematical Structures in Computer Science 22(2): 175-201 (2012) | |
| c67 | Daniela Remenska, Tim A. C. Willemse, Kees Verstoep, Wan Fokkink, Jeff Templon, Henri E. Bal: Using Model Checking to Analyze the System Behavior of the LHC Production Grid. CCGRID 2012: 335-343 | |
| c66 | Daniel Gebler, Wan Fokkink: Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics. CONCUR 2012: 395-409 | |
| c65 | David M. Williams, Joeri de Ruiter, Wan Fokkink: Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols. ICTAC 2012: 168-182 | |
| c64 | Davide Ceolin, Archana Nottamkandath, Wan Fokkink: Automated Evaluation of Annotators for Museum Collections Using Subjective Logic. IFIPTM 2012: 232-239 | |
| c63 | Davide Ceolin, Paul T. Groth, Willem Robert van Hage, Archana Nottamkandath, Wan Fokkink: Trust Evaluation through User Reputation and Provenance Analysis. URSW 2012: 15-26 | |
| c62 | Davide Ceolin, Archana Nottamkandath, Wan Fokkink: Subjective Logic Extensions for the Semantic Web. URSW 2012: 27-38 | |
| 2011 | ||
| j64 | Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang: Fast leader election in anonymous rings with bounded expected delay. Inf. Process. Lett. 111(17): 864-870 (2011) | |
| j63 | Rena Bakhshi, Lucia Cloth, Wan Fokkink, Boudewijn R. Haverkort: Mean-field framework for performance evaluation of push-pull gossip protocols. Perform. Eval. 68(2): 157-179 (2011) | |
| j62 | Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Henri E. Bal: HipG: parallel processing of large-scale graphs. Operating Systems Review 45(2): 3-13 (2011) | |
| j61 | Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar: Verification of mobile ad hoc networks: An algebraic approach. Theor. Comput. Sci. 412(28): 3262-3282 (2011) | |
| c61 | Fatemeh Ghassemi, Mahmoud Talebi, Ali Movaghar, Wan Fokkink: Stochastic Restricted Broadcast Process Theory. EPEW 2011: 72-86 | |
| c60 | Abolhassan Shamsaie, Wan Fokkink, Jafar Habibi: Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks. EPEW 2011: 174-188 | |
| c59 | Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Henri E. Bal: A High-Level Framework for Distributed Processing of Large-Scale Graphs. ICDCN 2011: 155-166 | |
| c58 | Rena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen: A Modeling Framework for Gossip-based Information Spread. QEST 2011: 245-254 | |
| c57 | Davide Ceolin, Willem Robert van Hage, Wan Fokkink, Guus Schreiber: Estimating Uncertainty of Categorical Web Data. URSW 2011: 15-26 | |
| c56 | Stefan Vijzelaar, Kees Verstoep, Wan Fokkink, Henri E. Bal: Distributed MAP in the SpinJa Model Checker. PDMC 2011: 84-90 | |
| i7 | Rena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen: A Modeling Framework for Gossip-based Information Spread. CoRR abs/1105.5986 (2011) | |
| 2010 | ||
| j60 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi: Lifting non-finite axiomatizability results to extensions of process algebras. Acta Inf. 47(3): 147-177 (2010) | |
| j59 | Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar: Equational Reasoning on Mobile Ad Hoc Networks. Fundam. Inform. 105(4): 375-415 (2010) | |
| c55 | Fatemeh Ghassemi, Ali Movaghar, Wan Fokkink: Towards Performance Evaluation of Mobile Ad Hoc Network Protocols. ACSD 2010: 85-92 | |
| c54 | Wan Fokkink, Mohammad Torabi Dashti, Anton Wijs: Partial Order Reduction for Branching Security Protocols. ACSD 2010: 191-200 | |
| c53 | Despo Galataki, Andrei Radulescu, Kees Verstoep, Wan Fokkink: Embedded Network Protocols for Mobile Devices. FMICS 2010: 164-179 | |
| c52 | Stefan Vijzelaar, Herbert Bos, Wan Fokkink: Brief announcement: a shared disk on distributed storage. PODC 2010: 79-80 | |
| c51 | Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang: Brief announcement: asynchronous bounded expected delay networks. PODC 2010: 392-393 | |
| c50 | Rena Bakhshi, Jörg Endrullis, Stefan Endrullis, Wan Fokkink, Boudewijn R. Haverkort: Automating the Mean-Field Method for Large Dynamic Gossip Networks. QEST 2010: 241-250 | |
| c49 | Maciej Gazda, Wan Fokkink: Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics. SOS 2010: 15-25 | |
| i6 | Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Jun Pang: Asynchronous Bounded Expected Delay Networks. CoRR abs/1003.2084 (2010) | |
| 2009 | ||
| j58 | Nicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa: Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. Bioinformatics 25(16): 2049-2056 (2009) | |
| j57 | Nicola Bonzanni, Elzbieta Krepska, K. Anton Feenstra, Wan Fokkink, Thilo Kielmann, Henri E. Bal, Jaap Heringa: Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development. Bioinformatics 25(19): 2624 (2009) | |
| j56 | Rena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen: An analytical model of information dissemination for a gossip-based protocol. Computer Networks 53(13): 2288-2303 (2009) | |
| j55 | Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Preface. J. Log. Algebr. Program. 78(4) (2009) | |
| j54 | 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) | |
| c48 | ||
| c47 | Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, Elzbieta Krepska: What Can Formal Methods Bring to Systems Biology? FM 2009: 16-22 | |
| c46 | Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar: Equational Reasoning on Ad Hoc Networks. FSEN 2009: 113-128 | |
| c45 | Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko: Automated Translation and Analysis of a ToolBus Script for Auctions. FSEN 2009: 308-323 | |
| c44 | Rena Bakhshi, Daniela Gavidia, Wan Fokkink, Maarten van Steen: An Analytical Model of Information Dissemination for a Gossip-Based Protocol. ICDCN 2009: 230-242 | |
| c43 | Ana-Maria Oprescu, Thilo Kielmann, Wan Fokkink: FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications. ICDCN 2009: 368-376 | |
| c42 | Rena Bakhshi, Lucia Cloth, Wan Fokkink, Boudewijn R. Haverkort: Mean-Field Analysis for the Evaluation of Gossip Protocols. QEST 2009: 247-256 | |
| c41 | Taolue Chen, Wan Fokkink, Rob J. van Glabbeek: On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. SOFSEM 2009: 167-180 | |
| c40 | Maciej Gazda, Wan Fokkink: Modal Logic and the Approximation Induction Principle. EXPRESS 2009: 41-50 | |
| 2008 | ||
| j53 | Luca Aceto, Jos C. M. Baeten, Wan Fokkink, Anna Ingólfsdóttir, Uwe Nestmann: Applying Concurrency Research in Industry Report on a Strategic Workshop. Bulletin of the EATCS 94: 113-129 (2008) | |
| j52 | Wan Fokkink, Jun Pang, Anton Wijs: Is Timed Branching Bisimilarity a Congruence Indeed? Fundam. Inform. 87(3-4): 287-311 (2008) | |
| j51 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Cancellation Theorem for BCCSP. Fundam. Inform. 88(1-2): 1-21 (2008) | |
| j50 | Taolue Chen, Wan Fokkink, Bas Luttik, Sumit Nain: On finite alphabets and infinite bases. Inf. Comput. 206(5): 492-519 (2008) | |
| j49 | 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) | |
| j48 | Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 75(1): 1-2 (2008) | |
| j47 | 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) | |
| j46 | Rena Bakhshi, Lucia Cloth, Wan Fokkink, Boudewijn R. Haverkort: MeanField analysis for the evaluation of gossip protocols. SIGMETRICS Performance Evaluation Review 36(3): 31-39 (2008) | |
| c39 | Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko: Towards Formal Verification of ToolBusScripts. AMAST 2008: 160-166 | |
| c38 | 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 | |
| c37 | Rena Bakhshi, Wan Fokkink, Jun Pang, Jaco van de Pol: Leader Election in Anonymous Rings: Franklin Goes Probabilistic. IFIP TCS 2008: 57-72 | |
| c36 | 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 | |
| c35 | Taolue Chen, Wan Fokkink: On the Axiomatizability of Impossible Futures: Preorder versus Equivalence. LICS 2008: 156-165 | |
| c34 | Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar: Restricted Broadcast Process Theory. SEFM 2008: 345-354 | |
| c33 | Bahareh Badban, Wan Fokkink, Jaco van de Pol: Mechanical Verification of a Two-Way Sliding Window Protocol. CPA 2008: 179-202 | |
| i5 | 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) | |
| i4 | Taolue Chen, Wan Fokkink, Rob J. van Glabbeek: On Finite Bases for Weak Semantics: Failures versus Impossible Futures. CoRR abs/0810.4904 (2008) | |
| 2007 | ||
| j45 | Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 70(2): 119-120 (2007) | |
| j44 | 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) | |
| j43 | Luca Aceto, Mario Bravetti, Wan Fokkink, Andrew D. Gordon: Guest Editors' Foreword. J. Log. Algebr. Program. 72(1): 1-2 (2007) | |
| j42 | Rena Bakhshi, François Bonnet, Wan Fokkink, Boudewijn R. Haverkort: Formal analysis techniques for gossiping protocols. Operating Systems Review 41(5): 28-36 (2007) | |
| c32 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: Ready to Preorder: Get Your BCCSP Axiomatization for Free! CALCO 2007: 65-79 | |
| c31 | Wan Fokkink, Allard Kakebeen, Jun Pang: Adapting the UPPAAL Model of a Distributed Lift System. FSEN 2007: 81-97 | |
| 2006 | ||
| j41 | 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) | |
| j40 | 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) | |
| j39 | 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) | |
| j38 | ||
| j37 | 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) | |
| j36 | 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) | |
| c30 | Taolue Chen, Wan Fokkink: On Finite Alphabets and Infinite Bases III: Simulation. CONCUR 2006: 421-434 | |
| c29 | Taolue Chen, Wan Fokkink, Sumit Nain: On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation. FoSSaCS 2006: 1-15 | |
| c28 | Luca Aceto, Taolue Chen, Wan Fokkink, Anna Ingólfsdóttir: On the Axiomatizability of Priority. ICALP (2) 2006: 480-491 | |
| c27 | 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 | |
| i3 | 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) | |
| 2005 | ||
| j35 | Luca Aceto, Wan Fokkink, Irek Ulidowski: Preface. Electr. Notes Theor. Comput. Sci. 128(1): 1- (2005) | |
| j34 | Wan Fokkink, Jun Pang: Simplifying Itai-Rodeh Leader Election for Anonymous Rings. Electr. Notes Theor. Comput. Sci. 128(6): 53-68 (2005) | |
| j33 | Wan Fokkink, Jun Pang: Formal Verification of Timed Systems Using Cones and Foci. Electr. Notes Theor. Comput. Sci. 139(1): 105-122 (2005) | |
| j32 | 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) | |
| j31 | Elena 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) | |
| j30 | 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) | |
| j29 | 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) | |
| j28 | 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) | |
| j27 | 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) | |
| c26 | 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 | |
| c25 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Sumit Nain: Bisimilarity Is Not Finitely Based over BPA with Interrupt. CALCO 2005: 52-66 | |
| c24 | 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 | |
| c23 | Wan Fokkink, Jun Pang, Anton Wijs: Is Timed Branching Bisimilarity an Equivalence Indeed?. FORMATS 2005: 258-272 | |
| c22 | ||
| c21 | Anton Wijs, Wan Fokkink: From chi-t to µCRL: Combining Performance and Functional Analysis. ICECCS 2005: 184-193 | |
| i2 | 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) | |
| 2004 | ||
| j26 | Wan Fokkink, Jan Friso Groote, Michel A. Reniers: Process Algebra Needs Proof Methodology (Columns: Concurrency). Bulletin of the EATCS 82: 109-125 (2004) | |
| j25 | 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) | |
| j24 | Luca Aceto, Wan Fokkink: Guesteditors'introduction: Special issue on Structural Operational Semantics. J. Log. Algebr. Program. 60-61: 1-2 (2004) | |
| j23 | Bard Bloom, Wan Fokkink, Rob J. van Glabbeek: Precongruence formats for decorated trace semantics. ACM Trans. Comput. Log. 5(1): 26-78 (2004) | |
| c20 | Wan Fokkink, Jan Friso Groote, Jun Pang, Bahareh Badban, Jaco van de Pol: Verifying a Sliding Window Protocol in µCRL. AMAST 2004: 148-163 | |
| c19 | Wan Fokkink, Sumit Nain: On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds. FoSSaCS 2004: 182-194 | |
| 2003 | ||
| j22 | Wan Fokkink, Thuy Duong Vu: Structural operational semantics and bounded nondeterminism. Acta Inf. 39(6-7): 501-516 (2003) | |
| j21 | ||
| j20 | 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) | |
| c18 | Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind: Compositionality of Hennessy-Milner Logic through Structural Operational Semantics. FCT 2003: 412-422 | |
| c17 | ||
| c16 | Stefan Blom, Wan Fokkink, Sumit Nain: On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces. ICALP 2003: 109-118 | |
| c15 | Jun Pang, Bart Karstens, Wan Fokkink: Analyzing the Redesign of a Distributed Lift System in UPPAAL. ICFEM 2003: 504-522 | |
| c14 | Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald Veldema: Model Checking a Cache Coherence Protocol for a Java DSM Implementation. IPDPS 2003: 238 | |
| 2002 | ||
| c13 | 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 | |
| i1 | Bard Bloom, Wan Fokkink, Rob J. van Glabbeek: Precongruence Formats for Decorated Trace Semantics. CoRR cs.LO/0204039 (2002) | |
| 2001 | ||
| j19 | ||
| c12 | 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 | |
| c11 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: 2-Nested Simulation Is Not Finitely Equationally Axiomatizable. STACS 2001: 39-50 | |
| p1 | Luca Aceto, Wan Fokkink, Chris Verhoef: Conservative Extension in Structural Operational Semantics. Current Trends in Theoretical Computer Science 2001: 504-524 | |
| 2000 | ||
| b2 | Wan Fokkink: Introduction to process algebra. Texts in theoretical computer science, Springer 2000, isbn 978-3-540-66579-3, pp. I-VIII, 1-163 | |
| j18 | Wan Fokkink: Rooted Branching Bisimulation as a Congruence. J. Comput. Syst. Sci. 60(1): 13-37 (2000) | |
| j17 | ||
| j16 | Wan Fokkink, Jasper Kamperman, Pum Walters: Lazy rewriting on eager machinery. ACM Trans. Program. Lang. Syst. 22(1): 45-86 (2000) | |
| c10 | Wan Fokkink, S. P. Luttik: An omega-Complete Equational Specification of Interleaving. ICALP 2000: 729-743 | |
| c9 | Bard Bloom, Wan Fokkink, Rob J. van Glabbeek: Precongruence Formats for Decorated Trace Preorders. LICS 2000: 107-118 | |
| 1999 | ||
| j15 | Luca Aceto, Wan Fokkink, Chris Verhoef: Conservative Extension in Structural Operational Semantics. Bulletin of the EATCS 69: 110-132 (1999) | |
| c8 | Wan Fokkink, Chris Verhoef: Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories. FASE 1999: 98-113 | |
| 1998 | ||
| j14 | Wan Fokkink, Chris Verhoef: A Conservative Look at Operational Semantics with Variable Binding. Inf. Comput. 146(1): 24-54 (1998) | |
| j13 | 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) | |
| j12 | 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) | |
| j11 | 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) | |
| c7 | Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir: A Cook's Tour of Equational Axiomatizations for Prefix Iteration. FoSSaCS 1998: 20-34 | |
| c6 | 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 | |
| 1997 | ||
| j10 | Wan Fokkink: An Axiomatization for Regular Processes in Times Branching Bisimulation. Fundam. Inform. 32(3-4): 329-340 (1997) | |
| j9 | Luca Aceto, Wan Fokkink: An Equational Axiomatization for Multi-Exit Iteration. Inf. Comput. 137(2): 121-158 (1997) | |
| j8 | Wan Fokkink: Unification for Infinite Sets of Equations Between Finite Terms. Inf. Process. Lett. 62(4): 183-188 (1997) | |
| j7 | Wan Fokkink, Hans Zantema: Termination Modulo Equations by Abstract Commutation with an Application to Iteration. Theor. Comput. Sci. 177(2): 407-423 (1997) | |
| c5 | ||
| c4 | Wan Fokkink, Jaco van de Pol: Simulation as a Correct Transformation of Rewrite Systems. MFCS 1997: 249-258 | |
| 1996 | ||
| j6 | Wan Fokkink: A Complete Axiomatization for Prefix Iteration in Branching Bisimulation. Fundam. Inform. 26(2): 103-113 (1996) | |
| j5 | Wan Fokkink, Rob J. van Glabbeek: Ntyft/Ntyxt Rules Reduce to Ntree Rules. Inf. Comput. 126(1): 1-10 (1996) | |
| j4 | 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) | |
| c3 | Wan Fokkink: On the Completeness of the Euations for the Kleene Star in Bisimulation. AMAST 1996: 180-194 | |
| 1995 | ||
| j3 | Wan Fokkink, Steven Klusener: An Effective Axiomatization for Real Time ACP. Inf. Comput. 122(2): 286-299 (1995) | |
| 1994 | ||
| j2 | Wan Fokkink, Hans Zantema: Basic Process Algebra with Iteration: Completeness of its Equational Axioms. Comput. J. 37(4): 259-268 (1994) | |
| j1 | Wan Fokkink: A Complete Equational Axiomatization for Prefix Iteration. Inf. Process. Lett. 52(6): 333-337 (1994) | |
| c2 | ||
| 1993 | ||
| c1 | ||
| 1991 | ||
| b1 | Wan Fokkink, Jan Friso Groote, Marco Hollenberg, Bas van Vlijmen: LARIS 1.0 - LAnguage for Railway Interlooking Specifications. CWI 1991, isbn 978-90-6196-489-6, pp. I-VI, 1-129 | |
Colors in the list of coauthors
Last update Wed May 22 23:03:01 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page