Search

Your search keyword '"Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE)"' showing total 49 results
Start Over Author "Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE)"
49 results on '"Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE)"'

1. Can machines learn to see without visual databases?

Author

Betti, Alessandro, Gori, Marco, Melacci, Stefano, Pelillo, Marcello, Roli, Fabio, Université Côte d'Azur (UCA), Modèles et algorithmes pour l’intelligence artificielle (MAASAI), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Scalable and Pervasive softwARe and Knowledge Systems (Laboratoire I3S - SPARKS), Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Université Nice Sophia Antipolis (1965 - 2019) (UNS), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis (I3S), COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-COMUE Université Côte d'Azur (2015-2019) (COMUE UCA)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UCA)-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Ingegneria dell'informazione e scienze matematiche [Siena] (DIISM), Università degli Studi di Siena = University of Siena (UNISI), University of Ca’ Foscari [Venice, Italy], Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
FOS: Computer and information sciences, Computer Science - Machine Learning, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Computer Vision and Pattern Recognition (cs.CV), Computer Science - Computer Vision and Pattern Recognition, [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

This paper sustains the position that the time has come for thinking of learning machines that conquer visual skills in a truly human-like context, where a few human-like object supervisions are given by vocal interactions and pointing aids only. This likely requires new foundations on computational processes of vision with the final purpose of involving machines in tasks of visual description by living in their own visual environment under simple man-machine linguistic interactions. The challenge consists of developing machines that learn to see without needing to handle visual databases. This might open the doors to a truly orthogonal competitive track concerning deep learning technologies for vision which does not rely on the accumulation of huge visual databases.

Published
2022

2. Real‐Time Deformation with Coupled Cages and Skeletons

Author

Jean-Marc Thiery, Tamy Boubekeur, Fabrizio Corda, Riccardo Scateni, Marco Livesu, Enrico Puppo, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Télécom Paris, Laboratoire Traitement et Communication de l'Information (LTCI), Institut Mines-Télécom [Paris] (IMT)-Télécom Paris, Institut Polytechnique de Paris (IP Paris), Istituto di Matematica Applicata e Tecnologie Informatiche (IMATI-CNR), Consiglio Nazionale delle Ricerche [Roma] (CNR), University of Genoa (UNIGE), and Adobe

Subjects
FOS: Computer and information sciences, • Computing methodologies → Shape modelling, Deformation (mechanics), deformations, Computer science, animation, Distributed computing, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, 020207 software engineering, 02 engineering and technology, Animation, modelling, Skeleton (category theory), Deformation (meteorology), Computer Graphics and Computer-Aided Design, Graphics (cs.GR), GeneralLiterature_MISCELLANEOUS, +Shape+modelling%22">center dot Computing methodologies -> Shape modelling, Computer Science - Graphics, Coupling (computer programming), 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, ComputingMethodologies_COMPUTERGRAPHICS
Abstract

International audience; Skeleton-based and cage-based deformation techniques represent the two most popular approaches to control real-time deformations of digital shapes and are, to a vast extent, complementary to one another. Despite their complementary roles, high-end modelling packages do not allow for seamless integration of such control structures, thus inducing a considerable burden on the user to maintain them synchronized. In this paper, we propose a framework that seamlessly combines rigging skeletons and deformation cages, granting artists with a real-time deformation system that operates using any smooth combination of the two approaches. By coupling the deformation spaces of cages and skeletons, we access a much larger space, containing poses that are impossible to obtain by acting solely on a skeleton or a cage. Our method is oblivious to the specific techniques used to perform skinning and cage-based deformation, securing it compatible with pre-existing tools. We demonstrate the usefulness of our hybrid approach on a variety of examples.

Published
2020

3. Scale-Free Estimation of the Average State in Large-Scale Systems

Author

Carlos Canudas-de-Wit, Diego Deplano, Muhammad Umar B. Niazi, Alain Y. Kibangou, Systèmes Commandés en Réseau (NECS-POST), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Département Automatique (GIPSA-DA), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, and European Project: 694209,Advanced Grant (AdG), ERC-2015-AdG ,Scale-FreeBack(2016)

Subjects
0209 industrial biotechnology, Control and Optimization, estimation, Scale (ratio), Observer (quantum physics), [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], 020208 electrical & electronic engineering, 02 engineering and technology, State (functional analysis), Upper and lower bounds, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Task (project management), 020901 industrial engineering & automation, algebraic/geometric methods, Dimension (vector space), Large-scale systems, Control and Systems Engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], 0202 electrical engineering, electronic engineering, information engineering, Task analysis, Applied mathematics, State observer, Mathematics
Abstract

International audience; This paper provides a computationally tractable necessary and sufficient condition for the existence of an average state observer for large-scale linear time-invariant (LTI) systems. Two design procedures, each with its own significance, are proposed. When the necessary and sufficient condition is not satisfied, a methodology is devised to obtain an optimal asymptotic estimate of the average state. In particular, the estimation problem is addressed by aggregating the unmeasured states of the original system and obtaining a projected system of reduced dimension. This approach reduces the complexity of the estimation task and yields an observer of dimension one. Moreover, it turns out that the dimension of the system also does not affect the upper bound on the estimation error.

Published
2020

4. A Channel Selection Model based on Trust Metrics for Wireless Communications

Author

Claudio Marche, Valeria Loscri, Michele Nitti, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Self-organizing Future Ubiquitous Network (FUN), Inria Lille - Nord Europe, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
Countermeasure In Wireless Networks Communications Channel Selection Trustworthiness Management Jamming Attacks, Trustworthiness Management, Countermeasure In Wireless Networks, Computer Networks and Communications, Communications Channel Selection, Jamming Attacks, [INFO]Computer Science [cs], [MATH]Mathematics [math], Electrical and Electronic Engineering
Abstract

International audience; Dynamic allocation of frequency resources to nodes in a wireless communication network is a well-known method adopted to mitigate potential interference, both unintentional and malicious. Various selection approaches have been adopted in literature, to limit the impact of interference and keep a high quality of wireless links. In this paper, we propose a different channel selection method, based on trust policies. The trust management approach proposed in this work relies on the node's own experience and trust recommendations provided by its neighbourhood. By means of simulation results in Network Simulator NS-3, we demonstrate the effectiveness of the proposed trust method, while the system is under jamming attacks, in respect of a baseline approach. We also consider and evaluate the resilience of our approach in respect of malicious nodes, providing false information regarding the quality of the channel, to induct bad channel selection of the node. Results show how the system is resilient in respect of malicious nodes, keeping around 10% of throughput more than an approach only based on the own proper experience, considering the presence of 40% of malicious nodes, both single and collusive attacks.

Published
2023

5. Correction to 'Synchronizing sequences on a class of unbounded systems using synchronized Petri nets'

Author

Isabel Demongodin, Alessandro Giua, Changshun Wu, Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Modèles et Formalismes à Evénements Discrets (MOFED), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
Discrete mathematics, 030213 general clinical medicine, 0209 industrial biotechnology, Computer science, Repetitive Sequences, Synchronizing, Class (philosophy), 02 engineering and technology, Construct (python library), Petri net, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, 03 medical and health sciences, 020901 industrial engineering & automation, 0302 clinical medicine, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Modeling and Simulation, Graph (abstract data type), [INFO]Computer Science [cs], Electrical and Electronic Engineering, ComputingMilieux_MISCELLANEOUS
Abstract

The paper mentioned in the title proposed a new definition of increasing repetitive input sequences for synchronized Petri nets and stated that it can be used to construct a finite modified coverability graph for any unbounded SynPN. In this note, we discuss the notion of unboundedness for SynPNs and show via an example that actually the modified coverability graph may be infinite due the presence of increasing sequences that are not repetitive.

Published
2019

6. Dataflow-Functional High-Level Synthesis for Coarse-Grained Reconfigurable Accelerators

Author

Francesca Palumbo, Carlo Sau, Ruben Salvador, Maxime Pelcat, Luigi Raffo, Karol Desnos, Claudio Rubattu, Jocelyn Serot, Institut d'Électronique et des Technologies du numéRique (IETR), Nantes Université (NU)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), University of Sassari, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Universidad Politécnica de Madrid (UPM), Institut Pascal (IP), SIGMA Clermont (SIGMA Clermont)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020]), 732105, H2020 LEIT Information and Communication Technologies, POR FESR 2014/20-ASSE I, PROSSIMO Project, 687698, HiPEAC Project (H2020), Université de Nantes (UN)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Università degli Studi di Sassari = University of Sassari [Sassari] (UNISS), SIGMA Clermont (SIGMA Clermont)-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), and Université de Nantes (UN)-Université de Rennes 1 (UR1)

