Browsing Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering by Subject "Graph theory"
Now showing items 1-20 of 26
-
Article
Bounds on the number of markings consistent with label observations in petri nets
(2009)In this paper, we consider state estimation in discrete-event systems (DESs) modeled by labeled Petri nets and present upper bounds on the number of system states (or markings) that are consistent with an observed sequence ...
-
Article
Designs of bisimilar Petri net controllers with fault tolerance capabilities
(2008)This paper proposes an approach for providing tolerance against faults that may compromise the functionality of a given controller modeled by a Petri net. The method is based on embedding the given Petri net controller ...
-
Article
Distributed Balancing of Commodity Networks Under Flow Interval Constraints
(2018)We consider networks the nodes of which are interconnected via directed edges, each able to admit a flow (or weight) within a certain interval, with nonnegative end points that correspond to lower and upper flow limits. ...
-
Article
Distributed cycle detection and removal
(2018)In this paper, we provide distributed algorithms to detect and remove cycles in a directed relational graph by exploiting the underlying undirected communication graph; the relational graph models a relation among the ...
-
Article
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
(2015)Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number ...
-
Article
Distributed finite-time calculation of node eccentricities, graph radius and graph diameter
(2016)The distributed calculation of node eccentricities, graph radius and graph diameter are fundamental steps to tune network protocols (e.g., setting an adequate time-to-live of packets), to select cluster heads, or to execute ...
-
Article
Distributed resource coordination in networked systems described by digraphs
(2015)We consider a multicomponent system in which each component can receive/transmit information from/to components in its immediate neighborhood. Communication links between components are not required to be bidirectional, ...
-
Article
Distributed weight balancing over digraphs
(2014)A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...
-
Conference Object
Exploring Price Classification in Day Ahead Electricity Markets through Graph Theory and PNN Modelling
(2023)This paper delves into the intersection of graph theory and electricity market data analysis. The introductory section lays the foundation by elucidating the theoretical underpinnings of graph theory and its relevance to ...
-
Article
Fault diagnosis in discrete event systems modeled by partially observed petri nets
(2009)In this paper, we study fault diagnosis in discrete event systems modeled by partially observed Petri nets, i.e., Petri nets equipped with sensors that allow observation of the number of tokens in some of the places and/or ...
-
Conference Object
Fault diagnosis in discrete event systems modeled by petri nets with outputs
(2008)In this paper, we study fault diagnosis in discrete event systems modeled by Petri nets with outputs, i.e., Petri nets with place sensors and transition sensors. Faults are modeled as unobservable transitions and are divided ...
-
Conference Object
Fault model identification with petri nets
(2008)Most of the fault identification problems in the Discrete Event Systems literature assume knowledge of the structure of the net system, including the nature (and behavior) of the possible faults. In this paper we deal with ...
-
Conference Object
Fault-tolerant supervisory control of discrete event systems modeled by bounded Petri nets
(2007)This paper considers bounded Petri nets with both controllable and uncontrollable transitions, and addresses the synthesis of a fault-tolerant supervisor in a setting where the control specifications are described via ...
-
Article
Graphical inference for multiple intrusion detection
(2008)In this paper, we consider vulnerabilities of networked systems and develop a multiple intrusion detection system (MIDS) which operates by running belief propagation on an appropriately constructed weighted bipartite graph. ...
-
Conference Object
Improved performance bounds on max-product algorithms for multiple fault diagnosis in graphs with loops
(2008)In this paper, we analyze the performance of belief propagation max-product algorithms when used to solve the multiple fault diagnosis (MFD) problem. The MFD problem is described by a bipartite diagnosis graph (BDG) which ...
-
Conference Object
Integer weight balancing in directed graphs in the presence of communication delays
(Institute of Electrical and Electronics Engineers Inc., 2015)A digraph with positive weights on its edges is weight-balanced if, for each node, the sum of the weights of the incoming edges equals the sum of the weights of the outgoing edges. Weight-balanced digraphs play an important ...
-
Conference Object
Least-cost firing sequence estimation in labeled Petri nets with unobservable transitions
(2007)This paper develops a recursive algorithm for estimating the least-cost transition firing sequences that match the observation of a sequence of labels produced by transition activity in a given labeled Petri net. The Petri ...
-
Article
Least-cost transition firing sequence estimation in labeled Petri nets with unobservable transitions
(2011)This paper proposes an approach for estimating the least-cost transition firing sequence(s) that matches (match) the observation of a sequence of labels produced by transition activity in a given labeled Petri net. Each ...
-
Conference Object
Low-complexity max-product algorithms for problems of multiple fault diagnosis
(2008)In this paper, we propose low-complexity max-product algorithms for the problem of multiple fault diagnosis (MFD). The MFD problem is described by a bipartite diagnosis graph (BDG) which consists of a set of components, a ...
-
Article
Max-product algorithms for the generalized multiple-fault diagnosis problem
(2007)In this paper, we study the application of the max-product algorithm (MPA) to the generalized multiple-fault diagnosis (GMFD) problem, which consists of components (to be diagnosed) and alarms/connections that can be ...