19 search results - page 4 / 4 » Reachability analysis of continuous-time piecewise affine sy... |
CDC
2008
IEEE
13 years 7 months ago
2008
IEEE
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (contPN). Specifically, we consider two problems: (1) given an initial set o...
HYBRID
2003
Springer
13 years 10 months ago
2003
Springer
s of Invited Presentations The Mathematics of Matter and the Mathematics of Mind . . . . . . . . . . . . . 1 David Berlinski A Grand Challenge: Full Reactive Modeling of a Multi-ce...
TII
2010
13 years 1 days ago
2010
In this paper, we develop an automated framework for formal verification of timed continuous Petri nets (ContPNs). Specifically, we consider two problems: (1) given an initial set ...
FAC
2008
13 years 5 months ago
2008
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typ...