Subjects
HLS, General Computer Science, Design space exploration, Computer science, Dataflow, Functional Programming, MDC, 02 engineering and technology, Design Productivity, High-level synthesis, 0202 electrical engineering, electronic engineering, information engineering, Dataflow MoC, Coarse-Grained Reconfiguration, Field-programmable gate array, FPGA, Functional programming, Model of computation, 020208 electrical & electronic engineering, Control reconfiguration, Supercomputer, CAPH, 020202 computer hardware & architecture, Computer architecture, Control and Systems Engineering, Design Predictability, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Domain-specific acceleration is now a "must" for all the computing spectrum, going from high performance computing to embedded systems. Unfortunately, system specialization is by nature a nightmare from the design productivity perspective. Nevertheless, in contexts where kernels to be accelerated are intrinsically streaming oriented, the combination of dataflow models of computation with Coarse-Grained Reconfigurable (CGR) architectures can be particularly handful. In this paper we introduce a novel methodology to assemble and characterize virtually reconfigurable accelerators based on dataflow and functional programming principles, capable of addressing design productivity issues for CGR accelerators. The main advantage of the proposed methodology is accurate IP-level latency predictability improving Design Space Exploration (DSE) when compared to state-of-the-art High-Level Synthesis (HLS).

Published
2019

7. Verification of Detectability for Unambiguous Weighted Automata

Author

Aiwen Lai, Alessandro Giua, Sébastien Lahaye, Laboratoire Angevin de Recherche en Ingénierie des Systèmes (LARIS), Université d'Angers (UA), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
0209 industrial biotechnology, Finite-state machine, Observer (quantum physics), Computer science, Estimator, 02 engineering and technology, State (functional analysis), Petri net, Computer Science Applications, Automaton, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Set (abstract data type), 020901 industrial engineering & automation, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Electrical and Electronic Engineering, Finite set, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

In this article, we deal with the detectability problem for unambiguous weighted automata (UWAs). The problem is to determine if, after a finite number of observations, the set of possible states is reduced to a singleton. Four types of detectabilities, namely, strong detectability, detectability, strong periodic detectability, and periodic detectability are defined in terms of different requirements for current state estimation. We first construct a deterministic finite state automaton (called observer) over a weighted alphabet and prove that it can be used as the current-state estimator of the studied UWA. Finally, necessary and sufficient conditions based on the observer are proposed to verify detectabilities of a UWA.

Published
2021

8. Can Domain Knowledge Alleviate Adversarial Attacks in Multi-Label Classifiers?

Author

Melacci, Stefano, Ciravegna, Gabriele, Sotgiu, Angelo, Demontis, Ambra, Biggio, Battista, Gori, Marco, Roli, Fabio, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, ANR-19-P3IA-0002,3IA@cote d'azur,3IA Côte d'Azur(2019), Gori, Marco, and 3IA Côte d'Azur - - 3IA@cote d'azur2019 - ANR-19-P3IA-0002 - P3IA - VALID

Subjects
[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO]Computer Science [cs], [INFO] Computer Science [cs], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

Adversarial attacks on machine learning-based classifiers, along with defense mechanisms, have been widely studied in the context of single-label classification problems. In this paper, we shift the attention to multi-label classification, where the availability of domain knowledge on the relationships among the considered classes may offer a natural way to spot incoherent predictions, i.e., predictions associated to adversarial examples lying outside of the training data distribution. We explore this intuition in a framework in which first-order logic knowledge is converted into constraints and injected into a semi-supervised learning problem. Within this setting, the constrained classifier learns to fulfill the domain knowledge over the marginal distribution, and can naturally reject samples with incoherent predictions. Even though our method does not exploit any knowledge of attacks during training, our experimental analysis surprisingly unveils that domain-knowledge constraints can help detect adversarial examples effectively, especially if such constraints are not known to the attacker. While we also show that an adaptive attack exploiting knowledge of the constraints may still deceive our classifier, it remains an open issue to understand how hard for an attacker would be to infer such constraints in practical cases. For this reason, we believe that our approach may provide a significant step towards designing robust multi-label classifiers.

Published
2020

9. Containment of rumor spread in complex social networks

Author

Lan Yang, Zhiwu Li, Alessandro Giua, Xidian University, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
Mathematical optimization, Information Systems and Management, Computer science, Heuristic (computer science), media_common.quotation_subject, Control (management), 02 engineering and technology, Blocking (statistics), [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Theoretical Computer Science, law.invention, PageRank, Artificial Intelligence, law, Order (exchange), TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY, 0202 electrical engineering, electronic engineering, information engineering, ComputingMilieux_MISCELLANEOUS, media_common, Social network, business.industry, 05 social sciences, Censorship, 050301 education, Rumor, Computer Science Applications, Control and Systems Engineering, 020201 artificial intelligence & image processing, State (computer science), business, Centrality, 0503 education, Software
Abstract

Rumors can propagate at great speed through social networks and produce significant damages. In order to control rumor propagation, spreading correct information to counterbalance the effect of the rumor seems more appropriate than simply blocking rumors by censorship or network disruption. In this paper, a competitive diffusion model, namely Linear Threshold model with One Direction state Transition (LT1DT), is proposed for modeling competitive information propagation of two different types in the same network. The problem of minimizing rumor spread in social networks is explored and a novel heuristic based on diffusion dynamics is proposed to solve this problem under the LT1DT. Experimental analysis on four different networks shows that the novel heuristic outperforms pagerank centrality. By seeding correct information in the proximity of rumor seeds, the novel heuristic performs as well as the greedy approach in scale-free and small-world networks but runs three orders of magnitude faster than the greedy approach.

Published
2020

10. Conversion of 1-Place-Unbounded Synchronized Petri Nets into Weighted Automata

Author

Alessandro Giua, Changshun Wu, Isabel Demongodin, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
030213 general clinical medicine, 0209 industrial biotechnology, Theoretical computer science, Computer science, 02 engineering and technology, Petri net, Graph, Automaton, [SPI]Engineering Sciences [physics], 03 medical and health sciences, 020901 industrial engineering & automation, 0302 clinical medicine, Control and Systems Engineering, Stochastic Petri net, State space, Systems design, ComputingMilieux_MISCELLANEOUS
Abstract

Testing is a fundamental technique for system design and verification to ensure security and reliability. However its application to discrete event systems modeled by unbounded synchronized Petri nets is not straightforward because there exists no finite exact representation for the infinite state space of these models. In this paper, we consider a special class of synchronized Petri nets, called 1-place-unbounded, that contain a single unbounded place. We show how a coverability graph that precisely describes the state space of such a model can be constructed extending to synchronized nets a technique previously presented for place/transition nets. In addition, this algorithm can also be used to verify whether a given synchronized Petri net contains exactly a single unbounded place. Next, we show that any net belonging to this special class can be converted into an equivalent weighted automaton. Based on this conversion, we observe that the testing of 1-place-unbounded synchronized Petri nets can be approached using the methods and results existing in the literature for the testing of weighted automata.

Published
2017

11. Modeling, analysis and control of Discrete Event Systems: a Petri net perspective

Author

Alessandro Giua, Manuel Silva, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, University of Zaragoza - Universidad de Zaragoza [Zaragoza], Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
0209 industrial biotechnology, Automatic control, business.industry, Computer science, Event (computing), Control (management), Perspective (graphical), 02 engineering and technology, Petri net, Process architecture, Field (computer science), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Software, Control and Systems Engineering, 0202 electrical engineering, electronic engineering, information engineering, Systems engineering, 020201 artificial intelligence & image processing, business, ComputingMilieux_MISCELLANEOUS
Abstract

The goal of this contribution is to briefly overview the historical development of the field of Petri nets under a System Theory and Automatic Control perspective. It is by far not meant to be comprehensive or inclusive, but to review through several representative areas a few of the conceptual issues studied in the literature. It was not possible to consider here the many domains of application were the Petri Nets modeling paradigm was used, among many others: manufacturing, logistic, hardware and software, protocols engineering, health management, transportation, etc.

Published
2017

12. Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem

Author

Alessandro Giua, Zhiwu Li, Yin Tong, Ziyue Ma, Xidian University, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
Discrete mathematics, 0209 industrial biotechnology, Reachability problem, 02 engineering and technology, Petri net, Data structure, Subnet, Electronic mail, Computer Science Applications, Combinatorics, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, Reachability, Computer Science::Logic in Computer Science, 0202 electrical engineering, electronic engineering, information engineering, Stochastic Petri net, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Time complexity, Computer Science::Formal Languages and Automata Theory, Mathematics
Abstract

In this paper, a compact representation of the reachability graph of a Petri net is proposed. The transition set of a Petri net is partitioned into the subsets of explicit and implicit transitions in such a way that the subnet induced by implicit transitions does not contain directed cycles. The firing of implicit transitions can be abstracted so that the reachability set of the net can be completely characterized by a subset of reachable markings called basis makings . We show that to determine a max-cardinality- $T_{I}$ basis partition is an NP-hard problem, but a max-set- $T_{I}$ basis partition can be determined in polynomial time. The generalized version of the marking reachability problem in a Petri net can be solved by a practically efficient algorithm based on the basis reachability graph. Finally, this approach is further extended to unbounded nets.

Published
2017

13. Rumor Containment by Spreading Correct Information in Social Networks

Author

Lan Yang, Alessandro Giua, Zhiwu Li, Xidian University, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
020203 distributed computing, 0209 industrial biotechnology, Containment (computer programming), Social network, Computer science, business.industry, Heuristic, media_common.quotation_subject, Control (management), Censorship, 02 engineering and technology, Rumor, Blocking (statistics), [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], 020901 industrial engineering & automation, Order (exchange), 0202 electrical engineering, electronic engineering, information engineering, Damages, Artificial intelligence, business, ComputingMilieux_MISCELLANEOUS, media_common
Abstract

Rumors can propagate at great speed through social networks and produce significant damages. In order to control rumor propagation, spreading correct information to counterbalance the effect of the rumor seems more appropriate than simply blocking rumors by censorship or network disruption. In this paper, a competitive diffusion model, namely Linear Threshold model with One Direction state Transition (LT1DT), is proposed for modeling competitive information propagation of two different types in the same network. Unlike other competitive diffusion models in which individual beliefs do not change once adopted, LT1DT can model the behavior of a person that, although initially influenced by the rumor, can change his/her mind when receiving correct information. The problem of minimizing rumor spread in social networks is explored. Several simulations on two real-world datasets using four heuristic approaches are presented.

Published
2019

14. State estimation of max-plus automata with unobservable events

Author

Aiwen Lai, Alessandro Giua, Sébastien Lahaye, Université d'Angers (UA), Laboratoire Angevin de Recherche en Ingénierie des Systèmes (LARIS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
0209 industrial biotechnology, Sequence, Interpretation (logic), Theoretical computer science, Computer science, 020208 electrical & electronic engineering, Class (philosophy), 02 engineering and technology, 16. Peace & justice, Unobservable, Automaton, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Set (abstract data type), 020901 industrial engineering & automation, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], State (computer science), Electrical and Electronic Engineering, Computer Science::Formal Languages and Automata Theory, ComputingMilieux_MISCELLANEOUS, Event (probability theory)
Abstract

