Wan Fokkink
According to our database1,
Wan Fokkink
authored at least 186 papers
between 1991 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:
-
at www.cs.vu.nl
On csauthors.net:
Bibliography
2019
Reliable Restricted Process Theory.
Fundam. Inform., 2019
2017
Multi-valued Simulation and Abstraction Using Lattice Operations.
ACM Trans. Embedded Comput. Syst., 2017
Model-based design of supervisory controllers for baggage handling systems.
Simulation Modelling Practice and Theory, 2017
Divide and congruence II: From decomposition of modal formulas to preservation of delay and weak bisimilarity.
Inf. Comput., 2017
Maximally permissive controlled system synthesis for non-determinism and modal logic.
Discrete Event Dynamic Systems, 2017
Reliable Restricted Process Theory.
CoRR, 2017
Detecting Useless Transitions in Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2017
Creating Büchi Automata for Multi-valued Model Checking.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2017
Precongruence Formats with Lookahead through Modal Decomposition.
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017
Divide and Congruence III: Stability & Divergence.
Proceedings of the 28th International Conference on Concurrency Theory, 2017
2016
Formal specification and verification of TCP extended with the Window Scale Option.
Sci. Comput. Program., 2016
Combining User Reputation and Provenance Analysis for Trust Assessment.
J. Data and Information Quality, 2016
Model checking mobile ad hoc networks.
Formal Methods in System Design, 2016
Divide and Congruence II: From Decomposition of Modal Formulas to Preservation of Delay and Weak Bisimilarity.
CoRR, 2016
Why is my supervisor empty? Finding causes for the unreachability of states in synthesized supervisors.
Proceedings of the 13th International Workshop on Discrete Event Systems, 2016
Divide and Congruence II: Delay and Weak Bisimilarity.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
2015
Maximal Synthesis for Hennessy-Milner Logic.
ACM Trans. Embedded Comput. Syst., 2015
On the Axiomatizability of Impossible Futures.
Logical Methods in Computer Science, 2015
Maximally Permissive Controlled System Synthesis for Modal Logic.
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
Predicting Quality of Crowdsourced Annotations Using Graph Kernels.
Proceedings of the Trust Management IX - 9th IFIP WG 11.11 International Conference, 2015
Multi-valued Abstraction Using Lattice Operations.
Proceedings of the 15th International Conference on Application of Concurrency to System Design, 2015
2014
Maximally Permissive Controlled System Synthesis for Modal Logic.
CoRR, 2014
Maximal Synthesis for Hennessy-Milner Logic with the Box Modality.
Proceedings of the 12th International Workshop on Discrete Event Systems, 2014
CIF 3: Model-Based Engineering of Supervisory Controllers.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2014
Automated Evaluation of Crowdsourced Annotations in the Cultural Heritage Domain.
Proceedings of the 10th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2014) co-located with the 13th International Semantic Web Conference (ISWC 2014), 2014
Towards the Definition of an Ontology for Trust in (Web) Data.
Proceedings of the 10th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2014) co-located with the 13th International Semantic Web Conference (ISWC 2014), 2014
Bridging Gaps Between Subjective Logic and Semantic Web.
Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014
Uncertainty Estimation and Analysis of Categorical Web Data.
Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014
Analyzing User Demographics and User Behavior for Trust Assessment.
Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014
Two Procedures for Analyzing the Reliability of Open Government Data.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014
Petri Nets Are a Biologist's Best Friend.
Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014
Formal Specification and Verification of TCP Extended with the Window Scale Option.
Proceedings of the Formal Methods for Industrial Critical Systems, 2014
Bonsai: Cutting Models Down to Size.
Proceedings of the Perspectives of System Informatics, 2014
2013
Detecting Useless Transitions in Pushdown Automata.
CoRR, 2013
Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics.
Comput. J., 2013
Personalized Nichesourcing: Acquisition of Qualitative Annotations from Niche Communities.
Proceedings of the Late-Breaking Results, 2013
Reliability Analyses of Open Government Data.
Proceedings of the 9th International Workshop on Uncertainty Reasoning for the Semantic Web co-located with the 12th International Semantic Web Conference (ISWC 2013), 2013
Semi-automated assessment of annotation trustworthiness.
Proceedings of the Eleventh Annual International Conference on Privacy, Security and Trust, 2013
Model Checking MANETs with Arbitrary Mobility.
Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013
Maximal Synthesis for Hennessy-Milner Logic.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013
Assessing Trust for Determining the Reliability of Information.
Proceedings of the Situation Awareness with Systems of Systems, 2013
2012
Modal logic and the approximation induction principle.
Mathematical Structures in Computer Science, 2012
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity.
Inf. Comput., 2012
Subjective Logic Extensions for the Semantic Web.
Proceedings of the 8th International Workshop on Uncertainty Reasoning for the Semantic Web, 2012
Trust Evaluation through User Reputation and Provenance Analysis.
Proceedings of the 8th International Workshop on Uncertainty Reasoning for the Semantic Web, 2012
Automated Evaluation of Annotators for Museum Collections Using Subjective Logic.
Proceedings of the Trust Management VI - 6th IFIP WG 11.11 International Conference, 2012
Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012
Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012
Using Model Checking to Analyze the System Behavior of the LHC Production Grid.
Proceedings of the 12th IEEE/ACM International Symposium on Cluster, 2012
2011
Verification of mobile ad hoc networks: An algebraic approach.
Theor. Comput. Sci., 2011
HipG: parallel processing of large-scale graphs.
Operating Systems Review, 2011
Mean-field framework for performance evaluation of push-pull gossip protocols.
Perform. Eval., 2011
Fast leader election in anonymous rings with bounded expected delay.
Inf. Process. Lett., 2011
Distributed MAP in the SpinJa Model Checker
Proceedings of the Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, 2011
A Modeling Framework for Gossip-based Information Spread
CoRR, 2011
Estimating Uncertainty of Categorical Web Data.
Proceedings of the 7th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2011), 2011
A Modeling Framework for Gossip-based Information Spread.
Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011
A High-Level Framework for Distributed Processing of Large-Scale Graphs.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011
Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks.
Proceedings of the Computer Performance Engineering, 2011
Stochastic Restricted Broadcast Process Theory.
Proceedings of the Computer Performance Engineering, 2011
2010
Equational Reasoning on Mobile Ad Hoc Networks.
Fundam. Inform., 2010
Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics
Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010
Asynchronous Bounded Expected Delay Networks
CoRR, 2010
Lifting non-finite axiomatizability results to extensions of process algebras.
Acta Inf., 2010
Automating the Mean-Field Method for Large Dynamic Gossip Networks.
Proceedings of the QEST 2010, 2010
Brief announcement: a shared disk on distributed storage.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Brief announcement: asynchronous bounded expected delay networks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Embedded Network Protocols for Mobile Devices.
Proceedings of the Formal Methods for Industrial Critical Systems, 2010
Towards Performance Evaluation of Mobile Ad Hoc Network Protocols.
Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010
Partial Order Reduction for Branching Security Protocols.
Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010
2009
A finite equational base for CCS with left merge and communication merge.
ACM Trans. Comput. Log., 2009
Preface.
J. Log. Algebr. Program., 2009
Modal Logic and the Approximation Induction Principle
Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009
An analytical model of information dissemination for a gossip-based protocol.
Computer Networks, 2009
Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development.
Bioinformatics, 2009
Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development.
Bioinformatics, 2009
On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.
Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009
Mean-Field Analysis for the Evaluation of Gossip Protocols.
Proceedings of the QEST 2009, 2009
FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009
An Analytical Model of Information Dissemination for a Gossip-Based Protocol.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009
Equational Reasoning on Ad Hoc Networks.
Proceedings of the Fundamentals of Software Engineering, 2009
Automated Translation and Analysis of a ToolBus Script for Auctions.
Proceedings of the Fundamentals of Software Engineering, 2009
What Can Formal Methods Bring to Systems Biology?
Proceedings of the FM 2009: Formal Methods, 2009
Process Algebra: An Algebraic Theory of Concurrency.
Proceedings of the Algebraic Informatics, Third International Conference, 2009
2008
MeanField analysis for the evaluation of gossip protocols.
SIGMETRICS Performance Evaluation Review, 2008
On the axiomatisability of priority.
Mathematical Structures in Computer Science, 2008
Guest Editors' Foreword.
J. Log. Algebr. Program., 2008
Ready to preorder: The case of weak process semantics.
Inf. Process. Lett., 2008
On finite alphabets and infinite bases.
Inf. Comput., 2008
Is Timed Branching Bisimilarity a Congruence Indeed?
Fundam. Inform., 2008
A Cancellation Theorem for BCCSP.
Fundam. Inform., 2008
Applying Concurrency Research in Industry Report on a Strategic Workshop.
Bulletin of the EATCS, 2008
On Finite Bases for Weak Semantics: Failures versus Impossible Futures
CoRR, 2008
An Analytical Model of Information Dissemination for a Gossip-based Protocol
CoRR, 2008
Mechanical Verification of a Two-Way Sliding Window Protocol.
Proceedings of the thirty-first Communicating Process Architectures Conference, 2008
Restricted Broadcast Process Theory.
Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008
On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008
Leader Election in Anonymous Rings: Franklin Goes Probabilistic.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008
Design Issues for Qualitative Modelling of Biological Cells with Petri Nets.
Proceedings of the Formal Methods in Systems Biology, First International Workshop, 2008
Towards Formal Verification of ToolBusScripts.
Proceedings of the Algebraic Methodology and Software Technology, 2008
2007
Modelling Distributed Systems
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-73938-8, 2007
Formal analysis techniques for gossiping protocols.
Operating Systems Review, 2007
Model checking a cache coherence protocol of a Java DSM implementation.
J. Log. Algebr. Program., 2007
Guest Editors' Foreword.
J. Log. Algebr. Program., 2007
Guest Editors' Foreword.
J. Log. Algebr. Program., 2007
Adapting the UPPAAL Model of a Distributed Lift System.
Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007
Ready to Preorder: Get Your BCCSP Axiomatization for Free!
Proceedings of the Algebra and Coalgebra in Computer Science, 2007
2006
Compositionality of Hennessy-Milner logic by structural operational semantics.
Theor. Comput. Sci., 2006
Bisimilarity is not finitely based over BPA with interrupt.
Theor. Comput. Sci., 2006
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM.
J. UCS, 2006
Cones and foci: A mechanical framework for protocol verification.
Formal Methods in System Design, 2006
Divide and Congruence Applied to eta-Bisimulation.
Electr. Notes Theor. Comput. Sci., 2006
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.
Electr. Notes Theor. Comput. Sci., 2006
A Finite Equational Base for CCS with Left Merge and Communication Merge
CoRR, 2006
A Finite Equational Base for CCS with Left Merge and Communication Merge.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
On the Axiomatizability of Priority.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.
Proceedings of the Foundations of Software Science and Computation Structures, 2006
On Finite Alphabets and Infinite Bases III: Simulation.
Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006
2005
CCS with Hennessy's merge has no finite-equational axiomatization.
Theor. Comput. Sci., 2005
Guest editors' foreword: Process Algebra.
Theor. Comput. Sci., 2005
A Note on K-State Self-stabilization in a Ring with K=N.
Nord. J. Comput., 2005
Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.
Logical Methods in Computer Science, 2005
Analyzing a chi model of a turntable system using Spin, CADP and Uppaal.
J. Log. Algebr. Program., 2005
Verification of a sliding window protocol in µCRL and PVS.
Formal Asp. Comput., 2005
Formal Verification of Timed Systems Using Cones and Foci.
Electr. Notes Theor. Comput. Sci., 2005
Simplifying Itai-Rodeh Leader Election for Anonymous Rings.
Electr. Notes Theor. Comput. Sci., 2005
Preface.
Electr. Notes Theor. Comput. Sci., 2005
Split-2 Bisimilarity has a Finite Axiomatization over CCS with Hennessy's Merge
CoRR, 2005
From chi-t to µCRL: Combining Performance and Functional Analysis.
Proceedings of the 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 2005
A Finite Basis for Failure Semantics.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Is Timed Branching Bisimilarity an Equivalence Indeed?.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation.
Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005
Bisimilarity Is Not Finitely Based over BPA with Interrupt.
Proceedings of the Algebra and Coalgebra in Computer Science: First International Conference, 2005
Finite Equational Bases in Process Algebra: Results and Open Questions.
Proceedings of the Processes, 2005
2004
Precongruence formats for decorated trace semantics.
ACM Trans. Comput. Log., 2004
Guesteditors'introduction: Special issue on Structural Operational Semantics.
J. Log. Algebr. Program., 2004
Nested semantics over finite trees are equationally hard.
Inf. Comput., 2004
Process Algebra Needs Proof Methodology (Columns: Concurrency).
Bulletin of the EATCS, 2004
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.
Proceedings of the Foundations of Software Science and Computation Structures, 2004
Verifying a Sliding Window Protocol in µCRL.
Proceedings of the Algebraic Methodology and Software Technology, 2004
2003
A note on an expressiveness hierarchy for multi-exit iteration.
Inf. Process. Lett., 2003
Preface.
Electr. Notes Theor. Comput. Sci., 2003
Structural operational semantics and bounded nondeterminism.
Acta Inf., 2003
Model Checking a Cache Coherence Protocol for a Java DSM Implementation.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003
Analyzing the Redesign of a Distributed Lift System in UPPAAL.
Proceedings of the Formal Methods and Software Engineering, 2003
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Cones and Foci for Protocol Verification Revisited.
Proceedings of the Foundations of Software Science and Computational Structures, 2003
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003
2002
Precongruence Formats for Decorated Trace Semantics
CoRR, 2002
Refinement and Verification Applied to an In-Flight Data Acquisition Unit.
Proceedings of the CONCUR 2002, 2002
2001
Preface: Process Algebra.
Inf. Process. Lett., 2001
2-Nested Simulation Is Not Finitely Equationally Axiomatizable.
Proceedings of the STACS 2001, 2001
µCRL: A Toolset for Analysing Algebraic Specifications.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001
Conservative Extension in Structural Operational Semantics.
Current Trends in Theoretical Computer Science, 2001
2000
Lazy rewriting on eager machinery.
ACM Trans. Program. Lang. Syst., 2000
Language preorder as a precongruence.
Theor. Comput. Sci., 2000
Rooted Branching Bisimulation as a Congruence.
J. Comput. Syst. Sci., 2000
Precongruence Formats for Decorated Trace Preorders.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000
An omega-Complete Equational Specification of Interleaving.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Introduction to Process Algebra.
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04293-9, 2000
1999
Conservative Extension in Structural Operational Semantics.
Bulletin of the EATCS, 1999
Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories.
Proceedings of the Fundamental Approaches to Software Engineering, 1999
1998
Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems.
ACM Trans. Program. Lang. Syst., 1998
On a Question of A. Salomaa: The Equational Theory of Regular Expressions Over a Singleton Alphabet is not Finitely Based.
Theor. Comput. Sci., 1998
A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.
Mathematical Structures in Computer Science, 1998
A Conservative Look at Operational Semantics with Variable Binding.
Inf. Comput., 1998
EURIS, a Specification Method for Distributed Interlockings.
Proceedings of the Computer Safety, 1998
A Cook's Tour of Equational Axiomatizations for Prefix Iteration.
Proceedings of the Foundations of Software Science and Computation Structure, 1998
1997
Termination Modulo Equations by Abstract Commutation with an Application to Iteration.
Theor. Comput. Sci., 1997
Unification for Infinite Sets of Equations Between Finite Terms.
Inf. Process. Lett., 1997
An Equational Axiomatization for Multi-Exit Iteration.
Inf. Comput., 1997
An Axiomatization for Regular Processes in Times Branching Bisimulation.
Fundam. Inform., 1997
Simulation as a Correct Transformation of Rewrite Systems.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
Axiomatizations for the Perpetual Loop in Process Algebra.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997
1996
Algebra of timed frames.
Int. J. Comput. Math., 1996
Ntyft/Ntyxt Rules Reduce to Ntree Rules.
Inf. Comput., 1996
Axiomatizing Prefix Iteration with Silent Steps.
Inf. Comput., 1996
A Complete Axiomatization for Prefix Iteration in Branching Bisimulation.
Fundam. Inform., 1996
On the Completeness of the Euations for the Kleene Star in Bisimulation.
Proceedings of the Algebraic Methodology and Software Technology, 1996
1995
An Effective Axiomatization for Real Time ACP.
Inf. Comput., 1995
1994
A Complete Equational Axiomatization for Prefix Iteration.
Inf. Process. Lett., 1994
Basic Process Algebra with Iteration: Completeness of its Equational Axioms.
Comput. J., 1994
The Tyft/Tyxt Format Reduces to Tree Rules.
Proceedings of the Theoretical Aspects of Computer Software, 1994
1993
An Elimination Theorem for Regular Behaviours with Integration.
Proceedings of the CONCUR '93, 1993
1991
LARIS 1.0 - LAnguage for Railway Interlooking Specifications.
CWI, ISBN: 978-90-6196-489-6, 1991