An Axiomatic Approach to BigrTiMo

  • Wanling Xie
  • , Huibiao Zhu*
  • , Shengchao Qin
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

BigrTiMo [1], a process algebra that combines the rTiMo calculus [2] and the Bigraph model [3], is capable of specifying a rich variety of properties for structure-aware mobile systems. Compared with the rTiMo model, our BigrTiMo calculus can specify not only time, mobility and the local communication (the two communication components should be at the same location), but also the remote communication (the two communication components can be at the different locations). In this paper, we present an axiomatic approach to BigrTiMo program language verification based on Hoare-style [4] proof rules. In order to describe the timing of observable actions and the state of the bigraph, we extend the assertion language with primitives. Moreover, we prove the soundness of our proof rules and show the application of the proof rules via an example.

Original languageEnglish
Title of host publicationProceedings - 2020 International Symposium on Theoretical Aspects of Software Engineering, TASE 2020
EditorsToshiaki Aoki, Qin Li
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages41-48
Number of pages8
ISBN (Electronic)9781728140865
DOIs
StatePublished - Dec 2020
Event14th International Symposium on Theoretical Aspects of Software Engineering, TASE 2020 - Hangzhou, China
Duration: 11 Dec 202013 Dec 2020

Publication series

NameProceedings - 2020 International Symposium on Theoretical Aspects of Software Engineering, TASE 2020

Conference

Conference14th International Symposium on Theoretical Aspects of Software Engineering, TASE 2020
Country/TerritoryChina
CityHangzhou
Period11/12/2013/12/20

Keywords

  • n/a

Fingerprint

Dive into the research topics of 'An Axiomatic Approach to BigrTiMo'. Together they form a unique fingerprint.

Cite this