Model Building and Model Checking for Biochemical Processes

Model Checking Mobile Processes

We introduce a temporal logic for the polyadic -calculus based on xed point extensions of Hennessy-Milner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambda-abstraction and application. The la...

Model Checking PA-Processes

PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) Chr93] and context-free processes (BPA). They are a simple model for innnite state concurrent systems. We show that the model checking problem for the branching time temporal lo...

Model Checking for Timed Logic Processes

Model-checking processes with data

We propose a procedure for automatically verifying properties (expressed in an extension of the modal μ-calculus) over processes with data, specified in μCRL. We first briefly review existing work, such as the theory of μCRL and we discuss the logic, called first order modal μ-calculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several ...

Model Checking for Context-Free Processes

We develop a model-checking algorithm that decides for a given context-free process whether it satisses a property written in the alternation-free modal mu-calculus. The central idea behind this algorithm is to raise the standard iterative model-checking techniques to higher order: in contrast to the usual approaches, in which the set of formulas that are satissed by a certain state are iterati...