Filters








506 Hits in 2.9 sec

Bisimulations for a calculus of broadcasting systems

M. Hennessy, J. Rathke
1998 Theoretical Computer Science  
We develop a theory of bisimulation equivalence for the broadcast calculus CBS.  ...  Both the strong and weak versions of bisimulation congruence we study are justified in terms of a characterisation as the largest CBS congruences contained in an appropriate version of barbed bisimulation  ...  Calculus of Broadcasting Systems, has been investigated in [ 191.  ... 
doi:10.1016/s0304-3975(97)00261-2 fatcat:tz6yjltwe5dthks6u72pqv57wi

Towards a primitive higher order calculus of broadcasting systems

Karol Ostrovsky, K. V. S. Prasad, Walid Taha
2002 Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '02  
Ethernet-style broadcast is a pervasive style of computer communication. In this style, the medium is a single nameless channel. Previous work on modelling such systems proposed CBS.  ...  Moving to a higher order calculus is key to increasing the expressivity of the primitive calculus and alleviating the need for an underlying language.  ...  ACKNOWLEDGEMENTS We would like to thank Dave Sands for bringing Howe's method to our attention, Jörgen Gustavsson, Martin Weichert and Gordon Pace for many discussions, and anonymous referees for constructive  ... 
doi:10.1145/571157.571159 dblp:conf/ppdp/OstrovskyPT02 fatcat:lhs3e4ou45drlben4iatawnwke

A process calculus for Mobile Ad Hoc Networks

Anu Singh, C.R. Ramakrishnan, Scott A. Smolka
2010 Science of Computer Programming  
Local broadcast in the ω-calculus. The ω-calculus action to locally broadcast a value x is bx, while r(y) is the action for receiving a value y.  ...  We give a formal operational semantics of the ω-calculus in terms of labeled transition systems and show that the state reachability problem is decidable for finite-control ω-processes.  ...  Acknowledgements We would like to thank the anonymous reviewers for their valuable comments which substantially helped in improving the quality of the paper.  ... 
doi:10.1016/j.scico.2009.07.008 fatcat:layqpe7v4japvj3kpzu3nrep6u

A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) [chapter]

Adrian Francalanza, Matthew Hennessy
2007 Lecture Notes in Computer Science  
We design a minimal partial-failure calculus, develop a corresponding bisimulation theory for it and express a consensus algorithm in the calculus.  ...  We propose a methodology for formalising and proving the correctness of distributed algorithms which alleviates this complexity.  ...  Acknowledgments: We would like to thank the referees for their incisive comments on a preliminary version of this paper.  ... 
doi:10.1007/978-3-540-71316-6_27 fatcat:mc4y4u2v3nhebcrzqte42gdatu

CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report)

Bard Bloom
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
We show that a suitable notion of higher-order bisimulation is a congruence for a subclass of higher-order calculi. We illustrate our definitions with a sample calculus strictly stronger than CHOCS.  ...  We give sufficient conditions under which a calculus is finitelybranching and effective.  ...  Acknowledgements lVe would like to asknowledge Paul Taylor for his diagram package, which was helpful for drawing the many sorts of amazing arrows used in this study.  ... 
doi:10.1145/174675.177948 dblp:conf/popl/Bloom94 fatcat:q5terr76rzeb3earvqtvfxxvvy

Page 3449 of Mathematical Reviews Vol. , Issue 99e [page]

1999 Mathematical Reviews  
Hennessy, M. (4-SUSX-CG; Brighton); Rathke, J. (4-SUSX-CG; Brighton) Bisimulations for a calculus of broadcasting systems.  ...  The broadcast calculus, CBS, is a value-passing process calculus developed by Prasad in a series of papers.  ... 

Modeling and Reasoning About Wireless Networks: A Graph-based Calculus Approach [article]

Shichao Liu, Ying Jiang
2017 arXiv   pre-print
We propose a graph-based process calculus for modeling and reasoning about wireless networks with local broadcasts.  ...  Graphs are used at syntactical level to describe the topological structures of networks. This calculus is equipped with a reduction semantics and a labelled transition semantics.  ...  Process calculi for broadcast systems were first studied by Prasad in the work of a calculus for broadcast systems (CBS) [3] .  ... 
arXiv:1701.02526v2 fatcat:2uffghyvmfafpowst2u75ioch4

Observables for Mobile and Wireless Broadcasting Systems [chapter]

