English

Priorities in tock-CSP

Logic in Computer Science 2019-07-19 v1

Abstract

The tocktock-CSP encoding embeds a rich and flexible approach to modelling discrete timed behaviours in CSP where the event tocktock is interpreted to mark the passage of time. The model checker FDR provides tailored support for tocktock-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 tocktock-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 tocktock and \checkmark, that signals termination, as special events, and \checkmark-tocktock-CSP, a model for tocktock-CSP that captures termination, deadlines, and is adequate for reasoning about timed refinement. Our results are mechanised using Isabelle/HOL.

Keywords

Cite

@article{arxiv.1907.07974,
  title  = {Priorities in tock-CSP},
  author = {Pedro Ribeiro and James Baxter and Ana Cavalcanti},
  journal= {arXiv preprint arXiv:1907.07974},
  year   = {2019}
}

Comments

9 pages, submitted to Information Processing Letters, July 2019

R2 v1 2026-06-23T10:24:10.094Z