A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes

A Specification Theory of Real-Time Processes

A Taxonomy of Infinite State Processes

A fast algorithm for deciding bisimilarity of normed context-free processes

A polynomial algorithm for deciding bisimilarity of normed context-free processes

A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes

A polynomial-time algorithm for deciding equivalence of normed context-free processes

A temporal calculus of communicating systems

A university-based model for supporting computer science curriculum reform

scholarly article published 23 August 2018

An overview of TCCS

Asynchronous router specification

Automated Verification of Signalling Principles in Railway Interlocking Systems

Behavioural abstraction in TCCS

Bisimulation equivalence is decidable for basic parallel processes

Boolean Algebras and Circuits

scholarly article published 2013

Checking regular properties of Petri nets

Concurrent Processes

Counting on CTL*: on the expressive power of monadic path logic

DP lower bounds for equivalence-checking and model-checking of one-counter automata

Decidability results in automata and process theory

Deciding Bisimilarity between BPA and BPP Processes

Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes

Defining and Model Checking Abstractions of Complex Railway Models Using CSP||B

Distinguishing Between Processes

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds*

Functions

Games and Strategies

Generative AI in Software Development Education: Insights from a Degree Apprenticeship Programme

artículo científico publicado en 2023

Guest Editorial

Incorporating Generative AI into Software Development Education

artículo científico publicado en 2023

Inductive and Recursive Definitions

Infinite results

Introduction

Logical Properties of Processes

article

Logics for concurrency: structure versus automata

Modelling Computing Systems

Modelling Processes

On modelling and verifying railway interlockings: Tracking train lengths

On the computational complexity of bisimulation

On the computational complexity of bisimulation, redux

On the computational complexity of bisimulation, redux

On the expressive power of CTL

Petri Nets and Regular Processes

Predicate Logic

Preface

Preface

Process Algebra as a Tool for Real Time Analysis

scholarly article published 1991

Proof Strategies

Proofs by Induction

Propositional Logic

Pushdown automata, multiset automata, and Petri nets

scholarly article

Relating processes with respect to speed

Relations

Safety and Line Capacity in Railways – An Approach in Timed CSP

Sets

Simulation Problems for One-Counter Machine

Simulation and Bisimulation over One-Counter Processes

Techniques for Decidability and Undecidability of Bisimilarity

Techniques for modelling and verifying railway interlockings

Technocamps

Temporal Properties

The importance of the left merge operator in process algebras

scholarly article

The mindstorm effect

The mobility workbench — A tool for the π-Calculus

article

The nonexistence of finite axiomatisations for CCS congruences

Unique decomposition of processes

Verification of Scheme Plans Using CSP $$||$$ | | B

Verification of Solid State Interlocking Programs

Verification of parallel systems via decomposition

Verification on Infinite Structures

Weak Bisimulation Approximants

Axioms for concurrency

tesis doctoral