Alessandro Bianchi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alessandro Bianchi has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Visaggio
University of Bari and SER&Practices SPIN-OFF, Italy
9 shared publications - Danilo Caivano
Department of Computer Science, University of Bari “Aldo Moro”, Bari, Italy
8 shared publications - Gennaro Vessio
Department of Computer Science, University of Bari Aldo Moro, Bari, Italy
7 shared publications - Sebastiano Pizzutilo
University of Bari
6 shared publications - Filippo Lanubile
University of Bari, Bari, Italy
4 shared publications - Sebastiano Pizzutilo
University of Bari
3 shared publications
Latest Publications
- 2 February 2018
- Published by Springer Nature
- p. 137-152
Intercepting Blackhole Attacks in MANETs: An ASM-based Model
- 2 February 2018
- Published by Springer Nature
- p. 137-152
Intercepting Blackhole Attacks in MANETs: An ASM-based Model
- Open Access
An ASM-based Characterization of Starvation-free Systems
Abstract State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of application domains. However, unlike other well-known formalisms, e.g. Petri nets, ASMs lack inherent, domain-independent characterisations of computationally important properties. Here, we provide an ASM-based characterisation of the starvation-free property. The classic, informal notion of starvation, usually provided in literature, is analysed and expressed as a necessary condition in terms of ASMs. Thus, we enrich the ASM framework with the notion of vulnerable rule as a practical tool for analysing starvation issues in an operational fashion
Open AccessAn ASM-based Characterization of Starvation-free Systems
Abstract State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of application domains. However, unlike other well-known formalisms, e.g. Petri nets, ASMs lack inherent, domain-independent characterisations of computationally important properties. Here, we provide an ASM-based characterisation of the starvation-free property. The classic, informal notion of starvation, usually provided in literature, is analysed and expressed as a necessary condition in terms of ASMs. Thus, we enrich the ASM framework with the notion of vulnerable rule as a practical tool for analysing starvation issues in an operational fashion
- Open Access
- 14 February 2017
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 33 (1) , 35-51
An ASM-based characterisation of starvation-free systems
State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of application domains. However, unlike other well-known formalisms, e.g. Petri nets, ASMs lack inherent, domain-independent characterisations of computationally important properties. Here, we provide an ASM-based characterisation of the starvation-free property. The classic, informal notion of starvation, usually provided in literature, is analysed and expressed as a necessary condition in terms of ASMs. Thus, we enrich the ASM framework with the notion of vulnerable rule as a practical tool for analysing starvation issues in an operational fashion.
- 14 February 2017
- Published by Taylor & Francis in International Journal of Parallel, Emergent and Distributed Systems
- Vol. 33 (1) , 35-51
Open AccessAn ASM-based characterisation of starvation-free systems
State Machines (ASMs) have been successfully applied for modeling critical and complex systems in a wide range of application domains. However, unlike other well-known formalisms, e.g. Petri nets, ASMs lack inherent, domain-independent characterisations of computationally important properties. Here, we provide an ASM-based characterisation of the starvation-free property. The classic, informal notion of starvation, usually provided in literature, is analysed and expressed as a necessary condition in terms of ASMs. Thus, we enrich the ASM framework with the notion of vulnerable rule as a practical tool for analysing starvation issues in an operational fashion.
- 1 January 2016
- Published by INSTICC
- p. 123-130
Towards an ASM-based Characterization of the Deadlock-freedom Property
- 1 January 2016
- Published by INSTICC
- p. 123-130
Towards an ASM-based Characterization of the Deadlock-freedom Property
- Open Access
- 11 December 2015
- Published by Association for Computing Machinery (ACM)
- p. 159-168
Comparing AODV and N-AODV Routing Protocols for Mobile Ad-hoc Networks
Mobile Ad-hoc NETworks (MANETs) are wireless networks designed for communications among nomadic hosts in absence of fixed infrastructure. Different reactive protocols for MANETs, in which routes are established only when needed, provide different network topology awareness (NTA) to each host, depending on their algorithmic features. NACK-based AODV (N-AODV) is a variant of the well-known Ad-hoc On-demand Distance Vector (AODV) reactive protocol for MANETs we proposed with the aim of improving NTA of the original protocol. In this paper, a performance comparison between AODV and N-AODV is conducted in order to investigate whether N-AODV effectively improves NTA with respect to AODV, and how this improvement affects both its effectiveness and efficiency. The experiment is executed within a simulation environment. The obtained results show that a MANET adopting N-AODV exploits higher NTA than a MANET adopting AODV. Moreover, the improved awareness impacts effectiveness and efficiency of routing activities because, in the long-run, it results in a lower need to activate the route discovery process for establishing new communications sessions
- 11 December 2015
- Published by Association for Computing Machinery (ACM)
- p. 159-168
Open AccessComparing AODV and N-AODV Routing Protocols for Mobile Ad-hoc Networks
Mobile Ad-hoc NETworks (MANETs) are wireless networks designed for communications among nomadic hosts in absence of fixed infrastructure. Different reactive protocols for MANETs, in which routes are established only when needed, provide different network topology awareness (NTA) to each host, depending on their algorithmic features. NACK-based AODV (N-AODV) is a variant of the well-known Ad-hoc On-demand Distance Vector (AODV) reactive protocol for MANETs we proposed with the aim of improving NTA of the original protocol. In this paper, a performance comparison between AODV and N-AODV is conducted in order to investigate whether N-AODV effectively improves NTA with respect to AODV, and how this improvement affects both its effectiveness and efficiency. The experiment is executed within a simulation environment. The obtained results show that a MANET adopting N-AODV exploits higher NTA than a MANET adopting AODV. Moreover, the improved awareness impacts effectiveness and efficiency of routing activities because, in the long-run, it results in a lower need to activate the route discovery process for establishing new communications sessions
- 27 May 2015
- Published by Springer Nature
- p. 479-488
Applying Predicate Abstraction to Abstract State Machines
- 27 May 2015
- Published by Springer Nature
- p. 479-488
Applying Predicate Abstraction to Abstract State Machines
- 27 May 2015
- Published by Springer Nature
- p. 283-292
Applying Predicate Abstraction to Abstract State Machines
- 27 May 2015
- Published by Springer Nature
- p. 283-292
Applying Predicate Abstraction to Abstract State Machines
- 1 January 2011
- Published by Springer Nature
- p. 249-259
Modelling Multimodal 3D Virtual Environments with Asynchronous Multi-Agent Abstract State Machine
- 1 January 2011
- Published by Springer Nature
- p. 249-259
Modelling Multimodal 3D Virtual Environments with Asynchronous Multi-Agent Abstract State Machine
- 1 January 2011
- Published by Civil-Comp, Ltd.
- Vol. 95
A Distributed Abstract State Machine for Grid Systems: A Preliminary Study
Grid systems technology has evolved over recent years and the Open Grid Service\ud Architecture (OGSA) has rapidly become the “de facto” standard. OGSA includes\ud several important capabilities needed to support Grid applications and, among them,\ud the job management and execution capability, which concern searching candidate\ud locations and executing and managing jobs until end. Such functionalities enable\ud users to use distributed resources for their applications. These tasks are critical in the\ud Grid system context because their incorrect execution can heavily affect provided\ud services, so adoption of formal method is sometimes mandatory. This paper is aimed\ud at defining an abstract model for specifying the job management and execution\ud services. We propose a Distributed Abstract State Machine (DASM) mode
- 1 January 2011
- Published by Civil-Comp, Ltd.
- Vol. 95
A Distributed Abstract State Machine for Grid Systems: A Preliminary Study
Grid systems technology has evolved over recent years and the Open Grid Service\ud Architecture (OGSA) has rapidly become the “de facto” standard. OGSA includes\ud several important capabilities needed to support Grid applications and, among them,\ud the job management and execution capability, which concern searching candidate\ud locations and executing and managing jobs until end. Such functionalities enable\ud users to use distributed resources for their applications. These tasks are critical in the\ud Grid system context because their incorrect execution can heavily affect provided\ud services, so adoption of formal method is sometimes mandatory. This paper is aimed\ud at defining an abstract model for specifying the job management and execution\ud services. We propose a Distributed Abstract State Machine (DASM) mode
- 1 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21567190,p. 220-225
Studying MANET through a Petri Net-Based Model
Several problems related to communication among Mobile Ad-hoc NETworks (MANETs) devices can be faced making use of formal models. Among these, Petri Nets are particularly suitable for modeling dynamic and transitional systems. The tool DEMONE models the behavior of each host in a MANET through a Petri Nets extension, so that it allows the analysis of some interesting computational activities and the study of performance of the modeled MANET.
- 1 September 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21567190,p. 220-225
Studying MANET through a Petri Net-Based Model
Several problems related to communication among Mobile Ad-hoc NETworks (MANETs) devices can be faced making use of formal models. Among these, Petri Nets are particularly suitable for modeling dynamic and transitional systems. The tool DEMONE models the behavior of each host in a MANET through a Petri Nets extension, so that it allows the analysis of some interesting computational activities and the study of performance of the modeled MANET.