Name
Abstract | ||
|---|---|---|
The objective of this paper is to develop a framework and associated algorithms for explicit state space exploration of discrete event systems that can scale to very large state spaces. We consider classes of resource allocation systems (RAS), where a set of resources are shared by concurrent processes. In particular, we focus on Gadara RAS, whose Petri net representations have recently been used for liveness enforcement in multithreaded software. We present a framework where each reachable state of the RAS is represented by a single bit. We show how single-bit representations can lead to efficient implementations of supervisory control algorithms. In order to support single-bit state representations, we develop two indexing functions that map each state to a unique integer that serves as the corresponding index of the state in the large bit array. These functions exploit the invariants of the given RAS. Experimental results show that our techniques scale up to exploration and analysis of billions of states on commodity computers. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.3182/20121003-3-MX-4033.00058 | IFAC Proceedings Volumes |
Keywords | DocType | Volume |
Resource Allocation Systems,Petri nets,Supervisory Control,State Space Exploration | Conference | 45 |
Issue | ISSN | Citations |
29 | 1474-6670 | 2 |
PageRank | References | Authors |
0.37 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yin Wang | 1 | 81 | 3.62 |
| Jason Stanley | 2 | 39 | 3.48 |
| StéPhane Lafortune | 3 | 1738 | 181.23 |