- Analyzing the Redesign of a Distributed Lift System in UPPAAL
- Cones and Foci for Protocol Verification Wan Fokkink1,2
- Nested Semantics over Finite Trees are Equationally Hard
- Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
- Nordic Journal of Computing A NOTE ON K-STATE SELF-STABILIZATION IN A RING
- A Finite Equational Base for CCS with Left Merge and Communication Merge
- Axiomatizing Prefix Iteration with Silent Steps BRICS, Aalborg University
- Bisimilarity is not Finitely Based over BPA with Luca Aceto c,a,,1
- Embedded Network Protocols for Mobile Devices Despo Galataki1,2
- Simulation as a Correct Transformation of Rewrite Systems
- A finite equational base for CCS with left merge and communication merge
- Divide and Congruence: From Decomposition of Modalities
- Lazy Rewriting on Eager Machinery WAN FOKKINK
- On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation
- Equational Reasoning on Ad Hoc Networks Fatemeh Ghassemi1
- Automated Translation and Analysis of a ToolBus Script for Auctions
- EPTCS ??, 20??, pp. 111. Congruence from the Operator's Point of View
- Termination Modulo Equations by Abstract Commutation with an Application to Iteration
- A relation between partitions and the number of divisors Wang Zheng Bing (Delft), Robbert Fokkink (Delft)
- Model Checking a Cache Coherence Protocol for a Java DSM Implementation Wan Fokkink1,2
- On Finite Alphabets and Infinite Bases Taolue Chen a,1
- CRL: A Toolset for Analysing Algebraic Specifications
- EPTCS ??, 20??, pp. 111. Modal Logic and the Approximation Induction Principle
- Partial Order Reduction for Branching Security Protocols Wan Fokkink
- A Complete Equational Axiomatization for Prefix Iteration
- On the Axiomatizability of Priority Luca Aceto1,2
- A Menagerie of Non-Finitely Based Process Semantics over BPA
- Adapting the UPPAAL Model of a Distributed Lift System
- Process Algebra with Recursive Operations Jan Bergstra
- Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
- Formal Verification of Timed Systems using Cones and Foci
- Design Issues for Qualitative Modelling of Biological Cells with Petri Nets
- Axiomatizations for the Perpetual Loop in Process Algebra
- Formal Analysis Techniques for Gossiping Protocols Rena Bakhshi
- Is Timed Branching Bisimilarity an Equivalence Indeed?
- A Finite Basis for Failure Semantics Wan Fokkink1,2
- Communicating Process Architectures 2008 Susan Stepney, Fiona Polack, Alistair McEwan, Peter Welch, and Wilson Ifill (Eds.)
- A Note on an Expressiveness Hierarchy for Multi-exit Iteration
- A Roel-Based Expert System In Artificial Intelligence, rule-based systems are widely used as a way to
- Under consideration for publication in Math. Struct. in Comp. Science On the Axiomatizability of Priority
- Restricted Broadcast Process Theory Fatemeh Ghassemi
- Verifying a Sliding Window Protocol in CRL Wan Fokkink1,2
- Finite Equational Bases in Process Algebra: Results and Open Questions
- EPTCS ??, 20??, pp. 118. Modal Logic and the Approximation Induction Principle
- BIOINFORMATICS Vol. 00 no. 00
- Automating the Mean-Field Method for Large Dynamic Gossip Networks
- On the Completeness of the Equations for the Kleene Star in Bisimulation
- A Complete Axiomatization for Prefix Iteration in Branching Bisimulation
- Which Two-Sorted Algebras of Booleans and Naturals have a Finite Wan Fokkink, Jaco van de Pol, and Sujith Vijay
- Fundamenta Informaticae XX (2010) 141 1 Equational Reasoning on Mobile Ad Hoc Networks
- On Finite Bases for Weak Semantics: Failures versus Impossible Futures
- Towards Performance Evaluation of Mobile Ad Hoc Network Protocols Fatemeh Ghassemi
- Conservative Extension in Structural Operational Semantics
- Ready to Preorder: The Case of Weak Process Semantics Taolue Chen
- Compositionality of Hennessy-Milner Logic by Structural Operational Semantics
- Precongruence Formats for Decorated Trace IBM T.J. Watson Research Center
- What can Formal Methods bring to Systems Biology? Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, and Elzbieta Krepska
- A High-Level Framework for Distributed Processing of Large-Scale Graphs
- Brief Announcement: A Shared Disk on Distributed Storage
- Brief Announcement: Asynchronous Bounded Expected Delay Networks
- Leader Election in Anonymous Rings: Franklin Goes Probabilistic
- Verification of Mobile Ad Hoc Networks: An Algebraic Approach
- Mean-Field Analysis for the Evaluation of Gossip Protocols
- An Analytical Model of Information Dissemination for a Gossip-based Protocol
- Mean-Field Analysis for the Evaluation of Gossip Protocols Rena Bakhshi1
- FTRepMI: Fault-tolerant, Sequentially-consistent Object Replication for Grid Applications
- Towards Formal Verification of ToolBus Scripts Wan Fokkink2,1
- Cones and Foci: A Mechanical Framework for Protocol Verification
- EPTCS ??, 20??, pp. 14. Turning GSOS Rules into Equations
- CONSERVATIVE EXTENSION IN STRUCTURAL OPERATIONAL SEMANTICS
- Structural Operational Semantics Wan Fokkink
- Language Preorder as a Precongruence Wan Fokkink
- Precongruence Formats for Decorated Trace Preorders IBM T.J. Watson Research Center
- Rooted Branching Bisimulation as a Congruence Wan Fokkink
- Ntyft/ntyxt Rules Reduce to Ntree Rules Wan Fokkink
- Process Algebra: An Algebraic Theory of Concurrency Wan Fokkink
- Fundamenta Informaticae XX (2008) 120 1 A Cancellation Theorem for BCCSP
- On the Axiomatizability of Impossible Futures: Preorder versus Equivalence
- Computing with Actions and Communications Wan Fokkink1,2
- The Quest for Equational Axiomatizations of Parallel Composition: Status and Open
- On Finite Alphabets and Infinite Bases III: Taolue Chen1,2
- Bisimilarity is not Finitely Based over BPA with Interrupt
- CCS with Hennessy's Merge has no Finite Equational Axiomatization
- On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
- On the Axiomatizability of Ready Traces, Ready Simulation and Failure Traces
- Basic Process Algebra with Iteration: Completeness of its Equational Axioms
- Fundamenta Informaticae XX (2008) 125 1 Is Timed Branching Bisimilarity a Congruence Indeed?
- Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications
- LAnguage for Railway Interlocking Specifications
- EURIS, a Specification Method for Distributed Interlockings
- Verification of Interlockings: from Control Tables to Ladder Logic Diagrams
- Safety criteria for the vital processor interlocking at HoornKersenboogerd
- Clocks, Trees and Stars in Process Theory
- The Systems Validation Centre in Retrospect Henk Eertink (Telematica Instituut) Wan Fokkink (CWI)
- An Analytical Model of Information Dissemination for a Gossip-based Protocol
- Acta Informatica manuscript No. (will be inserted by the editor)
- On a Question of A. Salomaa The Equational Theory of Regular Expressions
- Under consideration for publication in Formal Aspects of Computing Verification of a Sliding Window
- t to CRL: Combining Performance and Functional Analysis CWI, Department of Software Engineering,
- Divide and Congruence Applied to -Bisimulation
- Fast computation of an alternating sum Robbert Fokkink
- Unification for Infinite Sets of Equations Between Finite Terms
- HipG: Parallel Processing of Large-Scale Graphs Elzbieta Krepska, Thilo Kielmann, Wan Fokkink, Henri Bal
- Model Checking a Cache Coherence Protocol of a Java DSM Implementation
- Simplifying Itai-Rodeh Leader Election for Anonymous Rings
- Prof. De Bakker, or How I Learned to Stop Worrying and Love the Boss
- Mean-field Framework for Performance Evaluation of Push-Pull Gossip Protocols
- Structural Operational Semantics and Bounded Nondeterminism
- Supplementary Information List of experiments
- An Equational Axiomatization for Multi-Exit Iteration Department of Computer Science
- Ready to Preorder: Get Your BCCSP Axiomatization for Free!
- Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
- A Conservative Look at Operational Semantics with Variable Binding
- Stochastic Restricted Broadcast Process Theory Fatemeh Ghassemi1,2
- Analysis of Gossip-based Information Propagation in Wireless Mesh Networks
- A Modeling Framework for Gossip-based Information Spread
- Estimating Uncertainty of Categorical Web Data Davide Ceolin, Willem Robert van Hage, Wan Fokkink, and Guus Schreiber
- Divide and Congruence: From Decomposition of Modal Formulas
- Automated Evaluation of Annotators for Museum Collections using Subjective Logic
- Some Trends in Formal Methods Applications to Railway Signaling