Model-Checking Circus State-Rich Specifications

Oliveira, Marcel; Sampaio, Augusto; Filho, Madiel S. Conserva

doi:10.1007/978-3-319-10181-1_3

Cited by 6 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After that, linking Circus to CSP [7] aims to translate Circus to CSP M then use FDR2 [1] to model-check CSP specification. The last one is mapping Circus processes and refinement to CSP processes and refinement [31,39] that transforms stateful Circus to stateless Circus first by introducing the memory model, and then converts stateless Circus to CSP. The first is not a model checking solution but implementation instead, and it is restricted to executable Circus programs because Java is an imperative programming language and not a high-level specification language.…”

Section: Discussionmentioning

confidence: 99%

Model checking of state-rich formalism by linking to $$CSP\,\Vert \,B$$ C S P ‖ B

Woodcock

2015

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

Since state-rich formalism Circus is a combination of Z, CSP, refinement calculus and Dijkstra's guarded commands, its model checking is intrinsically more complicated and difficult than that of individual state-based languages or process algebras. Current solutions translate executable constructs of Circus programs to Java with JCSP, or translate them to CSP processes. Data aspects of Circus programs are expressed in the Java programming language or as CSP processes. Both of them have disadvantages. This work presents a new approach to model-checking Circus by linking it to CSP B, then we utilise ProB to model-check and animate the CSP B program. The most significant advantage of this approach is the direct mapping of the state part in Circus to Z and finally to B, which maintains the high-level abstraction of data specification. In addition, introduction of deadlock, invariant violation checking, LTL formula checking and animation is another key advantage. We present our approach, a link definition for a subset of Circus constructs, as well as a popular case study (reactive buffer) to show the practical usability of our work. We conclude with a discussion of related work, advantages and potential limitations of our approach, and future work.

show abstract

Section: Discussionmentioning

confidence: 99%

Model checking of state-rich formalism by linking to $$CSP\,\Vert \,B$$ C S P ‖ B

Woodcock

2015

Int J Softw Tools Technol Transfer

View full text Add to dashboard Cite

show abstract

“…In translating multi-synchronisation, we adopt a centralised approach developed in [30] and implemented using Java in [14], which uses a separate centralised controller. Here, we use a separate TA with an Uppaal broadcast channel to communicate synchronising information to synchronise TA and a control TA.…”

Section: An Overview Of the Translation Techniquementioning

confidence: 99%

Temporal Reasoning Through Automatic Translation of tock-CSP into Timed Automata

Abba

Cavalcanti

Jacob

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this work, we present an approach for automatic translation of tock-CSP into Timed Automata (TA) for Uppaal to facilitate using Uppaal in reasoning about temporal specifications of tock-CSP models. The process algebra tock-CSP provides textual notations for modelling discrete-time behaviours, with the support of tools for automatic verification. Automatic verification of TA with a graphical notation is supported by Uppaal. The two approaches provide facilities for automatic verification. For instance, liveness requirements are difficult to specify with the constructs of tock-CSP, but they are easy to specify and verify in Uppaal. We have developed a translation technique and a tool based for translating tock-CSP into a network of small TAs for capturing the compositional structure of tock-CSP. For validating the rules, we begin with an experimental approach based on finite approximations to trace sets. Then, we explore using structural induction to establish the correctness.

show abstract

“…Our translation is based on that developed by Oliveira in the Compass project [26,27], which is based on repeated application of carefully selected Circus refinement laws, all of which happen to be equivalences. Such a translation uses set of rules for refining state-rich Circus into stateless processes that can be mapped into CSP M .…”

Section: Circus2csp: Requirements and Goalsmentioning

confidence: 99%

Circus2CSP: A Tool for Model-Checking Circus Using FDR

Gomes

Butterfield

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper, we introduce Circus2CSP, a tool that automatically translates Circus into CSPM , with an implementation based on a published manual translation scheme. This scheme includes new and modified translation rules that emerged as a result of experimentation. We addressed issues with FDR state-space explosion, by optimising our models using the Circus Refinement Laws. We briefly describe the usage of Circus2CSP along with a discussion of some experiments comparing our tool with the literature.

show abstract

Model-Checking Circus State-Rich Specifications

Cited by 6 publications

References 12 publications

Model checking of state-rich formalism by linking to $$CSP\,\Vert \,B$$ C S P ‖ B

Model checking of state-rich formalism by linking to $$CSP\,\Vert \,B$$ C S P ‖ B

Temporal Reasoning Through Automatic Translation of tock-CSP into Timed Automata

Circus2CSP: A Tool for Model-Checking Circus Using FDR

Contact Info

Product

Resources

About