The state estimation problem is a fundamental issue in discrete event systems. Partial observations arise when the occurrence of some events cannot be detected. The considered problem then consists in finding all the states in which the system may be when an observed sequence is given. To the best of our knowledge there are few works dealing with this problem in the framework of timed discrete event systems. In this paper we investigate state estimation for systems represented as max-plus automata. Max-plus automata represent a particular class of weighted automata and if a timed interpretation is given to weights, then max-plus automata are strongly related to timed automata. We first give the definition of consistent states with respect to an observed timed sequence and a given time instant. Then, based on the state vectors of a max-plus automaton, an algorithm is proposed to compute the set of all consistent states.

Published
2019

15. A Two-Step Approach for Fault Diagnosis of Max-Plus Automata

Author

Aiwen Lai, Sébastien Lahaye, Alessandro Giua, Université d'Angers (UA), Laboratoire Angevin de Recherche en Ingénierie des Systèmes (LARIS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
0209 industrial biotechnology, Sequence, Computer science, 020208 electrical & electronic engineering, 02 engineering and technology, Disjoint sets, Fault (power engineering), Unobservable, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Automaton, Set (abstract data type), 020901 industrial engineering & automation, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], 0202 electrical engineering, electronic engineering, information engineering, State (computer science), Algorithm, ComputingMilieux_MISCELLANEOUS, Event (probability theory)
Abstract

In this paper, a two-step approach for on-line fault diagnosis of timed discrete event systems modeled with max-plus automata is presented. The set of events is divided into two disjoint subsets, i.e., observable and unobservable subsets, and failures are associated to unobservable ones. Once a sequence of pairs (event, time-instant) is observed, the fault diagnosis problem consists in detecting an abnormality of the system evolution and isolating the source of this abnormality. For a max-plus automaton, we first propose an algorithm to build its augmented version whose states are partitioned into two disjoint parts, the normal part and the faulty part, with respect to a given fault class. Then we prove that solving fault diagnosis of the original automaton is equivalent to estimating the states of the augmented automaton. Finally, an algorithm is proposed to summarize how to perform on-line fault diagnosis using a state estimation based approach.

Published
2019

16. Influence minimization in linear threshold networks

Author

Alessandro Giua, Lan Yang, Zhiwu Li, Xidian University, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), and University of Cagliari

Subjects
0209 industrial biotechnology, Mathematical optimization, Social network, Computer science, Heuristic (computer science), business.industry, 020208 electrical & electronic engineering, 02 engineering and technology, Maximization, Linear threshold, 020901 industrial engineering & automation, Control and Systems Engineering, Simple (abstract algebra), [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, Minification, Electrical and Electronic Engineering, Focus (optics), business, Integer programming, ComputingMilieux_MISCELLANEOUS
Abstract

The propagation of information and innovation in social networks has been widely studied in recent years. Most of the previous works focus on solving the problem of influence maximization, which aims to identify a small subset of early adopters in a social network to maximize the influence propagation under a given diffusion model. On the contrary in this paper, motivated by real-world scenarios, we propose two different influence minimization problems. We consider a linear threshold diffusion model and provide a general solution to the first problem by solving an integer linear programming problem. For the second problem, we provide a technique to search for an optimal solution that works only in particular cases and discuss a simple heuristic to find a solution in the general case. Several simulations on real datasets are also presented.

Published
2019

17. Influence Maximization in Independent Cascade Networks Based on Activation Probability Computation

Author

Wenjing Yang, Leonardo Brenner, Alessandro Giua, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), and China Scholarship Council (CSC), the project PHC CAI YUANPEI 2017 from Campus Franceunder Project No. 38908TK, and the National Natural Science Foundation of China under Grant No. 61703321 and 61672400.

Subjects
social networks, influence maximization, General Computer Science, Independent cascade model, Stochastic modelling, Computer science, Computation, General Engineering, 020206 networking & telecommunications, 02 engineering and technology, Maximization, Upper and lower bounds, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], TK1-9971, Set (abstract data type), [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, General Materials Science, Node (circuits), Electrical engineering. Electronics. Nuclear engineering, Greedy algorithm, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; Based on the concepts of “word-of-mouth” effect and viral marketing, the diffusion of an innovation may be triggered starting from a set of initial users. Estimating the influence spread is a preliminary step to determine a suitable or even optimal set of initial users to reach a given goal. In this paper, we focus on a stochastic model called the independent cascade model and compare a few approaches to compute activation probabilities of nodes in a social network, i.e., the probability that a user adopts the innovation. First, we propose the path method that computes the exact value of the activation probabilities but has high complexity. Second, an approximated method, called SSS-Noself, is obtained by the modification of the existing SteadyStateSpread algorithm, based on fixed-point computation, to achieve better accuracy. Finally, an efficient approach, also based on fixed-point computation, is proposed to compute the probability that a node is activated through a path of minimal length from the seed set. This algorithm, called SSS-Bounded-Path algorithm, can provide a lower bound for the computation of activation probabilities. Furthermore, these proposed approaches are applied to the influence maximization problem combined with the SelectTopK algorithm, the RankedReplace algorithm, and the greedy algorithm.

Published
2019

18. Six-months assessment of a hand prosthesis with intraneural tactile feedback

Author

Petrini, Francesco, Valle, Giacomo, Strauss, Ivo, Granata, Giuseppe, Di Iorio, Riccardo, d'Anna, Edoardo, Čvančara, Paul, Mueller, Matthias, Carpaneto, Jacopo, Clemente, Francesco, Controzzi, Marco, Bisoni, Lorenzo, Carboni, Caterina, Barbaro, Michael, Iodice, Francesco, Andreu, David, Hiairrassary, Arthur, Divoux, Jean-Louis, Cipriani, Christian, Guiraud, David, Raffo, Luigi, Fernandez, Eduardo, Stieglitz, Thomas, Raspopovic, Stanisa, Rossini, Paolo Maria, Micera, Silvestro, Fondation Bertarelli Chair inTranslational Neuroscience and Neuroengineering [Lausanne], Center for Neuroprosthetics and Institute of Bioengineering, EPFL.-Fondation Bertarelli, Università cattolica del Sacro Cuore [Roma] (Unicatt), Fondazione 'Policlinico Universitario A. Gemelli' [Rome], Bernstein Center Freiburg (BCF), Albert-Ludwigs-Universität Freiburg, Scuola Universitaria Superiore Sant'Anna [Pisa] (SSSUP), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Control of Artificial Movement and Intuitive Neuroprosthesis (CAMIN), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), MXM-AXONIC, University of Freiburg [Freiburg], Department of Health Sciences and Technology [ETH Zürich] (D-HEST), Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology [Zürich] (ETH Zürich), This work was supported by EU grant CP-FP-INFSO224012 (TIME project), the project NEMESIS (Neurocontrolled Mechatronic Hand Prosthesis) funded by the Italian Ministry of Health, EU grant FP7-611687 (NEBIAS, NEurocontrolled BIdirectional Artificial upperlimb and hand prosthesiS), EU grant FP7-HEALTH-1602547 (EPIONE, Natural Sensory Feedback for Phan-tom Limb Pain Modulation and Therapy), the SwissNational Science Foundation through the National Center of Competence in Research Robotics, and the Bertarelli Foundation., European Project: 602547,EC:FP7:HEALTH,FP7-HEALTH-2013-INNOVATION-1,EPIONE(2013), European Project: 611687,EC:FP7:ICT,FP7-ICT-2013-10,NEBIAS(2013), Ecole Polytechnique Fédérale de Lausanne (EPFL)-Fondation Bertarelli, Università cattolica del Sacro Cuore = Catholic University of the Sacred Heart [Roma] (Unicatt), Fondazione Policlinico Universitario Agostino Gemelli IRCCS, and Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM)

