Priorities in tock-CSP

07/18/2019
by   Pedro Ribeiro, et al.
0

The tock-CSP encoding embeds a rich and flexible approach to modelling discrete timed behaviours in CSP where the event tock is interpreted to mark the passage of time. The model checker FDR provides tailored support for tock-CSP, including a prioritisation operator that has typically been used to ensure maximal progress, where time only advances after internal activity has stabilised. Prioritisation may also be used on its own right as a modelling construct. Its operational semantics, however, is only congruent over the most discriminating semantic model of CSP: the finite-linear model. To enable sound and compositional reasoning in a tock-CSP setting, we calculate a denotational definition for prioritisation. For that we establish a Galois connection between a specialisation of the finite-linear model, with tock and , that signals termination, as special events, and -tock-CSP, a model for tock-CSP that captures termination, deadlines, and is adequate for reasoning about timed refinement. Our results are mechanised using Isabelle/HOL.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

Combining nondeterminism, probability, and termination: equational and metric reasoning

We study monads resulting from the combination of nondeterministic and p...
research
07/26/2023

Hydra Battles and AC Termination, Revisited

We present a termination proof for the Battle of Hercules and Hydra repr...
research
03/16/2023

Full Abstraction for Free

Structured recursion schemes such as folds and unfolds have been widely ...
research
11/10/2020

On a general definition of the functional linear model

A general formulation of the linear model with functional (random) expla...
research
05/05/2020

Reconciling progress-insensitive noninterference and declassification

Practitioners of secure information flow often face a design challenge: ...
research
04/19/2023

On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata

Probabilistic pushdown automata (pPDA) are a natural operational model f...
research
05/24/2017

Faithful (meta-)encodings of programmable strategies into term rewriting systems

Rewriting is a formalism widely used in computer science and mathematica...

Please sign up or login with your details

Forgot password? Click here to reset