Jens Chr. Godskesen
2010 Lecture Notes in Computer Science  
Introduction Recently we have seen a large interest in the development of calculi for mobile and wireless broadcasting systems, e.g.  ...  We discuss the presence of localities in observables for process calculi for mobile and wireless broadcasting systems in the context of weak barbed congruences and demonstrate that observability of the  ...  it is the first calculus for mobile and wireless local broadcasting systems that allows for reasoning about an unbounded number of network nodes.  ... 
doi:10.1007/978-3-642-13414-2_1 fatcat:n7x6m4johndd7lpro2ecf2hpcm

A Calculus for Mobile Ad-hoc Networks with Static Location Binding

Jens Chr. Godskesen
2009 Electronical Notes in Theoretical Computer Science  
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN [6].  ...  The two changes to the calculus in [6] yields a much simpler bisimulation semantics, and importantly and in contrast to [6] we manage to provide a non-contextual weak bisimulation congruence facilitating  ...  The first study of calculi for broadcasting systems was CBS [15] . Later broadcasting was introduced in a mobile setting in bπ [4] , MBS [16] , and HOBS [14] .  ... 
doi:10.1016/j.entcs.2009.06.018 fatcat:sl2xt4fwinfzzougn5lbsoymsi

Broadcast psi-calculi with an application to wireless protocols

Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2013 Journal of Software and Systems Modeling  
Psi-calculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data.  ...  We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.  ...  The Par rule allows for broadcasts to bypass a process, as in most other broadcast calculi for wireless systems. Meta-theory We have developed a meta-theory for broadcast psi-calculi.  ... 
doi:10.1007/s10270-013-0375-z fatcat:5nl2fiabobdgjn42cr4b4oahge

Broadcast Psi-calculi with an Application to Wireless Protocols [chapter]

Johannes Borgström, Shuqin Huang, Magnus Johansson, Palle Raabjerg, Björn Victor, Johannes Åman Pohjola, Joachim Parrow
2011 Lecture Notes in Computer Science  
Psi-calculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data.  ...  We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.  ...  The Par rule allows for broadcasts to bypass a process, as in most other broadcast calculi for wireless systems. Meta-theory We have developed a meta-theory for broadcast psi-calculi.  ... 
doi:10.1007/978-3-642-24690-6_7 fatcat:lbj3nukq7zh4vbv7ubi2wmvtfa

Probabilistic Mobility Models for Mobile and Wireless Networks [chapter]

Lei Song, Jens Chr. Godskesen
2010 IFIP Advances in Information and Communication Technology  
In this paper we present a probabilistic broadcast calculus for mobile and wireless networks whose connections are unreliable.  ...  We furthermore examine the relation between our weak bisimulation and a minor variant of PCTL * [1]. Finally, we apply our calculus on a small example called the Zeroconf protocol [2] .  ...  Weak Bisimulation In this section we provide a weak bisimulation for our calculus.  ... 
doi:10.1007/978-3-642-15240-5_7 fatcat:ebnspxfdhnbbhme27fjvbglfby

On a Concurrency Calculus for Design of Mobile Telecommunication Systems [chapter]

T. Ando, K. Takahashi, Y. Kato
1997 Formal Description Techniques and Protocol Specification, Testing and Verification  
An extension of 1r-calculus with a field is proposed. A field is given when behaviors of a target system is verified for a particular environment.  ...  We propose a description method to design such systems using a concurrency calculus in this paper. The concept of a field is introduced to model locality.  ...  CONCLUSION We proposed a concurrency calculus for design of mobile telecommunication systems in this paper.  ... 
doi:10.1007/978-0-387-35271-8_33 fatcat:4jyg3bkh7nhc5fox74ccq72eau

A Calculus of Countable Broadcasting Systems [chapter]

Yoshinao Isobe, Yutaka Sato, Kazuhito Ohmaki
1995 Lecture Notes in Computer Science  
In this paper we propose a process algebra named CCB (a Calculus of Countable Broadcasting Systems).  ...  CCB is developed for analyzing a multi-agent model with broadcast communication.  ...  Kimihiro Ohta, Director of Computer Science Division, ETL. They also thank Dr.  ... 
doi:10.1007/3-540-60043-4_73 fatcat:cbcssu6rd5di7atfz7cmore6de

Page 3876 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
The main results of the paper are the following: (A) The se- mantic mapping is a strong bisimulation between the interleaving transition system of the small z-calculus and the multiset transi- tion system  ...  As for CCS the (interleaving) semantics of the z-calculus is given by a transition system whose states are process terms.  ... 
« Previous Showing results 1 — 15 out of 506 results