Name
Abstract | ||
|---|---|---|
General hybrid systems can be difficult to verify due to their generality. To reduce the complexity, one often specializes to hybrid systems where the complexity is more manageable. If one reduces the modeling formalism to ones where the continuous variables have a single rate, then it may be possible to use the methods of zones to find the reachable state space. Zones are a restricted class of polyhedra formed by considering the intersections of half-planes defined by two variable constraints. Due to their simplicity, zones have simpler, more efficient methods of manipulation than more general polyhedral classes, though they are less accurate. This paper extends the method of zones to labeled Petri net (LPN) models with continuous variables that evolve over a range of rates. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-17524-9_12 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Range of rates,LPNs,Zones,Difference bound matrices | Topology,Petri net,Computer science,Polyhedron,Reachability,Continuous variable,Formalism (philosophy),Hybrid system,State space,Generality | Conference |
Volume | ISSN | Citations |
9058 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 11 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew N. Fisher | 1 | 0 | 0.34 |
| Chris J. Myers | 2 | 607 | 75.73 |
| Peng Li | 3 | 1912 | 152.85 |