Arrow Research search

Author name cluster

Gianluca Torta

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

9 papers
2 author rows

Possible papers

9

FM Conference 2026 Conference Paper

Distributed Runtime Verification in Proximity-Based Networks: A Tutorial on the Aggregate Programming Approach

  • Giorgio Audrito
  • Ferruccio Damiani
  • Giordano Scarso
  • Volker Stolz
  • Gianluca Torta

Abstract Distributed runtime verification (DRV) addresses the problem of checking the correctness of distributed systems during execution, coping with partial knowledge, dynamic topologies, and the absence of global time. These challenges are particularly prominent in proximity-based networks, such as those arising in IoT and Far Edge computing scenarios, where large numbers of devices interact through local communication. This tutorial presents an approach to DRV based on Aggregate Programming (AP), a paradigm for designing distributed collective systems via high-level abstractions over computational fields. We show how temporal and spatial properties (expressed in past-CTL and SLCS, respectively) can be systematically compiled into aggregate monitors grounded in the eXchange Calculus and executed using the FCPP C++ framework and simulator for AP. The tutorial combines conceptual foundations with practical guidance: participants learn how to specify spatio-temporal properties, generate corresponding monitors, and execute them in a 3D simulation environment. Examples are drawn from ongoing industrial collaborations and research projects, which we use to illustrate realistic monitoring scenarios and motivate open challenges for AP-based DRV.

DOI

AAMAS Conference 2019 Conference Paper

Explaining Failures Propagations in the Execution of Multi-Agent Temporal Plans

  • Gianluca Torta
  • Roberto Micalizio
  • Samuele Sormano

This paper addresses the problem of explaining execution failures in Temporal Multiagent Plans (TMAPs). A diagnosis identifies faulty actions (primary failures), and those that were affected by fault propagation (secondary failures). Temporal explanations group diagnoses for increasing understanding.

PDF

AAMAS Conference 2018 Conference Paper

SMT-Based Diagnosis of Multi-Agent Temporal Plans

  • Gianluca Torta
  • Roberto Micalizio

The paper proposes a model and methodology for diagnosing action failures in the execution of Temporal Multi-Agent Plans (TMAPs). Contrary to previous proposals in the literature, we characterize actions with a finite set of possible execution modes, where each mode prescribes not only the logic post-conditions of the actions, but also an interval of possible durations. Diagnoses are defined as assignments of modes to the actions that are consistent with the received observations and have the highest likelihood. We propose an algorithm that exploits a Satisfiability Modulo Theories (SMT) solver for the efficient computation of diagnoses. Preliminary experimental results are also presented.

PDF

JAAMAS Journal 2015 Journal Article

Explaining interdependent action delays in multiagent plans execution

  • Roberto Micalizio
  • Gianluca Torta

Abstract In this paper we address the problem of diagnosing the execution of Multiagent Plans with interdependent action delays. To this end, we map our problem to the Model-Based Diagnosis setting, and solve it by devising a novel modeling and reasoning method to infer preferred diagnoses based on partial observation of the start and end times of plan actions. Interestingly, we show that the kind of problem we address can be seen as an extension to the well known disjunctive temporal problem with preferences, augmented with a (qualitative) Bayesian network that models dependencies among action delays. An extensive set of tests performed with a prototype implementation on two different problem domains proves the feasibility of the proposed methodology.

Details DOI

ECAI Conference 2012 Conference Paper

Diagnosing Delays in Multi-Agent Plans Execution

  • Roberto Micalizio
  • Gianluca Torta

The paper introduces the notion of Temporal Multi-Agent Plan (TMAP) and proposes a methodology, based on Simple Temporal Problems (STP), for detecting and diagnosing action execution delays. Actions are characterized by a finite set of behavioral modes, and each behavioral mode is a continuous interval of possible durations of the action. Nominal modes represent the expected durations, whereas faulty modes represent delays. Solving such diagnostic problems requires to find an assignment of modes to the actions that is consistent with the received observations and maximizes the likelihood of the delayed durations. An implementation of the approach and some preliminary experimental results are also discussed.

Details

IJCAI Conference 2003 Conference Paper

Automatic Abstraction in Component-Based Diagnosis Driven by System Observability

  • Gianluca Torta
  • Pietro Torasso

The paper addresses the problem of automatic abstraction of component variables in the context of Model Based Diagnosis, in order to produce models capable of deriving fewer and more general diagnoses when the current observabil­ ity of the system is reduced. The notion of indiscriminability among faults of a set of compo­ nents is introduced and constitutes the basis for a formal definition of admissible abstractions which preserve all the distinctions that are rel­ evant for diagnosis given the current observabil­ ity of the system. The automatic synthesis of abstract models further restricts abstractions such that the behavior of abstract components is expressed in terms of a simple and intuitive combination of the behavior of their subcom­ ponents. As a validation of our proposal, we present experimental results which show the re­ duction in the number of diagnoses returned by a diagnostic agent for a space robotic arm.

PDF
v2026.09.13