An algebraic verification of a mobile network

Orava, Fredrik; Parrow, Joachim

doi:10.1007/bf01211473

Cited by 73 publications

(32 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In particular, the handover protocol of the PLMN example has been first specified in the π-calculus, then verified algebraically [25] and finally verified by means of an automatic tool for proving π-calculus' equivalences [29]. It is worth noting that, however, our specification is radically simpler than that in [25,29].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…The use of behavioural equivalences to prove soundness of protocols is wellestablished in the field of process calculi; some notable examples are [1,25,29]. In particular, the handover protocol of the PLMN example has been first specified in the π-calculus, then verified algebraically [25] and finally verified by means of an automatic tool for proving π-calculus' equivalences [29].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Global Computing in a Dynamic Network of Tuple Spaces

Nicola

Gorla

Pugliese

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

We present K (Topological K), a process description language that retains the main features of K (process distribution and mobility, remote and asynchronous communication through distributed data spaces), but extends it with new constructs to flexibly model the interconnection structure underlying a network and its evolution in time. We show how K can be used to model a number of interesting distributed applications and how systems correctness can be guaranteed, also in the presence of failures, by exploiting observational equivalences to study the relationships between descriptions of systems at different levels of abstraction.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Section: Conclusion and Related Workmentioning

confidence: 99%

Global Computing in a Dynamic Network of Tuple Spaces

Nicola

Gorla

Pugliese

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…HAL has been used to perform the verification of several case studies, as for example the GSM handover protocol [6]. However, a main limitation of the current implementation of HAL is due to the state explosion problem that arises when dealing with real systems.…”

Section: Preliminariesmentioning

confidence: 99%

Verification On The Web Of Mobile Systems

Ferrari¹,

Gnesi²,

Montanari³

et al. 2004

Proceedings of the 2nd International Workshop on Verification and Validation of Enterprise Information Systems

View full text Add to dashboard Cite

Abstract. Web services allow the components of applications to be highly decentralized, dynamically reconfigurable. Moreover, Web services can interoperate easily inside an heterogeneous network environment. The vast majority of current available verification environments have been built by sticking to traditional architectural styles. Hence, they are centralized and none of them deal with interoperability and dynamic reconfigurability. In this paper we present a verification toolkit whose design and implementation exploit the Web service architectural paradigm. We describe the architectural design and the discuss in detail the current implementation efforts.

show abstract

“…The scenario we consider is inspired by the handover protocol, proposed by the European Telecommunication Standards Institute (ETSI) for the GSM Public Land Mobile Network (PLMN). A formal specification and verification of the protocol by using the π-calculus can be found in [32]. The PLMN is a cellular system which consists of Mobile Stations (MSs), Base Stations (BSs) and Mobile Switching Centres (MSCs).…”

Section: α = ∃?β: the Thesis Easily Follows By Exploiting The Contextmentioning

confidence: 99%

Basic Observables for a Calculus for Global Computing

Nicola

Gorla

Pugliese

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

We develop the semantic theory of a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribution, process mobility and remote asynchronous communication through distributed data repositories, the language provides constructs for explicitly modelling inter-node connections and for dynamically activating and deactivating them. For the proposed language, we define natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing equivalence. For such equivalences, we provide alternative characterizations in terms of a labelled bisimulation and a trace equivalence that can be used for actual proofs. We discuss how the language and its theory can be extended to include more sophisticated features that enable a finer control on the activation of connections. To asses practical usability of the semantic theory, we model a scenario for communications between mobile devices and use the introduced proof techniques to analyze it and verify some relevant properties. * This paper is an extended and revised version of [15] and was mainly written when the second author was a PhD student in Florence.

show abstract

An algebraic verification of a mobile network

Cited by 73 publications

References 7 publications

Global Computing in a Dynamic Network of Tuple Spaces

Global Computing in a Dynamic Network of Tuple Spaces

Verification On The Web Of Mobile Systems

Basic Observables for a Calculus for Global Computing

Contact Info

Product

Resources

About