Introduction to algorithms
Discrete Event Dynamic Systems
Location Information Management
UbiComp '01 Proceedings of the 3rd international conference on Ubiquitous Computing
GaiaOS: An Infrastructure for Active Spaces
GaiaOS: An Infrastructure for Active Spaces
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Using state equation to prove non-reachability in timed Petrinets
Fundamenta Informaticae - Concurrency specification and programming
Super Spaces: A Middleware for Large-Scale Pervasive Computing Environments
PERCOMW '04 Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops
Computer
A method of workflow scheduling based on colored Petri nets
Data & Knowledge Engineering
Distributed Active Objects -- A Systemic Approach to Distributed Mobile Applications
EASE '11 Proceedings of the 2011 Eighth IEEE International Conference and Workshops on Engineering of Autonomic and Autonomous Systems
Extreme Runtimes of Schedules Modelled by Time Petri Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Verification of Non-functional Properties of a Composable Architecture with Petrinets
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
| Hi-index | 0.00 |
Dealing with cyber-physical systems CPS puts a strong emphasis on the interaction between computing and non-computing elements. Since the physical world is characterized by being strongly distributed and concurrent, this is also reflected in the computational world making the design of such systems a challenging task. If a number of tasks shall be executed on a CPS which are bound to time and space, may have dependencies to other tasks and requires a specific amount of computing devices, a solution requires a four-dimensional space-time schedule which includes positioning of the devices resulting in an NP-hard problem. In this paper, we address the problem of spatial-temporal group scheduling using Timed Petri nets. We use Timed Petri nets in order to model the spatial, temporal, ordered and concurrent character of our mobile, distributed system. Our model is based on a discrete topology in which devices can change their location by moving from cell to cell. Using the time property of Petri nets, we model movement in a heterogeneous terrain as well as task execution or access to other resources of the devices. Given the modeling, we show how to find an optimal schedule by translating the problem into a shortest path problem, which is solvable with the known method of dynamic programming.