Understanding Concurrent Systems

Roscoe, A. W.

doi:10.1007/978-1-84882-258-0

Cited by 283 publications

(444 citation statements)

References 0 publications

Supporting

Mentioning

443

Contrasting

Order By: Relevance

“…Circus [26] is a formal notation that combines the style for data modelling of the Z [36] notation with that for process specification of CSP [17,30]. Like a CSP model, a Circus specification defines processes that communicate over channels, but that, unlike CSP processes, may contain internal state defined in Z.…”

Section: Circusmentioning

confidence: 99%

Modelling and Verifying a Priority Scheduler for an SCJ Runtime Environment

Freitas

Baxter

Cavalcanti

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Safety-Critical Java (SCJ) is a version of Java suitable for programming real-time safety-critical systems; it is the result of an international standardisation effort to define a subset of the Real-Time Specification for Java (RTSJ). SCJ programs require the use of specialised virtual machines. We present here the result of our verification of the scheduler of the only SCJ virtual machine up to date with the standard and publicly available, the icecap HVM. We describe our approach for analysis of (SCJ) virtual machines, and illustrate it using the icecap HVM scheduler. Our work is based on a state-rich process algebra that combines Z and CSP, and we take advantage of well established tools.

show abstract

Section: Circusmentioning

confidence: 99%

Modelling and Verifying a Priority Scheduler for an SCJ Runtime Environment

Freitas

Baxter

Cavalcanti

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The process algebra Csp [11,18] is an established formalism for describing concurrent systems. While there is still ongoing research on foundations, Csp has many applications, e.g., in train controllers, in avionics, and in security protocols.…”

Section: Modelling Railways For Safety In Cspmentioning

confidence: 99%

“…The process algebra Csp [11,18] has successfully been applied to modelling, analysing and verifying railways for safety aspects, see e.g. [20,21].…”

Section: Introductionmentioning

confidence: 99%

Safety and Line Capacity in Railways – An Approach in Timed CSP

Isobe

Moller

Nguyen

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Railways need to be safe and, at the same time, should offer high capacity. While the notion of safety is well understood in the railway domain, the meaning of capacity is understood only on an intuitive and informal level. In this study, we show how to define and analyse capacity in a rigorous way. Our modelling approach builds on an established modelling technique in the process algebra Csp for safety alone, provides an integrated view on safety as well as capacity, and offers proof support in terms of (untimed) model checking.

show abstract

“…Various semantic models of CSP [10] enable us to distinguish between processes. The coarsest model is the traces model T , which captures the traces of events which a CSP process might exhibit.…”

Section: Cspmentioning

confidence: 99%

“…In addition to these denotational semantics of CSP, there exists an operational semantics based upon labelled transition systems (LTS) [10]. Any CSP process can be given as an LTS, consisting of a non-empty set of states, an initial state, a set of labels Σ ∪ {τ }, and a set of labelled transitions, where a labelled transition S a → S denotes that an action a can be taken from the state S to move to state S .…”

Section: Cspmentioning

confidence: 99%

Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols

Williams

Ruiter

Fokkink

2012

Theoretical Aspects of Computing – ICTAC 2012

View full text Add to dashboard Cite

Abstract. Motivated by Murray's work on the limits of refinement testing for CSP, we propose the use of ProB to check liveness properties under assumptions of strong and weak event fairness, whose refinement-closures cannot generally be expressed as refinement checks for FDR. Such properties are necessary for the analysis of fair exchange protocols in CSP, which assume at least some messages are sent over a resilient channel. As the properties we check are refinement-closed, we retain CSP's theory of refinement, enabling subsequent step-wise refinement of the CSP model. Moreover, we improve upon existing CSP models of fair exchange protocols by proposing a revised intruder model inspired by the one of Cederquist and Dashti. Our intruder model is stronger as we use a weaker fairness constraint.

show abstract

Understanding Concurrent Systems

Cited by 283 publications

References 0 publications

Modelling and Verifying a Priority Scheduler for an SCJ Runtime Environment

Modelling and Verifying a Priority Scheduler for an SCJ Runtime Environment

Safety and Line Capacity in Railways – An Approach in Timed CSP

Model Checking under Fairness in ProB and Its Application to Fair Exchange Protocols

Contact Info

Product

Resources

About