Subjects
Neuroprosthetics, [SDV.NEU.NB]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]/Neurobiology, [SDV.MHEP.PHY]Life Sciences [q-bio]/Human health and pathology/Tissues and Organs [q-bio.TO], Neural stimulation, Sensory feedback, [SPI.AUTO]Engineering Sciences [physics]/Automatic
Abstract

International audience; OBJECTIVE:Hand amputation is a highly disabling event, which significantly affects quality of life. An effective hand replacement can be achieved if the user, in addition to motor functions, is provided with the sensations that are naturally perceived while grasping and moving. Intraneural peripheral electrodes have shown promising results toward the restoration of the sense of touch. However, the long-term usability and clinical relevance of intraneural sensory feedback have not yet been clearly demonstrated.METHODS:To this aim, we performed a six months clinical study with three trans-radial amputees who received implants of transverse intrafascicular multichannel electrodes (TIMEs) in their median and ulnar nerves. After calibration, electrical stimulation was delivered through the TIMEs connected to artificial sensors in the digits of a prosthesis to generate sensory feedback, which was then used by the subjects while performing different grasping tasks.RESULTS:All the subjects, notwithstanding their important clinical differences, reported stimulation-induced sensations from the phantom hand for the whole duration of the trial. They also successfully integrated the sensory feedback into their motor control strategies while performing experimental tests simulating tasks of real life (with and without the support of vision). Finally, they reported a decrement of their phantom limb pain and a general improvement in mood state.INTERPRETATION:The promising results achieved with all subjects show the feasibility of the use of intraneural stimulation in clinical settings.

Published
2019

19. A social internet of vehicles sharing SIoT relationships

Author

Michele Nitti, Giuseppe Ruggeri, Pietro Manzoni, Valeria Loscri, Anna Maria Vegni, acm, Loscrì, V., Manzoni, P., Nitti, M., Ruggeri, G., Vegni, A. M., Self-organizing Future Ubiquitous Network (FUN), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Universitat Politècnica de València (UPV), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, advanced research for telecommunication system (ARTS), Universita Mediterranea of Reggio Calabria [Reggio Calabria], Digital Signal Processing Multimedia & Optical Communications Laboratory [Rome] (COMLAB), Università degli Studi Roma Tre, and Università degli Studi Roma Tre = Roma Tre University (ROMA TRE)

Subjects
Connectivity, Vehicular ad hoc network, Social network, business.industry, Computer science, Internet privacy, [SCCO.COMP]Cognitive science/Computer science, 020206 networking & telecommunications, 020302 automobile design & engineering, 02 engineering and technology, Social relation, Interpersonal ties, Social Internet of Things, 0203 mechanical engineering, Social internet of things, 0202 electrical engineering, electronic engineering, information engineering, Social relationship, The Internet, business, Social Internet of Vehicular Things
Abstract

International audience; In recent years, the concept of social networking combined with the Internet of Vehicles has brought to the definition of the Social IoV (SIoV) paradigm, i.e., a social network where every vehicle is capable of establishing social relationships in an autonomous way with other vehicles or road infrastructure equipment. In SIoV, social networking is applied to vehicular networks according to how social ties are built upon, i.e., either among vehicles or humans. This creates a twofold nature of SIoV i.e., both based on human social relationships, and as an instance of the Social Internet of Things (SIoT). This twofold nature of SIoV is not in contrast with itself, but allows to distinguish different applications and use-cases. This paper analyzes the SIoT-based social relations in a vehicular network scenario for establishing a Social Internet of Vehicles and providing insights on this growing research area.

Published
2019

20. Proportional Dynamic Consensus in Open Multi-Agent Systems

Author

Paolo Frasca, Mauro Franceschelli, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Networked Controlled Systems (NECS), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Département Automatique (GIPSA-DA), Grenoble Images Parole Signal Automatique (GIPSA-lab ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Grenoble Images Parole Signal Automatique (GIPSA-lab ), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut Polytechnique de Grenoble - Grenoble Institute of Technology-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])

Subjects
Consensus algorithm, 0209 industrial biotechnology, Mathematical optimization, Computer science, Multi-agent system, Stability (learning theory), Context (language use), 02 engineering and technology, Term (time), [SPI.AUTO]Engineering Sciences [physics]/Automatic, Set (abstract data type), Modeling and simulation, Computer Science::Multiagent Systems, 020901 industrial engineering & automation, Consensus, Convergence (routing), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Abstract

International audience; In this paper we investigate a dynamic consensus problem for an open multi-agent system. Open multi-agent systems are characterized by a time-varying set of agents connected by a network: agents may leave and new agents may join the network at any time, thus the term “open”. The dynamic consensus problem consists in achieving agreement about the time-varying average of a set of reference signals that are assumed to be the agents’ inputs. Dynamic consensus has recently found application in the context of distributed estimation for electric demand-side management, where a large population of connected domestic appliances needs to estimate its future average power consumption. Since the considered network of devices changes as new appliances log in and out, there is a need to develop and characterize dynamic consensus algorithms for these open scenarios. In this paper we give several initial contributions both to a general theory of open multi-agent systems and to the specific problem of dynamic consensus within this context. On the theoretical side, we propose a formal definition of open multi-agent system, a suitable notion of stability, and some sufficient conditions to establish it. On the applied side, we design a novel dynamic consensus algorithm, the Open Proportional Dynamic Consensus algorithm. We characterize some of its convergence properties in the proposed open-multi-agent systems framework and we illustrate its evolution by numerical simulations.

Published
2018

21. Liveness Enforcement for a Class of Petri Nets via Resource Allocation

Author

Shouguang Wang, Dan You, Carla Seatzu, Wenli Duo, Kamel Barkaoui, Hao Dou, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Zhejiang University, CEDRIC. Systèmes sûrs (CEDRIC - SYS), Centre d'études et de recherche en informatique et communications (CEDRIC), and Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)

Subjects
0209 industrial biotechnology, Class (computer programming), Mathematical optimization, Computer science, Liveness, 02 engineering and technology, Petri net, Net (mathematics), 020901 industrial engineering & automation, Resource (project management), Simple (abstract algebra), [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], 0202 electrical engineering, electronic engineering, information engineering, Resource allocation, [INFO]Computer Science [cs], 020201 artificial intelligence & image processing, Enforcement, ComputingMilieux_MISCELLANEOUS
Abstract

This work focuses on a class of Petri nets (PNs) called Weighted Systems of Simple Sequential Processes with Resources (WS3PR). We study how to enforce liveness to WS3PR by appropriately allocating resources. A sufficient condition that guarantees liveness of a net system in this class is first derived. Then, based on such a condition, we propose an algorithm that computes an initial marking of resource places that guarantees the liveness of a WS3PR system where the initial marking of the idle places is given. Note that, we do not guarantee that the resulting solution is optimal, in the sense that a smaller initial marking of resource places that still leads to liveness could exist. However, several numerical examples show that the solution resulting from the proposed approach is optimal.

Published
2018

22. Influence Maximization by Link Activation in Social Networks

Author

