Presentation is loading. Please wait.

Presentation is loading. Please wait.

Cyber-Physical Graphs vs

Published bySylvie André Modified over 5 years ago

Similar presentations

Presentation on theme: "Cyber-Physical Graphs vs"— Presentation transcript:

1 Cyber-Physical Graphs vs
Cyber-Physical Graphs vs. RDF graphs Gilles Privat Orange Labs, Grenoble, France

2 CPS Graphs Graphs that model (man-made) Cyber-Physical Systems
Have been used long before the Web & RDF …. Have semantics of their own These (operational or structural) semantics apply to the graph as a whole, not to individual nodes or arcs yet complemtary to per-resource RDF style semantics CPS graphs should not be subsumed by RDF graphs Arcs (relationships) may need to have properties, without resorting to reification Proper structure of the graph should be maintained to run graph-theoretic algorithms (e.g. maximal flow) perform graph structure analysis (e.g. spectral analysis, degree distribution, etc.)

3 Examples of CPS graphs (1/2) with semantics that is not reducible to RDF-style (referential) semantics Finite-State Mealy Machine (state-transition graph, operational semantics Physical network (structural/topological semantics) Street network Electrical grid means means means

4 Examples of CPS graphs (2/2)
« Systems of systems » structural description red Traffic-lights control System Graph hasState Traffic Light TL1 70% y% congested isNodeOf Graph Surveillance Camera A1 hasCoverage hasState actuatedBy Traffic management System Graph monitors Street A connectsTo Traffic Management System Crossing isNodeOf Graph isSub GraphOf Smart City System Graph open/ closed hasState connectsTo Empty/ Occupied isNodeOf Graph hasState Parking A Contains Parking management System Graph handicapped parking space AH1 hasState n/N available spaces Empty/ Occupied EV fast charger Parking Management System hasState Contains hasPower EV charging space AE1

5 CPS graph captured as NGSI-LD property graphs, with RDF/RDFS/OWL semantics as an overlay
DUL:PhysicalObject DUL: InformationEntity NGSI-LD: graph SOSA:Actuator SOSA:Sensor Surveillance Camera A1 Parking A Street A hasState connectsTo monitors Parking Management System open/ closed y% congested n/N available spaces handicapped parking space AH1 Empty/ Occupied EV charging space AE1 Contains EV fast charger hasPower hasCoverage 70% Traffic Light TL1 actuatedBy Crossing red Traffic management System Graph Parking management System Graph Smart City System Graph isSub GraphOf Traffic-lights control System Graph isNodeOf Graph Traffic Management System

Download ppt "Cyber-Physical Graphs vs"

Similar presentations

Based on: Petri Nets and Industrial Applications: A Tutorial

Based on: Petri Nets and Industrial Applications: A Tutorial
Interne Groupe France Télécom ICN: Opportunities and Challenges Orange Labs – France Telecom Group Bruno Kauffmann, Orange Labs 18 May 2011, ICN Session,

Interne Groupe France Télécom ICN: Opportunities and Challenges Orange Labs – France Telecom Group Bruno Kauffmann, Orange Labs 18 May 2011, ICN Session,
Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.

Graph A graph, G = (V, E), is a data structure where: V is a set of vertices (aka nodes) E is a set of edges We use graphs to represent relationships among.
UMBC an Honors University in Maryland 1 Uncertainty in Ontology Mapping: Uncertainty in Ontology Mapping: A Bayesian Perspective Yun Peng, Zhongli Ding,

UMBC an Honors University in Maryland 1 Uncertainty in Ontology Mapping: Uncertainty in Ontology Mapping: A Bayesian Perspective Yun Peng, Zhongli Ding,
Building and Analyzing Social Networks Web Data and Semantics in Social Network Applications Dr. Bhavani Thuraisingham February 15, 2013.

Building and Analyzing Social Networks Web Data and Semantics in Social Network Applications Dr. Bhavani Thuraisingham February 15, 2013.
Visual Event Detection & Recognition Filiz Bunyak Ersoy, Ph.D. student Smart Engineering Systems Lab.

Visual Event Detection & Recognition Filiz Bunyak Ersoy, Ph.D. student Smart Engineering Systems Lab.
Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.

Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.
INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.

INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.

Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.

Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
CS8803-NS Network Science Fall 2013

CS8803-NS Network Science Fall 2013
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.

Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia Tech) ITER: A Computational Model to Evaluate Provider and Peer Selection in the Internet Ecosystem.

Amogh Dhamdhere (CAIDA) Constantine Dovrolis (Georgia Tech) ITER: A Computational Model to Evaluate Provider and Peer Selection in the Internet Ecosystem.
Distributed Computing Rik Sarkar. Distributed Computing Old style: Use a computer for computation.

Distributed Computing Rik Sarkar. Distributed Computing Old style: Use a computer for computation.
1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.

1 Topics Intro. to Graphs (11.1) A B C D EF G. 2 Definition (p.650) A graph G = V(G) + E(G) A set of vertices (or nodes), V(G) = {v 1, v 2, …, v n } A.
Graph Theory & Networks Name:____________Date:______ Try to trace each figure below without lifting your pencil from the paper and without retracing any.

Graph Theory & Networks Name:____________Date:______ Try to trace each figure below without lifting your pencil from the paper and without retracing any.
Artificial Intelligence Knowledge Representation.

Artificial Intelligence Knowledge Representation.
Students: Anurag Anjaria, Charles Hansen, Jin Bai, Mai Kanchanabal Professors: Dr. Edward J. Delp, Dr. Yung-Hsiang Lu CAM 2 Continuous Analysis of Many.

Students: Anurag Anjaria, Charles Hansen, Jin Bai, Mai Kanchanabal Professors: Dr. Edward J. Delp, Dr. Yung-Hsiang Lu CAM 2 Continuous Analysis of Many.
Experiments Test different parking lot images captured in different luminance conditions The test samples include 1300 available parking spaces and 1500.

Experiments Test different parking lot images captured in different luminance conditions The test samples include 1300 available parking spaces and 1500.

Similar presentations

Ads by Google