Broadcast psi-calculi with an application to wireless protocols

Borgström, Johannes; Huang, Shuqin; Johansson, Magnus; Raabjerg, Palle; Victor, Björn; Pohjola, Johannes Åman; Parrow, Joachim

doi:10.1007/s10270-013-0375-z

Cited by 21 publications

(14 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A key feature of the ω-calculus is the separation of a node's communication and computational behaviour from the description of its physical transmission range. Another extension of the π-calculus, which has been used for modelling the LUNAR ad-hoc routing protocol, may be found in [2].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Modelling MAC-Layer Communications in Wireless Systems

Cerone¹,

Hennessy²,

Merro³

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a timed broadcast process calculus for wireless networks at the MAC-sublayer where time-dependent communications are exposed to collisions. We define a reduction semantics for our calculus which leads to a contextual equivalence for comparing the external behaviour of wireless networks. Further, we construct an extensional LTS (labelled transition system) which models the activities of stations that can be directly observed by the external environment. Standard bisimulations in this novel LTS provide a sound proof method for proving that two systems are contextually equivalent. In addition, the main contribution of the paper is that our proof technique is also complete for a large class of systems.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Modelling MAC-Layer Communications in Wireless Systems

Cerone¹,

Hennessy²,

Merro³

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…While pen-and-paper proofs would have to be carefully reexamined, formal proofs can be checked mostly automatically, sometimes in minutes [7]. The psi-calculi formalisation described here has already been used as a basis for the implementation of various extensions of psi-calculi in Isabelle, notably broadcast psi-calculi [17], higher-order psi-calculi [43], and sorted psi-calculi [16].…”

Section: Resultsmentioning

confidence: 99%

Psi-Calculi in Isabelle

2015

Self Cite

View full text Add to dashboard Cite

This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi-calculus, and the spi calculus. psi-calculi are significantly more expressive, yet their semantics is as simple in structure as the semantics of the original pi-calculus. Proofs of meta-theoretic properties for psi-calculi are more involved, however, not least because psi-calculi (unlike simpler calculi) utilise binders that bind multiple names at once. The mechanisation is carried out in the Nominal Isabelle framework, an interactive proof assistant designed to facilitate formal reasoning about calculi with binders. Our main contributions are twofold. First, we have developed techniques that allow efficient reasoning about calculi that bind multiple names in Nominal Isabelle. Second, we have adopted these techniques to mechanise substantial results from the meta-theory of psi-calculi, including congruence properties of bisimilarity and the laws of structural congruence. To our knowledge, this is the most extensive formalisation of process calculi mechanised in a proof assistant to date.

show abstract

“…The evolution of knowledge is rather complex in Psi-calculus, while the clean separation between knowledge and behaviour in AbC avoids dependencies between components and enhances readability, compositional reasoning, and maintainability. Broadcast Psi [119] is an extension of Psi-calculus with broadcast primitives whose main communication rule requires that interacting agents take into account the knowledge of each other. Modelling reconfiguration is not easy; it requires modelling different connectivity configurations using assertions and relies on the generation of assertions tagged by a fresh generation number; only the most recent generation is used.…”

Section: Related Workmentioning

confidence: 99%

A Formal Approach to the Engineering of Domain-Specific Distributed Systems

Nicola

Ferrari

Pugliese

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We review some results regarding specification, programming and verification of different classes of distributed systems which stemmed from the research of the Concurrency and Mobility Group at University of Firenze. More specifically, we examine the distinguishing features of network-aware programming, service-oriented computing, autonomic computing, and collective adaptive systems programming. We then present an overview of four different languages, namely Klaim, Cows, Scel and AbC. For each language, we discuss design choices, present syntax and semantics, show how the different formalisms can be used to model and program a travel booking scenario, and describe programming environments and verification techniques.

show abstract

Broadcast psi-calculi with an application to wireless protocols

Cited by 21 publications

References 29 publications

Modelling MAC-Layer Communications in Wireless Systems

Modelling MAC-Layer Communications in Wireless Systems

Psi-Calculi in Isabelle

A Formal Approach to the Engineering of Domain-Specific Distributed Systems

Contact Info

Product

Resources

About