Alessandro Giua, Leonardo Brenner, Wenjing Yang, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Mathematical optimization, Social network, Computer science, business.industry, Approximation algorithm, 02 engineering and technology, Maximization, Blocking (statistics), [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Diffusion (business), Set (psychology), business, Link (knot theory), ComputingMilieux_MISCELLANEOUS
Abstract

The propagation of innovations in social networks has been widely studied recently. Previous research mostly focuses on either maximizing the influence by identifying a set of initial adopters, or minimizing the influence by link blocking under a certain diffusion model. In our case, we address an influence maximization problem considering the link activation under the Independent Cascade model. For this problem, we propose an approximate solution based on the computation of a cost-degree coefficient for selecting links to be activated. Simulations performed on a real network show that our algorithm performs well.

Published
2018

23. Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis

Author

Engel Lefaucheux, Alessandro Giua, Carla Seatzu, Laboratoire Spécification et Vérification [Cachan] (LSV), École normale supérieure - Cachan (ENS Cachan)-Centre National de la Recherche Scientifique (CNRS), SUpervision of large MOdular and distributed systems (SUMO), Inria Rennes – Bretagne Atlantique, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-LANGAGE ET GÉNIE LOGICIEL (IRISA-D4), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-CentraleSupélec-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Bretagne Sud (UBS)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-École normale supérieure - Rennes (ENS Rennes)-Centre National de la Recherche Scientifique (CNRS)-Université de Rennes 1 (UR1), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT), Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Rennes 1 (UR1), Université de Rennes (UNIV-RENNES)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes 1 (UR1), Institut National des Sciences Appliquées (INSA)-Université de Rennes (UNIV-RENNES)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique Bretagne-Pays de la Loire (IMT Atlantique), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom [Paris] (IMT)-Institut Mines-Télécom [Paris] (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Theoretical computer science, Computational complexity theory, Computer science, Efficient algorithm, Observable, 02 engineering and technology, Petri net, 020901 industrial engineering & automation, Reachability, Bounded function, 0202 electrical engineering, electronic engineering, information engineering, Graph (abstract data type), 020201 artificial intelligence & image processing, [INFO]Computer Science [cs]
Abstract

International audience; Petri nets have been proposed as a fundamental model for discrete-event systems in a wide variety of applications and have been an asset to reduce the computational complexity involved in solving a series of problems, such as control, state estimation, fault diagnosis, etc. Many of those problems require an analysis of the reachability graph of the Petri net. The basis reachability graph is a condensed version of the reachability graph that was introduced to efficiently solve problems linked to partial observation. It was in particular used for diagnosis which consists in deciding whether some fault events occurred or not in the system, given partial observations on the run of the system. However this method is, with very specific exceptions, limited to bounded Petri nets. In this paper, we introduce the notion of basis coverability graph to remove this requirement. We then establish the relationship between the coverability graph and the basis coverability graph. Finally, we focus on the diagnosability and stochastic diagnosability problems: we show how the basis coverability graph can be used to get efficient algorithms when such problems are decidable.

Published
2018

24. Computation of Activation Probabilities in the Independent Cascade Model

Author

Wenjing Yang, Alessandro Giua, Leonardo Brenner, Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), and Brenner, Leonardo

Subjects
Stochastic modelling, Computer science, [INFO.INFO-SI] Computer Science [cs]/Social and Information Networks [cs.SI], Computation, Approximation algorithm, 02 engineering and technology, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], Set (abstract data type), Cascade, 020204 information systems, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Node (circuits), [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, Focus (optics), Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

International audience; Based on the concepts of word-of-mouth effect and viral marketing, the diffusion of an innovation may be triggered starting from a set of initial users. Estimating the influence spread is a preliminary step to determine a suitable or even optimal set of initial users to reach a given goal. In this paper, we focus on a stochastic model called the Independent Cascade model, and compare a few approaches to compute activation probabilities of nodes in a social network, i.e., the probability that a user adopts the innovation. In the paper, first we propose the Path Method which computes the exact value of the activation probabilities but it has high complexity. Second an approximated method, called SSS-Noself, is obtained by modification of the existing SteadyStateSpread algorithm, based on fixed-point computation, to achieve a better accuracy. Finally an efficient approach, also based on fixed-point computation, is proposed to compute the probability that a node is activated though a path of minimal length from the seed set. This algorithm, called SSS-Bound-t algorithm, can provide a lower- bound for the computation of activation probabilities.

Published
2018

25. Computation of admissible marking sets in weighted state machines by dynamic programming

Author

Alessandro Giua, Zhiwu Li, Ziyue Ma, Xidian University, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
030213 general clinical medicine, 0209 industrial biotechnology, Finite-state machine, Computer science, Computation, 02 engineering and technology, Petri net, Net (mathematics), Dynamic programming, Set (abstract data type), 03 medical and health sciences, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, 0302 clinical medicine, Control logic, Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

In this paper we aim to characterize the admissible marking set in partially controllable Petri nets with weighted arcs. We consider a special subclass of generalized Petri nets called weighted state machines (WSMs) that have state-machine topology with weighted arcs. Such subclass of nets can be used to model systems of practical interest characterized by operations executed in batches. We propose a dynamic programming method to compute the admissible marking set of an elementary GMEC for a net in this subclass. Such a result can be used to design an online control logic to ensure that the current marking is always covered by some maximal admissible markings and is always admissible.

Published
2017

26. Decentralized observability of discrete event systems with synchronizations

Author

Cristian Mahulea, Carla Seatzu, Alessandro Giua, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aragón Institute of Engineering Research [Zaragoza] (I3A), University of Zaragoza - Universidad de Zaragoza [Zaragoza], Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Discrete mathematics, 0209 industrial biotechnology, 020208 electrical & electronic engineering, sync, 02 engineering and technology, Synchronization, Decidability, Set (abstract data type), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Regular language, Control and Systems Engineering, 0202 electrical engineering, electronic engineering, information engineering, Observability, Electrical and Electronic Engineering, Algorithm, Word (computer architecture), ComputingMilieux_MISCELLANEOUS, Event (probability theory), Mathematics
Abstract

This paper deals with the problem of decentralized observability of discrete event systems. We consider a set of sites each capable of observing a subset of the total event set. When a synchronization occurs, each site transmits its own observation to a coordinator that decides if the word observed belongs to a reference language K or not. Two different properties are studied: uniform q -observability and q -sync observability. It is proved that both properties are decidable for regular languages. Finally, under the assumption that languages K and L are regular, and all the events are observable by at least one site, we propose a procedure to determine the instants at which synchronization should occur to detect the occurrence of any word not in K , as soon as it occurs. The advantage of the proposed approach is that most of the burdensome computations can be moved off-line.

Published
2017

27. Gossip based asynchronous and randomized distributed task assignment with guaranteed performance on heterogeneous networks

Author

Mauro Franceschelli, Alessandro Giua, Carla Seatzu, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
0209 industrial biotechnology, Theoretical computer science, Computer science, Process (engineering), Multi-agent system, Distributed computing, 020206 networking & telecommunications, 02 engineering and technology, Computer Science Applications, Task (computing), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, Asynchronous communication, Distributed algorithm, Gossip, 0202 electrical engineering, electronic engineering, information engineering, Gossip protocol, Analysis, Heterogeneous network, ComputingMilieux_MISCELLANEOUS
Abstract

The main contribution of this paper is a novel distributed algorithm based on asynchronous and randomized local interactions, i.e., gossip based, for task assignment on heterogeneous networks. We consider a set of tasks with heterogeneous cost to be assigned to a set of nodes with heterogeneous execution speed and interconnected by a network with unknown topology represented by an undirected graph. Our objective is to minimize the execution time of the set of tasks by the networked system. We propose a local interaction rule which allows the nodes of a network to cooperatively assign tasks among themselves with a guaranteed performance with respect to the optimal assignment exploiting a gossip based randomized interaction scheme. We first characterize the convergence properties of the proposed approach, then we propose an edge selection process and a distributed embedded stop criterion to terminate communications, not only task exchanges, while keeping the performance guarantee. Numerical simulations are finally presented to corroborate the theoretical results.

Published
2017

28. Marking Estimation in Labelled Petri nets by the Representative Marking Graph

Author

Yin Tong, Alessandro Giua, Zhiwu Li, Ziyue Ma, Xidian University, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, 02 engineering and technology, Petri net, 030226 pharmacology & pharmacy, Subnet, Unobservable, Graph, 03 medical and health sciences, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, 0302 clinical medicine, Control and Systems Engineering, Algebraic number, Algorithm, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract

In this paper a method to recognize the set of consistent markings in labelled Petri nets is proposed. In this method, the set of unobservable transitions are partitioned into pseudo-observable and strictly unobservable ones, and the subnet induced by the latter is acyclic. The unobservable reach of a marking can be characterized by the union of the strictly unobservable reach of several basis markings, called representative markings, in the unobservable subnet. The set of consistent markings can be characterized by a linear algebraic system based on those representative markings. Based on the representative marking graph, the current marking estimation problem for a labelled Petri net can be efficiently solved. This method does not require the assumption that the unobservable subnet is acyclic.

Published
2017

29. Minimizing the Influence Propagation in Social Networks for Linear Threshold Models

Author

Alessandro Giua, Lan Yang, Zhiwu Li, Xidian University, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
0209 industrial biotechnology, Mathematical optimization, Social network, Heuristic, business.industry, Computer science, Heuristic (computer science), 020206 networking & telecommunications, 02 engineering and technology, Maximization, Linear threshold, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, Simple (abstract algebra), 0202 electrical engineering, electronic engineering, information engineering, Diffusion (business), business, Integer programming, Social psychology, ComputingMilieux_MISCELLANEOUS
Abstract

Innovation or information propagation in social networks has been widely studied in recent years. Most of the previous works are focused on solving the problem of influence maximization, which aims to identify a small subset of early adopters in a social network to maximize the influence propagation under a given diffusion model. In this paper, motivated by practical scenarios, we propose two different influence minimization problems. We consider a Linear Threshold diffusion model and provide a general solution to the first problem solving a linear integer programming. For the second problem, we provide a technique to search for an optimal solution that works only in particular cases and discuss a simple heuristic to find a solution in the general case.

Published
2017

30. A heuristic algorithm to optimize execution time of multi-robot path

Author

Simon Ware, Rong Su, Alessandro Giua, Diego Deplano, Nanyang Technological University [Singapour], Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
0209 industrial biotechnology, Mathematical optimization, Robot kinematics, Computer science, business.industry, 020208 electrical & electronic engineering, Real-time computing, Robotics, Context (language use), 02 engineering and technology, Electronic mail, Field (computer science), Automaton, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Path (graph theory), 0202 electrical engineering, electronic engineering, information engineering, Robot, Artificial intelligence, business, ComputingMilieux_MISCELLANEOUS
Abstract

A common problem in the field of robotics is to coordinate motions of multiple robots to ensure the shortest possible execution time. The problem is known PSPACE-complete, thus, it is impossible to find the best solution in a reasonable time for large scale problems. For this reason, in this work we look for sub-optimal solutions by systematically improving a given one. We present a heuristic algorithm to reduce execution time of a path by changing robots' priorities in case of path overlap. The algorithm is applied to a solution computed by a decoupled method in a discrete event system context. It is shown that the proposed approach is effective in finding a solution with shorter execution time. Tests show that the proposed algorithm can achieve improvement up to 45%.

Published
2017

31. Decidability of opacity verification problems in labeled Petri net systems

Author

Zhiwu Li, Carla Seatzu, Alessandro Giua, Yin Tong, Xidian University, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Theoretical computer science, Opacity, ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION, Verification problem, 02 engineering and technology, Petri net, 16. Peace & justice, Undecidable problem, Decidability, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Reduction (complexity), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Algorithm, ComputingMilieux_MISCELLANEOUS, ComputingMethodologies_COMPUTERGRAPHICS, Mathematics
Abstract

A system is said to be opaque if an intruder that observes its evolution through a mask cannot infer that the system’s evolution belongs to a given secret behavior. Opacity verification is the problem of determining whether the system is opaque with respect to a given secret or not. In this paper we address the decidability of the opacity verification problem. Using reduction approaches, we show that verification of initial-state, current-state, and language opacity is undecidable in labeled Petri nets.

Published
2017

32. Verification of State-Based Opacity Using Petri Nets

Author

Alessandro Giua, Carla Seatzu, Zhiwu Li, Yin Tong, Xidian University, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Theoretical computer science, Opacity, 02 engineering and technology, Process architecture, Petri net, Electronic mail, Computer Science Applications, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, Reachability, Bounded function, 0202 electrical engineering, electronic engineering, information engineering, Stochastic Petri net, Graph (abstract data type), 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, ComputingMilieux_MISCELLANEOUS, ComputingMethodologies_COMPUTERGRAPHICS, Mathematics
Abstract

A system is said to be opaque if a given secret behavior remains opaque (uncertain) to an intruder who can partially observe system activities. This work addresses the verification of state-based opacity in systems modeled with Petri nets. The secret behavior of a system is defined as a set of states. More precisely, two state-based opacity properties are considered: current-state opacity and initial-state opacity . We show that both current-state and initial-state opacity problems in bounded Petri nets can be efficiently solved by using a compact representation of the reachability graph, called basis reachability graph (BRG). This approach is practically efficient since the exhaustive enumeration of the reachability space can be avoided.

Published
2017

33. Finite-Time Consensus on the Median Value With Robustness Properties

Author

Alessandro Giua, Mauro Franceschelli, Alessandro Pisano, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Università degli Studi di Cagliari = University of Cagliari (UniCa), and Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)

