Gigliola Vaglini

Prof. Gigliola Vaglini


Research Focus & Metrics

Academic Career Length

41Years (1986-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 1986 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
FBFabrizio Baiardi
Fabrizio Baiardi
NFNicoletta De Francesco
Nicoletta De Francesco
GVGigliola Vaglini
Gigliola Vaglini
The authors discuss issues related to the debugging of concurrent programs. A set of desirable characteristics for a debugger for concurrent languages is deduced from a review of the differences between the debugging of concurrent programs and that of sequential ones. A debugger for concurrent language based upon CSP is then described. The debugger makes it possible to compare a description of the expected program behavior to the actual behaviour. The description of the behavior is given in terms of expressions composed by events and/or assertions on the process state. The developed formalism is able to describe behaviors at various levels of abstraction. Lastly, some guidelines for the implementation of the debugger are given and a detailed example of program debugging is analyzed.

31 January 2013 in Computer Networks
Verified
Journal Article
Open access
PCPaola Cappanera
Paola Cappanera
LLLuciano Lenzini
Luciano Lenzini
ALAlessandro Lori
Alessandro Lori
Giovanni SteaGiovanni Stea
Giovanni Stea
GVGigliola Vaglini
Gigliola Vaglini
We investigate the problem of joint routing and link scheduling in Time-Division Multiple Access (TDMA) Wireless Mesh Networks (WMNs) carrying real-time traffic. We propose a framework that always computes a feasible solution (i.e. a set of paths and link activations) if there exists one, by optimally solving a mixed integer-nonlinear problem. Such solution can be computed in minutes or tens thereof for e.g. grids of up to 4 × 4 nodes. We also propose heuristics based on Lagrangian decomposition to compute suboptimal solutions considerably faster and/or for larger WMNs, up to about 50 nodes. We show that the heuristic solutions are near-optimal, and we exploit them to gain insight on the schedulability in WMN, i.e. to investigate the optimal placement of one or more gateways from a delay bound perspective, and to investigate how the schedulability is affected by the transmission range.

3 July 2012 in Acta Informatica
Verified
Journal Article
Closed access
PDF file
ASAntonella Santone
Antonella Santone
GVGigliola Vaglini
Gigliola Vaglini

21 May 2014 in Software and Systems Modeling
Verified
Journal Article
Closed access
PDF file
NFNicoletta De Francesco
Nicoletta De Francesco
Giuseppe LettieriGiuseppe Lettieri
Giuseppe Lettieri
ASAntonella Santone
Antonella Santone
GVGigliola Vaglini
Gigliola Vaglini

1 May 2005 in Formal Methods in System Design
Verified
Journal Article
Closed access
PDF file
RBRoberto Barbuti
Roberto Barbuti
NFNicoletta De Francesco
Nicoletta De Francesco
ASAntonella Santone
Antonella Santone
GVGigliola Vaglini
Gigliola Vaglini

26 May 2014 in Information
Verified
Journal Article
Open access
PDF file
MCMario G.C.A. Cimino
Mario G.C.A. Cimino
GVGigliola Vaglini
Gigliola Vaglini
Simulating organizational processes characterized by interacting human activities, resources, business rules and constraints, is a challenging task, because of the inherent uncertainty, inaccuracy, variability and dynamicity. With regard to this problem, currently available business process simulation (BPS) methods and tools are unable to efficiently capture the process behavior along its lifecycle. In this paper, a novel approach of BPS is presented. To build and manage simulation models according to the proposed approach, a simulation system is designed, developed and tested on pilot scenarios, as well as on real-world processes. The proposed approach exploits interval-valued data to represent model parameters, in place of conventional single-valued or probability-valued parameters. Indeed, an interval-valued parameter is comprehensive; it is the easiest to understand and express and the simplest to process, among multi-valued representations. In order to compute the interval-valued output of the system, a genetic algorithm is used. The resulting process model allows forming mappings at different levels of detail and, therefore, at different model resolutions. The system has been developed as an extension of a publicly available simulation engine, based on the Business Process Model and Notation (BPMN) standard.