Wan J. Fokkink

Valentina Maccatrozzo

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.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014

Uncertainty Estimation and Analysis of Categorical Web Data.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014

Analyzing User Demographics and User Behavior for Trust Assessment.

[BibT_eX]

[DOI]

Paul Groth

Proceedings of the Uncertainty Reasoning for the Semantic Web III, 2014

Two Procedures for Analyzing the Reliability of Open Government Data.

[BibT_eX]

[DOI]

Valentina Maccatrozzo

Alistair Sackley

Nigel Shadbolt

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2014

Petri Nets Are a Biologist's Best Friend.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Macro-Biology - First International Conference, 2014

Bonsai: Cutting Models Down to Size.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 2014

2013

Detecting Useless Transitions in Pushdown Automata.

[BibT_eX]

[DOI]

CoRR, 2013

Turning GSOS Rules into Equations for Linear Time-Branching Time Semantics.

[BibT_eX]

[DOI]

Maciej Gazda

Comput. J., 2013

Personalized Nichesourcing: Acquisition of Qualitative Annotations from Niche Communities.

[BibT_eX]

[DOI]

Chris Dijkshoorn

Mieke H. R. Leyssen

Jacco van Ossenbruggen

Jan Wielemaker

Proceedings of the Late-Breaking Results, 2013

Reliability Analyses of Open Government Data.

[BibT_eX]

[DOI]

Nigel Shadbolt

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.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual International Conference on Privacy, Security and Trust, 2013

Model Checking MANETs with Arbitrary Mobility.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering - 5th International Conference, 2013

Assessing Trust for Determining the Reliability of Information.

[BibT_eX]

[DOI]

Proceedings of the Situation Awareness with Systems of Systems, 2013

2012

Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Subjective Logic Extensions for the Semantic Web.

[BibT_eX]

[DOI]

Proceedings of the 8th International Workshop on Uncertainty Reasoning for the Semantic Web, 2012

Trust Evaluation through User Reputation and Provenance Analysis.

[BibT_eX]

[DOI]

Paul Groth

Proceedings of the 8th International Workshop on Uncertainty Reasoning for the Semantic Web, 2012

Automated Evaluation of Annotators for Museum Collections Using Subjective Logic.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

David M. Williams

Joeri de Ruiter

Proceedings of the Theoretical Aspects of Computing - ICTAC 2012, 2012

Compositionality of Probabilistic Hennessy-Milner Logic through Structural Operational Semantics.

[BibT_eX]

[DOI]

Daniel Gebler

Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Using Model Checking to Analyze the System Behavior of the LHC Production Grid.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE/ACM International Symposium on Cluster, 2012

2011

Verification of mobile ad hoc networks: An algebraic approach.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

HipG: parallel processing of large-scale graphs.

[BibT_eX]

[DOI]

ACM SIGOPS Oper. Syst. Rev., 2011

Mean-field framework for performance evaluation of push-pull gossip protocols.

[BibT_eX]

[DOI]

Lucia Cloth

Perform. Evaluation, 2011

Fast leader election in anonymous rings with bounded expected delay.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Distributed MAP in the SpinJa Model Checker

[BibT_eX]

[DOI]

Proceedings of the Proceedings 10th International Workshop on Parallel and Distributed Methods in verifiCation, 2011

Estimating Uncertainty of Categorical Web Data.

[BibT_eX]

[DOI]

Proceedings of the 7th International Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2011), 2011

A Modeling Framework for Gossip-based Information Spread.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011

A High-Level Framework for Distributed Processing of Large-Scale Graphs.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

Analysis of Gossip-Based Information Propagation in Wireless Mesh Networks.

[BibT_eX]

[DOI]

Abolhassan Shamsaie

Jafar Habibi

Proceedings of the Computer Performance Engineering, 2011

Stochastic Restricted Broadcast Process Theory.

[BibT_eX]

[DOI]

Proceedings of the Computer Performance Engineering, 2011

2010

Equational Reasoning on Mobile Ad Hoc Networks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Congruence from the Operator's Point of View: Compositionality Requirements on Process Semantics