Subjects
Convex hull, 0209 industrial biotechnology, Mathematical optimization, Computer science, Distributed computing, 02 engineering and technology, Network topology, Computer Science Applications, Computer Science::Multiagent Systems, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, Robustness (computer science), [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Outlier, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Finite time
Abstract

International audience; In this paper we propose a novel continuous-time protocol that solves the consensus problem on the median value, i.e., it provides distributed agreement in networked multi-agent systems where the quantity of interest is the median value of the agents' initial values. In contrast to the average value, the median value is a statistical measure inherently robust to the presence of outliers, which is a significant robustness issue in large-scale sensor and multi-agent networks. The proposed protocol requires only binary information regarding the relative state differences among the neighboring agents and achieves consensus on the median value in finite time by exploiting a suitable ad-hoc discontinuous local interaction rule. In addition, we characterize certain resiliency properties of the proposed protocol against the presence of uncooperative agents which do not implement the underlying local interaction rule whereas they interact with their neighbors thus influencing the network. In particular, we prove that despite the persistent influence of (at most) a certain number of uncooperative agents, the cooperative agents achieve finite time consensus on a value lying inside the convex hull of the cooperative agents' initial conditions, provided that the special class of so-called " k-safe " network topology is considered. Capabilities of the proposed consensus protocol and its effectiveness are supported by numerical studies. Published as: M. Franceschelli, A. Giua and A.

Published
2017

34. Characterization of Admissible Marking Sets in Petri Nets With Conflicts and Synchronizations

Author

Zhiwu Li, Alessandro Giua, Ziyue Ma, Xidian University, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Università degli Studi di Cagliari = University of Cagliari (UniCa)

Subjects
Discrete mathematics, 0209 industrial biotechnology, Mathematical optimization, 02 engineering and technology, Process architecture, Petri net, 16. Peace & justice, Net (mathematics), Subnet, Electronic mail, Computer Science Applications, Set (abstract data type), [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, Stochastic Petri net, 020201 artificial intelligence & image processing, Electrical and Electronic Engineering, Finite set, ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract

In this paper we study the problem of constraint transformation for Petri nets with uncontrollable transitions and containing both conflicts and synchronizations. We show that given an arbitrary net and a set of legal markings, the admissible marking set cannot always be represented by a finite number of disjunctions of GMECs. Moreover, we characterize the GMEC inflation phenomenon, that is, the case in which the representation of the admissible marking set may be too complex to be efficiently implemented in a closed-loop net. To rule out the possibility of GMEC inflation we consider a subclass of constraints called singular GMECs with an acyclic backward-conflict-free uncontrollable subnet. By these assumptions we propose an algorithm to transform a given singular GMEC into a controllable OR-GMEC which precisely characterizes its admissible marking set.

Published
2017

35. IPA for continuous stochastic marked graphs

Author

Alessandro Giua, Yorai Wardi, Carla Seatzu, School of Electrical and Computer Engineering - Georgia Insitute of Technology (ECE GeorgiaTech), Georgia Institute of Technology [Atlanta], Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), and Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU)

Subjects
0209 industrial biotechnology, 020208 electrical & electronic engineering, Control variable, Sample (statistics), 02 engineering and technology, Classification of discontinuities, Flow network, Infinitesimal perturbation analysis, 020901 industrial engineering & automation, Control and Systems Engineering, Simple (abstract algebra), [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, Calculus, Electrical and Electronic Engineering, Focus (optics), Throughput (business), Algorithm, Mathematics
Abstract

International audience; This paper presents a unified framework for the Infinitesimal Perturbation Analysis (IPA) gradient-estimation technique in the setting of marked graphs. It proposes a systematic approach for computing the derivatives of sample performance functions with respect to structural and control parameters. The resulting algorithms are recursive in both time and network flows, and their successive steps are computed in response to the occurrence and propagation of certain events in the network. Such events correspond to discontinuities in the network flow-rates, and their special characteristics are due to the properties of continuous transitions and fluid places. Following a general outline of the framework we focus on a simple yet canonical example, and investigate throughput and workload-related performance criteria as functions of structural and control variables. Simulation experiments support the analysis and testify to the potential viability of the proposed approach.

Published
2013

36. Cycle time optimization of deterministic timed weighted marked graphs by transformation

Author

Zhou He, Zhiwu Li, Alessandro Giua, Università degli Studi di Cagliari = University of Cagliari (UniCa), Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), Xidian University, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
0209 industrial biotechnology, Marked graph, Mathematical optimization, Optimization problem, Value (computer science), 02 engineering and technology, Petri net, Cycle time, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, Transformation (function), Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Production (computer science), Electrical and Electronic Engineering, Throughput (business), ComputingMilieux_MISCELLANEOUS, Mathematics
Abstract

International audience; Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model automated production systems, such as robotic work cells or embedded systems, and reduce the size of the model. The main problem for designers is to find a tradeoff between minimizing the cost of the resources and maximizing the system's throughput (also called cycle time). It is possible to apply analytical techniques for the cycle time optimization problem of such systems. The problem consists in finding an initial marking to minimize the cycle time (i.e., maximize the throughput) while the weighted sum of tokens in places is less than or equal to a given value. We transform a weighted marked graph into several equivalent marked graphs and formulate a mixed integer linear programming model to solve this problem. Moreover, several techniques are proposed to reduce the complexity of the proposed method. We show that the proposed method can always find an optimal solution.

