Franck van Breugel

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

2021

Computing Probabilistic Bisimilarity Distances for Probabilistic Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2021

Probabilistic Model Checking of Randomized Java Code.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software - 27th International Symposium, 2021

2020

Deciding probabilistic bisimilarity distance one for probabilistic automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

2018

Deciding Probabilistic Bisimilarity Distance One for Labelled Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Probabilistic bisimilarity distances.

[BibT_eX]

[DOI]

ACM SIGLOG News, 2017

ArtForm: a tool for exploring the codebase of form-based websites.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis, Santa Barbara, CA, USA, July 10, 2017

Algorithms to Compute Probabilistic Bisimilarity Distances for Labelled Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Computing Probabilistic Bisimilarity Distances via Policy Iteration.

[BibT_eX]

[DOI]

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2014

Automatic handling of native methods in Java PathFinder.

[BibT_eX]

[DOI]

Nastaran Shafiei

Proceedings of the 2014 International Symposium on Model Checking of Software, 2014

The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata.

[BibT_eX]

[DOI]

Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

2013

Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Towards model checking of computer games with Java PathFinder.

[BibT_eX]

[DOI]

Nastaran Shafiei

Proceedings of the 3rd International Workshop on Games and Software Engineering: Engineering Computer Games to Enable Positive, 2013

2012

On behavioural pseudometrics and closure ordinals.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Measuring Progress of Probabilistic LTL Model Checking

[BibT_eX]

[DOI]

Elise Cormie-Bowins

Proceedings of the Proceedings 10th Workshop on Quantitative Aspects of Programming Languages and Systems, 2012

On the Complexity of Computing Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Di Chen

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

2011

A Progress Measure for Explicit-State Probabilistic Model-Checkers.

[BibT_eX]

[DOI]

Xin Zhang

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010

19th International Conference on Concurrency Theory.

[BibT_eX]

[DOI]

Marsha Chechik

Inf. Comput., 2010

Model Checking Randomized Algorithms with Java PathFinder.

[BibT_eX]

[DOI]

Xin Zhang

Proceedings of the QEST 2010, 2010

Non-blocking binary search trees.

[BibT_eX]

[DOI]

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

2008

Approximating a Behavioural Pseudometric without Discount for Probabilistic Systems.

[BibT_eX]

[DOI]

Babita Sharma

Log. Methods Comput. Sci., 2008

2007

Recursively defined metric spaces without contraction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Alessandro Aldini

Proceedings of the Fifth Workshop on Quantitative Aspects of Programming Languages, 2007

2006

Approximating and computing behavioural distances in probabilistic transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

A behavioural pseudometric for probabilistic transition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Domain theory, testing and simulation for labelled Markov processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

An Accessible Approach to Behavioural Pseudometrics.

[BibT_eX]

[DOI]

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

A Behavioural Pseudometric for Metric Labelled Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Dead-Path-Elimination in BPEL4WS.

[BibT_eX]

[DOI]

Mariya Koshkina

Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD 2005), 2005

2004

Modelling and verifying web service orchestration by means of the concurrency workbench.

[BibT_eX]

[DOI]

Mariya Koshkina

ACM SIGSOFT Softw. Eng. Notes, 2004

De Bakker-Zucker processes revisited.

[BibT_eX]

[DOI]

Inf. Comput., 2004

2003

An Intrinsic Characterization of Approximate Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

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

2002

Testing Labelled Markov Processes.

[BibT_eX]

[DOI]

Steven Shalit

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

An introduction to metric semantics: operational and denotational models for programming and specification languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Towards Quantitative Verification of Probabilistic Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

An Algorithm for Quantitative Verification of Probabilistic Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2001, 2001

2000

From Banach to Milner: metric semantics for second order communication and concurrency.

[BibT_eX]

Jaco de Bakker

Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999

A Note on Hyperspaces and Terminal Coalgebras.

[BibT_eX]

[DOI]

Stephen Watson

Proceedings of the Coalgebraic Methods in Computer Science, 1999

1998

Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding.

[BibT_eX]

[DOI]

Marcello M. Bonsangue

Jan J. M. M. Rutten

Theor. Comput. Sci., 1998

Comparative metric semantics of programming languages - nondeterminism and recursion.

[BibT_eX]

Progress in theoretical computer science, Birkhäuser, ISBN: 978-3-7643-3927-2, 1998

1997

Failures, finiteness and full abstraction.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual Conference on Mathematical Foundations of Progamming Semantics, 1997

A Labelled Transition Systems for pi-epsilon-Calculus.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1994

Generalized Finiteness Conditions of Labelled Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993

Three Metric Domains of Processes for Bisimulation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Topological Models for Higher Ordr Control Flow.

[BibT_eX]

[DOI]

J. W. de Bakker

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands.

[BibT_eX]

[DOI]

J. W. de Bakker

Arie de Bruin

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

1991

Comparative Semantics for a Real-Time Programming Language with Integration.

[BibT_eX]

[DOI]