A UTP semantics for communicating processes with shared variables and its formal encoding in PVS

Shi, Ling; Zhao, Yongxin; Liu, Yang; Sun, Jun; Dong, Jin Song; Qin, Shengchao

doi:10.1007/s00165-018-0453-7

Cited by 9 publications

(2 citation statements)

References 48 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach has focused mainly on CSP, but because we use the UTP, our results are applicable to other process calculi. This may include, for example, process algebras like rTiMo [40] and CSP# [41], which have also been given UTP semantics [42,43]. Event-based modelling languages may also benefit from the inclusion of angelic choice as a specification construct.…”

Section: Discussionmentioning

confidence: 99%

Angelic processes for CSP via the UTP

Ribeiro

Cavalcanti

2019

Theoretical Computer Science

View full text Add to dashboard Cite

Demonic and angelic nondeterminism play fundamental roles as abstraction mechanisms for formal modelling. In contrast with its demonic counterpart, in an angelic choice failure is avoided whenever possible. Although it has been extensively studied in refinement calculi, in the context of process algebras, and of the Communicating Sequential Processes (CSP) algebra for refinement, in particular, it has been elusive. We show here that a semantics for an extended version of CSP that includes both demonic and angelic choice can be provided using Hoare and He's Unifying Theories of Programming (UTP). Since CSP is given semantics in the UTP via reactive designs (pre and postcondition pairs) we have developed a theory of angelic designs and a conservative extension of the CSP theory using reactive angelic designs. To characterise angelic nondeterminism appropriately in an algebra of processes, however, a notion of divergence that can undo the history of events needs to be considered. Taking this view, we present a model for CSP where angelic choice completely avoids divergence just like in the refinement calculi for sequential programs.

show abstract

Section: Discussionmentioning

confidence: 99%

Angelic processes for CSP via the UTP

Ribeiro

Cavalcanti

2019

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…Therefore, a primary concern of a given modeling language is its formal semantics. Unifying Theories of Programming (UTP) approach was developed by Hoare and He in [5], and it has been applied in defining semantics for many languages [29,30,31]. It contains three different mathematical models to represent a theory of programming, namely, operational semantics [32], denotational semantics [33] and algebraic semantics [34].…”

Section: Journal Pre-proofmentioning

confidence: 99%

Translating and verifying Cyber–Physical systems with shared-variable concurrency in SpaceEx

Zhu

Banach

2023

Internet of Things

View full text Add to dashboard Cite

Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

Brieger,

Mitsch,

Platzer

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

This paper introduces a uniform substitution calculus for $${\textsf {d{}L}} {}_{\text {CHP}}$$ d L CHP , the dynamic logic of communicating hybrid programs. Uniform substitution enables parsimonious prover kernels by using axioms instead of axiom schemata. Instantiations can be recovered from a single proof rule responsible for soundness-critical instantiation checks rather than being spread across axiom schemata in side conditions. Even though communication and parallelism reasoning are notorious for necessitating subtle soundness-critical side conditions, uniform substitution when generalized to $${\textsf {d{}L}} {}_{\text {CHP}}$$ d L CHP manages to limit and isolate their conceptual overhead. Since uniform substitution has proven to simplify the implementation of hybrid systems provers substantially, uniform substitution for $${\textsf {d{}L}} {}_{\text {CHP}}$$ d L CHP paves the way for a parsimonious implementation of theorem provers for hybrid systems with communication and parallelism.

show abstract

A UTP semantics for communicating processes with shared variables and its formal encoding in PVS

Cited by 9 publications

References 48 publications

Angelic processes for CSP via the UTP

Angelic processes for CSP via the UTP

Translating and verifying Cyber–Physical systems with shared-variable concurrency in SpaceEx

Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

Contact Info

Product

Resources

About