Published
2016

37. An extended model for optical gain calculations in single-mode Laser diodes, International Symposium on Reliability of Optoelectronics for Systems

Author

Vanzi, Massimo, Giulia, Marcello, Mura, Giovanna, Le Gales, Germain, Joly, Simon, Deshayes, Yannick, Bechou, Laurent, Université de Cagliari, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Bordeaux (UB), Laboratoire de l'intégration, du matériau au système (IMS), and Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Bordeaux-Université Sciences et Technologies - Bordeaux 1

Subjects
[SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic, [SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2016

38. IoT-D2D task allocation: An award-driven game theory approach

Author

Makhlouf Hadji, Virginia Pilloni, Hossam Afifi, Emad Abd-Elrahman, Luigi Atzori, Département Réseaux et Services de Télécommunications (RST), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux (SAMOVAR), Centre National de la Recherche Scientifique (CNRS), Réseaux, Systèmes, Services, Sécurité (R3S-SAMOVAR), Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP)-Institut Mines-Télécom [Paris] (IMT)-Télécom SudParis (TSP), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, and IRT SystemX (IRT SystemX)

Subjects
IOT, Computer science, business.industry, Process (engineering), Node (networking), Distributed computing, 020206 networking & telecommunications, 02 engineering and technology, Task (project management), Nash equilibrium point, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Server, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Resource management, Set (psychology), Internet of Things, business, Game theory, Computer network
Abstract

International audience; An IoT-D2D cooperation framework for task allocation among objects in the IoT (Internet of Things) is presented. Proximity Services based on Device to Device (D2D) communication are used to enable direct interaction between IoT objects. The process is triggered by a node that decides to set up a cluster of nodes and then to coordinate the allocation strategy, where objects capable of performing the same tasks compete to get relevant remunerations. We then propose a game-theory based approach to find a solution maximizing objects utility functions. We prove that a Nash Equilibrium Point (NEP) can be found. Experimental results provide insights on the strategy performance

Published
2016

39. Deployment of Applications in Wireless Sensor Networks: A Gossip-Based Lifetime Maximization Approach

Author

Alessandro Giua, Luigi Atzori, Mauro Franceschelli, Virginia Pilloni, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Dip. di Ingegneria Elettrica ed Elettronica (Univ. Cagliari), Universita degli Studi di Cagliari [Cagliari], and Università degli Studi di Cagliari = University of Cagliari (UniCa)

Subjects
0209 industrial biotechnology, Brooks–Iyengar algorithm, Wireless network, Computer science, business.industry, Distributed computing, 020206 networking & telecommunications, Wireless WAN, 02 engineering and technology, Key distribution in wireless sensor networks, 020901 industrial engineering & automation, Control and Systems Engineering, Sensor node, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, 0202 electrical engineering, electronic engineering, information engineering, Mobile wireless sensor network, Electrical and Electronic Engineering, business, Wireless sensor network, Heterogeneous network, Computer network
Abstract

In this brief, a wireless sensor network in which the nodes are equipped with a programmable middleware that allows the quick deployment of different applications is considered. We propose a distributed method to extend the network lifetime by managing how tasks are assigned to different nodes. A detailed model of energy consumption of the wireless sensor nodes is provided and a gossip-based algorithm that only exploits iterative and asynchronous optimizations involving local information between neighboring nodes to maximize the global network lifetime is proposed. Experimental results and simulations performed on the embedded hardware show that our framework can provide a significant lifetime extension, particularly for networks with high node densities and nonuniform energy consumption or initial battery charge.

Published
2016

40. Uniformly convergent sliding mode‐based observation for switched linear systems

Author

Mincarelli, Diego, Pisano, Alessandro, Floquet, Thierry, Usai, Elio, Non-Asymptotic estimation for online systems (NON-A), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), and Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)

Subjects
second order sliding modes, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, observer design, Switched systems
Abstract

International audience; The problem of designing an observer capable of reconstructing the continuous and discrete states for a class of switched linear systems is addressed. A stack of dynamical observers based on the super twisting algorithm with finite and uniform-in-the-initial-condition convergence is considered, which provides an estimate of the continuous state and, at the same time, produces residual signals suitable for reconstructing the discrete state. An appropriate ‘projection’ of the residuals is suggested, which allows to speed up the reconstruction of the discrete state. Formal ‘distinguishability’ conditions guaranteeing that the discrete state can be uniquely reconstructed are derived. Lyapunov-based proofs of convergence, and numerical simulations, support the proposed approach.

Published
2016

41. Optimization of Deterministic Timed Weighted Marked Graphs

Author

Alessandro Giua, Zhou He, Zhiwu Li, Università degli Studi di Cagliari = University of Cagliari (UniCa), Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), Modèles et Formalismes à Evénements Discrets (MOFED), Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Xidian University, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)

Subjects
Class (set theory), 0209 industrial biotechnology, Class (computer programming), Mathematical optimization, Optimization problem, Computer science, Heuristic (computer science), Distributed computing, Value (computer science), 0102 computer and information sciences, 02 engineering and technology, Petri net, Special class, Manufacturing systems, 01 natural sciences, [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, 010201 computation theory & mathematics, Control and Systems Engineering, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Electrical and Electronic Engineering, Algorithm, Throughput (business), ComputingMilieux_MISCELLANEOUS
Abstract

This paper is motivated by the optimization of manufacturing systems such as assembly lines and job-shops. Therefore, the main problem for designers is to find a trade-off between minimizing the cost of the resources and maximizing the system's throughput. Timed marked graphs, a special class of Petri nets, are extensively used to model and analyze cyclic manufacturing systems. Weighted marked graphs are convenient to model systems with bulk services and arrivals. We consider two problems of practical importance for this class of nets. The marking optimization problem consists in finding an initial marking to minimize the weighted sum of tokens in places while the average cycle time is less than or equal to a given value. The cycle time optimization problem consists in finding an initial marking to minimize the average cycle time while the weighted sum of tokens in places is less than or equal to a given value. We propose two heuristic algorithms to solve these problems. Several simulation studies show that the effectiveness of the proposed approach is significantly faster than existing ones.

Published
2016

42. Extended modal gain measurement in DFB Laser diodes

Author

Giovanna Mura, Germain Le Gales, Giulia Marcello, Yannick Deshayes, Laurent Bechou, Simon Joly, Massimo Vanzi, Université de Cagliari, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire de l'intégration, du matériau au système (IMS), Centre National de la Recherche Scientifique (CNRS)-Institut Polytechnique de Bordeaux-Université Sciences et Technologies - Bordeaux 1, and Université de Bordeaux (UB)

Subjects
010302 applied physics, Physics, Optical amplifier, Distributed feedback laser, business.industry, 020208 electrical & electronic engineering, Gain, 02 engineering and technology, 01 natural sciences, Atomic and Molecular Physics, and Optics, Electronic, Optical and Magnetic Materials, Semiconductor laser theory, Round-trip gain, Absolute gain, [SPI]Engineering Sciences [physics], Optics, 0103 physical sciences, 0202 electrical engineering, electronic engineering, information engineering, [SPI.OPTI]Engineering Sciences [physics]/Optics / Photonic, Optoelectronics, Semiconductor optical gain, Laser power scaling, Electrical and Electronic Engineering, business, ComputingMilieux_MISCELLANEOUS
Abstract

A practical method is proposed for complete gain measurement in distributed feedback (DFB) laser diodes. It is non-destructive and does not require any reference device. It includes the whole range of continuous gain values, from its minimum to threshold, passing through the transparency condition. The method requires a single absolute gain measurement for calibration. An example is reported for a DFB preserving Fabry–Perot multi-modes in the sub-threshold regime.

Published
2016

43. On the enforcement of a class of nonlinear constraints on Petri nets

Author

Zhiwu Li, Alessandro Giua, YuFeng Chen, Kamel Barkaoui, CEDRIC. Systèmes sûrs (CEDRIC - SYS), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM)-HESAM Université - Communauté d'universités et d'établissements Hautes écoles Sorbonne Arts et métiers université (HESAM), Xidian University, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS), Dip. di Ingegneria Elettrica ed Elettronica (Univ. Cagliari), Universita degli Studi di Cagliari [Cagliari], Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), and Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU)

Subjects
Engineering, Supervisor, business.industry, Process architecture, Petri net, Constraint (information theory), Nonlinear system, Transformation (function), Control and Systems Engineering, Control theory, Bounded function, [INFO.INFO-AU]Computer Science [cs]/Automatic Control Engineering, Stochastic Petri net, [INFO.INFO-SY]Computer Science [cs]/Systems and Control [cs.SY], [INFO]Computer Science [cs], Electrical and Electronic Engineering, business
Abstract