[BibT_eX]

[DOI]

Maciej Gazda

Proceedings of the Proceedings Seventh Workshop on Structural Operational Semantics, 2010

Asynchronous Bounded Expected Delay Networks

[BibT_eX]

[DOI]

CoRR, 2010

Lifting non-finite axiomatizability results to extensions of process algebras.

[BibT_eX]

[DOI]

Mohammad Reza Mousavi

Acta Informatica, 2010

Automating the Mean-Field Method for Large Dynamic Gossip Networks.

[BibT_eX]

[DOI]

Proceedings of the QEST 2010, 2010

Brief announcement: a shared disk on distributed storage.

[BibT_eX]

[DOI]

Stefan Vijzelaar

Herbert Bos

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Brief announcement: asynchronous bounded expected delay networks.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Embedded Network Protocols for Mobile Devices.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Industrial Critical Systems, 2010

Towards Performance Evaluation of Mobile Ad Hoc Network Protocols.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Application of Concurrency to System Design, 2010

Partial Order Reduction for Branching Security Protocols.

[BibT_eX]

[DOI]

Mohammad Torabi Dashti

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.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2009

Preface.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2009

Modal Logic and the Approximation Induction Principle

[BibT_eX]

[DOI]

Maciej Gazda

Proceedings of the Proceedings 16th International Workshop on Expressiveness in Concurrency, 2009

An analytical model of information dissemination for a gossip-based protocol.

[BibT_eX]

[DOI]

Comput. Networks, 2009

Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development.

[BibT_eX]

[DOI]

Bioinform., 2009

Executing multicellular differentiation: quantitative predictive modelling of C.elegans vulval development.

[BibT_eX]

[DOI]

Bioinform., 2009

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Mean-Field Analysis for the Evaluation of Gossip Protocols.

[BibT_eX]

[DOI]

Lucia Cloth

Proceedings of the QEST 2009, 2009

FTRepMI: Fault-Tolerant, Sequentially-Consistent Object Replication for Grid Applications.

[BibT_eX]

[DOI]

Ana-Maria Oprescu

Thilo Kielmann

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Equational Reasoning on Ad Hoc Networks.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering, 2009

Automated Translation and Analysis of a ToolBus Script for Auctions.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Software Engineering, 2009

What Can Formal Methods Bring to Systems Biology?

[BibT_eX]

[DOI]

Proceedings of the FM 2009: Formal Methods, 2009

Process Algebra: An Algebraic Theory of Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

MeanField analysis for the evaluation of gossip protocols.

[BibT_eX]

[DOI]

Lucia Cloth

SIGMETRICS Perform. Evaluation Rev., 2008

On the axiomatisability of priority.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

Ready to preorder: The case of weak process semantics.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On finite alphabets and infinite bases.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Is Timed Branching Bisimilarity a Congruence Indeed?

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

A Cancellation Theorem for BCCSP.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Applying Concurrency Research in Industry Report on a Strategic Workshop.

[BibT_eX]

Bull. EATCS, 2008

Mechanical Verification of a Two-Way Sliding Window Protocol.

[BibT_eX]

[DOI]

Bahareh Badban

Jaco van de Pol

Proceedings of the thirty-first Communicating Process Architectures Conference, 2008

Restricted Broadcast Process Theory.

[BibT_eX]

[DOI]

Proceedings of the Sixth IEEE International Conference on Software Engineering and Formal Methods, 2008

On the Axiomatizability of Impossible Futures: Preorder versus Equivalence.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

Leader Election in Anonymous Rings: Franklin Goes Probabilistic.

[BibT_eX]

[DOI]

Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Design Issues for Qualitative Modelling of Biological Cells with Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods in Systems Biology, First International Workshop, 2008

Towards Formal Verification of ToolBusScripts.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2008

2007

Modelling Distributed Systems

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-540-73938-8, 2007

Formal analysis techniques for gossiping protocols.

[BibT_eX]

[DOI]

François Bonnet

ACM SIGOPS Oper. Syst. Rev., 2007

Model checking a cache coherence protocol of a Java DSM implementation.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

