TY - GEN
T1 - Observation-oriented semantics for calculus of wireless systems
AU - Wu, Xiaofeng
AU - Zhu, Huibiao
AU - Wu, Xi
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015
PY - 2015
Y1 - 2015
N2 - Wireless networks are being deployed in a wide range of communication scenarios. Calculus of Wireless Systems [8] is introduced for specifying the behaviour of wireless communication. It contains several interesting features, including local broadcasting, half-duplex channel and transmission interference. In this paper we explore an observationoriented semantics for the calculus, which can be used to study network equivalence. We investigate the observation-oriented semantics of wireless networks based on its basic components. A wireless network is specified as a set of nodes running in parallel, which are classified into four different types according to their states. The behaviour of a node is determined by its state with its environment, i.e., nodes which are located close to it. Hence a trace is introduced to record the execution as well as the corresponding environment update of a node. Based on traces of a set of nodes, the behaviour of a network composed of these nodes can be deduced. We also investigate a set of algebraic laws based on the observation-oriented semantics.
AB - Wireless networks are being deployed in a wide range of communication scenarios. Calculus of Wireless Systems [8] is introduced for specifying the behaviour of wireless communication. It contains several interesting features, including local broadcasting, half-duplex channel and transmission interference. In this paper we explore an observationoriented semantics for the calculus, which can be used to study network equivalence. We investigate the observation-oriented semantics of wireless networks based on its basic components. A wireless network is specified as a set of nodes running in parallel, which are classified into four different types according to their states. The behaviour of a node is determined by its state with its environment, i.e., nodes which are located close to it. Hence a trace is introduced to record the execution as well as the corresponding environment update of a node. Based on traces of a set of nodes, the behaviour of a network composed of these nodes can be deduced. We also investigate a set of algebraic laws based on the observation-oriented semantics.
UR - https://www.scopus.com/pages/publications/84927613336
U2 - 10.1007/978-3-319-14806-9_6
DO - 10.1007/978-3-319-14806-9_6
M3 - 会议稿件
AN - SCOPUS:84927613336
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 105
EP - 124
BT - Unifying Theories of Programming - 5th International Symposium, UTP 2014, Revised Selected Papers
A2 - Naumann, David
PB - Springer Verlag
T2 - 5th International Symposium on Unifying Theories of Programming, UTP 2014
Y2 - 13 May 2014 through 13 May 2014
ER -