International audience; This paper focuses on the enforcement of nonlinear constraints in Petri nets. First, a supervisory structure is proposed for a nonlinear constraint. The proposed structure consists of added places and transitions. It controls the transitions in the net to be controlled only but does not change its states since there is no arc between the added transitions and the places in the original net. Second, an integer linear programming model is proposed to transform a nonlinear constraint to a minimal number of conjunc-tive linear constraints that have the same control performance as the nonlinear one. By using a place invariant based method, the obtained linear constraints can be easily enforced by a set of control places. The control places consist to a supervisor that can enforce the given nonlinear constraint. On condition that the admissible markings space of a nonlinear constraint is non-convex, another integer linear programming model is developed to obtain a minimal number of constraints whose disjunctions are equivalent to the nonlinear constraint. Finally, a number of examples are provided to demonstrate the proposed approach.

Published
2015

44. OPTIMAL ROUTING OF CONTINUOUS TIMED PETRI NETS

Author

Bruno Gaujal, Alessandro Giua, Real time and interoperability (TRIO), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Eduardo Fernandez Camacho, J. A. de la Puenta, L. Basenez, Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Institut National Polytechnique de Lorraine (INPL)-Université Nancy 2-Université Henri Poincaré - Nancy 1 (UHP), and E.F Camacho

Subjects
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Computer science, business.industry, Distributed computing, réseaux de pétri continus, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], Continuous Petri nets, linear programming, 020207 software engineering, 02 engineering and technology, General Medicine, Petri net, routage optimal, Programmation linéaire, programmtion linéaire, 0202 electrical engineering, electronic engineering, information engineering, Stochastic Petri net, optimal routing, 020201 artificial intelligence & image processing, réseaux de Petri continus, Artificial intelligence, Routing (electronic design automation), business
Abstract

Colloque avec actes et comité de lecture. internationale.; International audience; In this paper, we consider deterministic timed continuous Petri nets where conflicts at places are solved by assigning stationary routing parameters. We show how to compute the stationary firing rate at all transitions as well as how to determine the optimal routing parameters to maximize the firing rates. Finally, we discuss the relations with discrete Petri nets.

Published
2002

45. Active diagnosis for a class of switched systems

Author

Michael Defoort, Mohamed Djemai, Alessandro Giua, Jeremy Van Gorp, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201 (LAMIH), and INSA Institut National des Sciences Appliquées Hauts-de-France (INSA Hauts-De-France)-Centre National de la Recherche Scientifique (CNRS)-Université de Valenciennes et du Hainaut-Cambrésis (UVHC)

Subjects
Mealy machine, Scheme (programming language), 0209 industrial biotechnology, Engineering, Class (computer programming), Finite-state machine, business.industry, 020208 electrical & electronic engineering, Testing, Integrated circuits, 02 engineering and technology, Fault (power engineering), Automata, [SPI.AUTO]Engineering Sciences [physics]/Automatic, Parameter identification problem, 020901 industrial engineering & automation, Control theory, 0202 electrical engineering, electronic engineering, information engineering, State (computer science), business, computer, Switches, Switched systems, Fault diagnosis, computer.programming_language
Abstract

International audience; This paper deals with active diagnosis for a class of switched systems which may not satisfy the classical diagnosability conditions. A Mealy Machine modeling is used to define an appropriate diagnoser which reduces the uncertain state subset. An algorithm combining the proposed diagnoser and a testing procedure is introduced to solve the fault identification problem. A study on the multicellular converter is carried out to detect and isolate faulty cells. Simulation results show the effectiveness of the proposed scheme.

Published
2013

46. ANN BASED APPROACH TO SOLVE GROUNDWATER POLLUTION INVERSE PROBLEM

Author

Laura Foddis, Maria, Montisci, Augusto, Uras, Gabriele, Ackerer, Philippe, Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, Department of Land Engineering (DIT), Laboratoire d'Hydrologie et de Géochimie de Strasbourg (LHyGeS), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut national des sciences de l'Univers (INSU - CNRS)-Ecole et Observatoire des Sciences de la Terre (EOST), Institut national des sciences de l'Univers (INSU - CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), and Zacharewicz, Gregory

Subjects
[INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation, [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
2012

47. Identification of the unknown pollution source in the Alsatian aquifer (France) through groundwater modelling and Artificial Neural Networks applications

Author

Ackerer, Philippe, Foddis, Maria, Montisci, Augusto, Uras, Gabriele, Thevenot, Daniel, Daniel Thevenot, Laboratoire d'Hydrologie et de Géochimie de Strasbourg (LHyGeS), École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut national des sciences de l'Univers (INSU - CNRS)-Ecole et Observatoire des Sciences de la Terre (EOST), Institut national des sciences de l'Univers (INSU - CNRS)-Université de Strasbourg (UNISTRA)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS), Department of Land Engineering (DIT), University of Cagliari, and Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE)

Subjects
Groundwater pollution, pollution source identification, groundwater modelling, [SDE.ES] Environmental Sciences/Environmental and Society, [SDE.ES]Environmental Sciences/Environmental and Society, Artificial Neural Networks
Abstract

8 p.; International audience; Groundwater is the main source of drinking water and it has a vital importance in developed and developing countries. Computational models of groundwater are required to ensure its suitable management. Such models are useful to design remediation strategies in polluted aquifers. This work aims at studying the spreading of a dangerous chemical - carbon tetrachloride (CCl4) - that contaminated a part of the Alsatian aquifer (France) because of a tanker accident in 1970. The exact amount of the chemical infiltrated is unknown and this constitutes the main issue for its individuation and remediation. The purpose of this study is to define the behaviour of the unknown pollution source in terms of temporal variations, injection rates and duration of the activity. An Artificial Neural Network (ANN) has been developed to identify the characteristics of the source and to solve the groundwater inverse problem: on the basis of known contamination concentrations data in pumping wells, the pollution source temporal evolution is reconstructed. The ANN learns to solve a problem by developing a memory, associating a large number of input patterns examples, with resulting set of outputs or effects. ANN are characterized by a flexible structure capable of approximating almost al input-output relationships. To develop an ANN, it is necessary to generate a data set of patterns for training, validation and test procedure. In the case studied, the simulation models of solute transport in saturated groundwater flow are generated considering different scenarios of the source behaviour. These models examples are created with the software TRACES (Transport or RadioActiver Elements in the Subsurface) developed at the IMFS (Fluid and Solid Mechanics Institute) of Strasbourg “HOTEIT and ACKERER (2003)”. Conceptual model and model design of carbon tetrachloride pollution in the Alsatian aquifer has been the subject of various studies developed by the Institute de Mécaniques des Fluides et des Solides of Strasbourg. The numerical simulation model used to generate the necessary patterns for the ANN is based on data measured between 1970 and 2004.

Published
2010

48. Feasibility analysis of an MHD inductive generator coupled with a thermoacoustic resonator

Author

Renato Forcinetti, Sara Carcangiu, Jp Roux, Antoine Alemany, Augusto Montisci, Science et Ingénierie des Matériaux et Procédés (SIMaP), Université Joseph Fourier - Grenoble 1 (UJF)-Centre National de la Recherche Scientifique (CNRS)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut de Chimie du CNRS (INC)-Institut National Polytechnique de Grenoble (INPG), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, AREVA TA, and Fournier-Gagnoud, Annie

Subjects
Physics, [SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph], [SPI.ACOU] Engineering Sciences [physics]/Acoustics [physics.class-ph], Generator (computer programming), [SPI.ELEC] Engineering Sciences [physics]/Electromagnetism, 020209 energy, [SPI.NRJ]Engineering Sciences [physics]/Electric power, General Physics and Astronomy, Thermodynamics, 02 engineering and technology, Mechanics, 010501 environmental sciences, 01 natural sciences, Resonator, [SPI.ELEC]Engineering Sciences [physics]/Electromagnetism, 0202 electrical engineering, electronic engineering, information engineering, [SPI.MECA.THER]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Thermics [physics.class-ph], Electrical and Electronic Engineering, Magnetohydrodynamics, ComputingMilieux_MISCELLANEOUS, [SPI.NRJ] Engineering Sciences [physics]/Electric power, [SPI.MECA.THER] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Thermics [physics.class-ph], 0105 earth and related environmental sciences
Abstract

International audience

49. FEM analysis of the inflation process of magnetoplasma sails

Author

F. Masson, Renato Forcinetti, Augusto Montisci, Antoine Alemany, Science et Ingénierie des Matériaux et Procédés (SIMaP ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut de Chimie du CNRS (INC)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Department of Electrical and Electronic Engineering [University of Cagliari] (DIEE), University of Cagliari, and Centre National d'Études Spatiales [Toulouse] (CNES)

Subjects
Inflation, Physics, media_common.quotation_subject, [SPI.PLASMA]Engineering Sciences [physics]/Plasmas, Process (computing), General Physics and Astronomy, Mechanical engineering, 01 natural sciences, Finite element method, 010305 fluids & plasmas, 0103 physical sciences, Electrical and Electronic Engineering, ComputingMilieux_MISCELLANEOUS, media_common
Abstract

International audience

Catalog

Books, media, physical & digital resources
See catalog results