2021
DOI: 10.1007/s00236-020-00394-3
|View full text |Cite|
|
Sign up to set email alerts
|

Sound reasoning in tock-CSP

Abstract: Specifying budgets and deadlines using a process algebra like CSP requires an explicit notion of time. The tock-CSP encoding embeds a rich and flexible approach for modelling discrete-time behaviours with powerful tool support. It uses an event tock, interpreted to mark passage of time. Analysis, however, has traditionally used the standard semantics of CSP, which is inadequate for reasoning about timed refinement. The most recent version of the model checker FDR provides tailored support for tock-CSP, includi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 20 publications
(20 citation statements)
references
References 37 publications
0
20
0
Order By: Relevance
“…This will require us to consider discrete time, which we believe can be supported using a dedicated time event in ITrees, similar to tock-CSP [31]. This will build on our colleagues' work with ✓-tock [1], a new semantics for tock-CSP. This will open up a pathway from graphical models to verified implementations of autonomous robotic controllers.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…This will require us to consider discrete time, which we believe can be supported using a dedicated time event in ITrees, similar to tock-CSP [31]. This will build on our colleagues' work with ✓-tock [1], a new semantics for tock-CSP. This will open up a pathway from graphical models to verified implementations of autonomous robotic controllers.…”
Section: Discussionmentioning
confidence: 99%
“…Isabelle's code generator allows us to automatically produce ITreebased simulations, which allows a tight development loop, where simulation and verification activities are intertwined. All our results have been mechanised, and can be found in the accompanying repository 1 , and specific icon links ( / ) next to each result.…”
Section: Introductionmentioning
confidence: 99%
“…The healthiness conditions of -tock [13], whose composition is named TT, ensure properties of the standard models of CSP in the context of TT traces. Namely, the empty trace is an observation of every process; prefix closure and subset closure of refusals; and an event that cannot be performed is refused.…”
Section: Definition 1 Obsmentioning
confidence: 99%
“…Thus, FDR actually implements a constrained form of Pri ≤ , where, for example, and τ are maximal in the order. However, this is insufficient for Pri ≤ to be congruent over weaker models such as -tock [13] and the stable-failures (F [1]). Process S makes an internal choice (⊓) between offering events a, or b, and terminating, or waiting a time unit (Wait 1) and then behaving as S again, specified using sequential composition ( ; ).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation

Priorities in tock-CSP

Ribeiro,
Baxter,
Cavalcanti
2019
Preprint
Self Cite