Guest Editors' Foreword.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2007

Adapting the UPPAAL Model of a Distributed Lift System.

[BibT_eX]

[DOI]

Allard Kakebeen

Proceedings of the International Symposium on Fundamentals of Software Engineering, 2007

Ready to Preorder: Get Your BCCSP Axiomatization for Free!

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

2006

Compositionality of Hennessy-Milner logic by structural operational semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Bisimilarity is not finitely based over BPA with interrupt.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2006

Cones and foci: A mechanical framework for protocol verification.

[BibT_eX]

[DOI]

Jaco van de Pol

Formal Methods Syst. Des., 2006

On the Axiomatizability of Priority.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2006

On Finite Alphabets and Infinite Bases III: Simulation.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2006 - Concurrency Theory, 17th International Conference, 2006

2005

CCS with Hennessy's merge has no finite-equational axiomatization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Guest editors' foreword: Process Algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Note on K-State Self-stabilization in a Ring with K=N.

[BibT_eX]

Jaap-Henk Hoepman

Joanna M. van de Mortel-Fronczak

Nord. J. Comput., 2005

Split-2 bisimilarity has a finite axiomatization over CCS with Hennessy's merge.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2005

Analyzing a chi model of a turntable system using Spin, CADP and Uppaal.

[BibT_eX]

[DOI]

Jos C. M. Baeten

Jacobus E. Rooda

J. Log. Algebraic Methods Program., 2005

Verification of a sliding window protocol in µCRL and PVS.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2005

Divide and Congruence Applied to eta-Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the Second Workshop on Structural Operational Semantics, 2005

The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

From chi-t to µCRL: Combining Performance and Functional Analysis.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Engineering of Complex Computer Systems (ICECCS 2005), 2005

A Finite Basis for Failure Semantics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Is Timed Branching Bisimilarity an Equivalence Indeed?.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2005

Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the Formal Methods for Components and Objects, 4th International Symposium, 2005

Finite Equational Bases in Process Algebra: Results and Open Questions.

[BibT_eX]

[DOI]

Proceedings of the Processes, 2005

2004

Precongruence formats for decorated trace semantics.

[BibT_eX]

[DOI]

Bard Bloom

ACM Trans. Comput. Log., 2004

Guesteditors'introduction: Special issue on Structural Operational Semantics.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2004

Nested semantics over finite trees are equationally hard.

[BibT_eX]

[DOI]

Inf. Comput., 2004

Formal Verification of Timed Systems Using Cones and Foci.

[BibT_eX]

[DOI]

Proceedings of the 6th AMAST Workshop on Real-Time Systems, 2004

Simplifying Itai-Rodeh Leader Election for Anonymous Rings.

[BibT_eX]

[DOI]

Proceedings of the Fouth International Workshop on Automated Verification of Critical Systems, 2004

Preface.

[BibT_eX]

[DOI]

Irek Ulidowski

Proceedings of the Workshop on Structural Operational Semantics, 2004

Process Algebra Needs Proof Methodology (Columns: Concurrency).

[BibT_eX]

[DOI]

Jan Friso Groote

Michel A. Reniers

Bull. EATCS, 2004

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

Verifying a Sliding Window Protocol in µCRL.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2004

2003

A note on an expressiveness hierarchy for multi-exit iteration.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Preface.

[BibT_eX]

[DOI]

Thomas Arts

Proceedings of the Eighth International Workshop on Formal Methods for Industrial Critical Systems, 2003

Structural operational semantics and bounded nondeterminism.

[BibT_eX]

[DOI]

Thuy Duong Vu

Acta Informatica, 2003

Analyzing the Redesign of a Distributed Lift System in UPPAAL.

[BibT_eX]

[DOI]

Bart Karstens

Proceedings of the Formal Methods and Software Engineering, 2003

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.

[BibT_eX]

[DOI]

Stefan Blom

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Cones and Foci for Protocol Verification Revisited.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2003

Compositionality of Hennessy-Milner Logic through Structural Operational Semantics.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Refinement and Verification Applied to an In-Flight Data Acquisition Unit.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2002, 2002

2001

