In this paper we study automatic veri cation of proofs in process algebra Formulas of process algebra are represented by types in typed calculus Inhabitants terms of these types represent proofs The speci c typed calculus we use is the Calculus of Inductive Constructions as implemented in the interactive proof construction program COQ

Bisimilarity and regularity are decidable properties for the class of BPA (or context–free) processes [CHS95, BCS96]. We extend BPA with a deadlocking state obtaining BPAδ systems. We show that the BPAδ class is more expressive w.r.t. bisimilarity, but it remains language equivalent to BPA. We prove that bisimilarity and regularity remain decidable for BPAδ. Finally we give a characterisation o...

We extend truly concurrent process algebra APTC with timing related properties. Just like ACP with timing, APTC with timing also has four parts: discrete relative timing, discrete absolute timing, continuous relative timing and continuous absolute timing.

Abstract. Stochastic process algebras have been proven useful because they allow behaviour-oriented performance and reliability modelling. As opposed to traditional performance modelling techniques, the behaviouroriented style supports composition and abstraction in a natural way. However, analysis of stochastic process algebra models is state-oriented, because standard numerical analysis is ty...

Formal languages with semantics based on ordinary differential equations (ODEs) have emerged as a useful tool to reason about large-scale distributed systems. We present differential bisimulation, a behavioral equivalence developed as the ODE counterpart of bisimulations for languages with probabilistic or stochastic semantics. We study it in the context of a Markovian process algebra. Similarl...

This tutorial provides an overview of the process algebra ACP.

More than 15 years ago, Cleaveland and Hennessy proposed an extension of theprocess algebra CCS in which some actions may take priority over others. Thetheory was equipped with a behavioral congruence based on strong bisimulation.This article gives a full account of the challenges in, and the solutions employedfor, defining a semantic theory of observation congruence for this pr...

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible to deal with the behaviour of systems with a known time-dependent spatial distribution, such as protocols transmitting data via a mobile interme...

A general framework for defining security properties is presented. It allows us to model many traditional security properties as well as to define new ones. The framework is based on process algebras contexts and processes relations. By appropriate choice of both of them we can model also probabilistic and quantified security properties.