Abstract | ||
---|---|---|
In this paper we study a reachability control problem for distributed systems modeled by timed continuous Petri nets. In particular, we generalize our previous works in this framework where we solved this problem only for distributed systems composed by two subsystems. We will show how the existing algorithm can be adapted in order to be able to deal with distributed systems composed by a finite number of subsystems. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1109/CDC.2010.5717618 | CDC |
Keywords | Field | DocType |
engines,petri nets,semantics,servers,iterative methods,distributed system,petri net | Finite set,Petri net,Computer science,Iterative method,Server,Stochastic Petri net,Reachability,Semantics,Distributed computing | Conference |
ISSN | ISBN | Citations |
0743-1546 | 978-1-4244-7745-6 | 0 |
PageRank | References | Authors |
0.34 | 6 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Hanife Apaydin Özkan | 1 | 1 | 2.06 |
Cristian Mahulea | 2 | 161 | 19.50 |
Jorge Júlvez | 3 | 195 | 20.64 |
Silva, M. | 4 | 316 | 36.61 |