Preface: Process Algebra.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

2-Nested Simulation Is Not Finitely Equationally Axiomatizable.

[BibT_eX]

[DOI]

Proceedings of the STACS 2001, 2001

µCRL: A Toolset for Analysing Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Conservative Extension in Structural Operational Semantics.

[BibT_eX]

Proceedings of the Current Trends in Theoretical Computer Science, 2001

Process Algebra with Recursive Operations.

[BibT_eX]

[DOI]

Jan A. Bergstra

Alban Ponse

Proceedings of the Handbook of Process Algebra, 2001

Structural Operational Semantics.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Process Algebra, 2001

2000

Lazy rewriting on eager machinery.

[BibT_eX]

[DOI]

Jasper Kamperman

Pum Walters

ACM Trans. Program. Lang. Syst., 2000

Language preorder as a precongruence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Rooted Branching Bisimulation as a Congruence.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2000

Precongruence Formats for Decorated Trace Preorders.

[BibT_eX]

[DOI]

Bard Bloom

Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

An omega-Complete Equational Specification of Interleaving.

[BibT_eX]

[DOI]

S. P. Luttik

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

LARIS 1.0 - LAnguage for Railway Interlooking Specifications.

[BibT_eX]

[DOI]

CWI, ISBN: 978-90-6196-489-6, 2000

Introduction to Process Algebra.

[BibT_eX]

[DOI]

Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04293-9, 2000

1999

Conservative Extension in Structural Operational Semantics.

[BibT_eX]

Bull. EATCS, 1999

Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories.

[BibT_eX]

[DOI]

Proceedings of the Fundamental Approaches to Software Engineering, 1999

1998

Within ARM's Reach: Compilation of Left-Linear Rewrite Systems via Minimal Rewrite Systems.

[BibT_eX]

[DOI]

Jasper Kamperman

Pum Walters

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

A Menagerie of NonFfinitely Based Process Semantics over BPA* - From Ready Simulation to Completed Traces.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1998

A Conservative Look at Operational Semantics with Variable Binding.

[BibT_eX]

[DOI]

Inf. Comput., 1998

EURIS, a Specification Method for Distributed Interlockings.

[BibT_eX]

[DOI]

Proceedings of the Computer Safety, 1998

A Cook's Tour of Equational Axiomatizations for Prefix Iteration.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997

Termination Modulo Equations by Abstract Commutation with an Application to Iteration.

[BibT_eX]

[DOI]

Hans Zantema

Theor. Comput. Sci., 1997

Unification for Infinite Sets of Equations Between Finite Terms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

An Equational Axiomatization for Multi-Exit Iteration.

[BibT_eX]

[DOI]

Inf. Comput., 1997

An Axiomatization for Regular Processes in Times Branching Bisimulation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Simulation as a Correct Transformation of Rewrite Systems.

[BibT_eX]

[DOI]

Jaco van de Pol

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Axiomatizations for the Perpetual Loop in Process Algebra.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Algebra of timed frames.

[BibT_eX]

[DOI]

Jan A. Bergstra

Cornelis A. Middelburg

Int. J. Comput. Math., 1996

Ntyft/Ntyxt Rules Reduce to Ntree Rules.

[BibT_eX]

[DOI]

Inf. Comput., 1996

Axiomatizing Prefix Iteration with Silent Steps.

[BibT_eX]

[DOI]

Inf. Comput., 1996

A Complete Axiomatization for Prefix Iteration in Branching Bisimulation.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

On the Completeness of the Euations for the Kleene Star in Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1996

1995

An Effective Axiomatization for Real Time ACP.

[BibT_eX]

[DOI]

Steven Klusener

Inf. Comput., 1995

1994

A Complete Equational Axiomatization for Prefix Iteration.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

Basic Process Algebra with Iteration: Completeness of its Equational Axioms.

[BibT_eX]

[DOI]

Hans Zantema

Comput. J., 1994

The Tyft/Tyxt Format Reduces to Tree Rules.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computer Software, 1994

1993

An Elimination Theorem for Regular Behaviours with Integration.

[BibT_eX]

[DOI]