| dc.contributor.advisor |
Nancy Lynch |
en_US |
| dc.contributor.author |
Umeno, Shinya |
en_US |
| dc.contributor.other |
Theory of Computation |
en_US |
| dc.date.accessioned |
2008-07-28T13:30:25Z |
|
| dc.date.available |
2008-07-28T13:30:25Z |
|
| dc.date.issued |
2008-07-28 |
en_US |
| dc.identifier.other |
MIT-CSAIL-TR-2008-048 |
en_US |
| dc.identifier.uri |
http://hdl.handle.net/1721.1/41891 |
|
| dc.description.abstract |
We present a new abstraction technique, event order abstraction (EOA), for parametric safety verification of real-time systems in which ``correct orderings of events'' needed for system correctness are maintained by timing constraints on the systems' behavior. By using EOA, one can separate the task of verifying a real-time system into two parts: 1. Safety property verification of the system given that only correct event orderings occur; and 2. Derivation of timing parameter constraints for correct orderings of events in the system.The user first identifies a candidate set of bad event orders.Then, by using ordinary untimed model-checking, the user examines whether a discretized system model in which all timing constraints are abstracted away satisfies a desirable safety property under the assumption that the identified bad event orders occur in no system execution. The user uses counterexamples obtained from the model-checker to identify additional bad event orders, and repeats the process until the model-checking succeeds. In this step, the user obtains a sufficient set of bad event orders that must be excluded by timing synthesis for system correctness.Next, the algorithm presented in the paper automatically derives a set of timing parameter constraints under which the system does not exhibit the identified bad event orderings. From this step combined with the untimed model-checking step,the user obtains a sufficient set of timing parameter constraints under which the system executes correctly with respect to a given safety property.We illustrate the use of EOA with a train-gate example inspired by the general railroad crossing problem. We also summarize three other case studies, a biphase mark protocol, the IEEE 1394 root contention protocol, and the Fischer mutual exclusion algorithm. |
en_US |
| dc.description.provenance |
Submitted by CSAIL Importer (publications-dspace@csail.mit.edu) on 2008-07-28T13:30:24Z
No. of bitstreams: 2
MIT-CSAIL-TR-2008-048.pdf: 369160 bytes, checksum: 37f9c4f3719876fc3cd8809f8990c044 (MD5)
MIT-CSAIL-TR-2008-048.ps: 73870 bytes, checksum: 63a7e9a7b7ca11294f74df2be3dc3a69 (MD5) |
en |
| dc.description.provenance |
Made available in DSpace on 2008-07-28T13:30:25Z (GMT). No. of bitstreams: 2
MIT-CSAIL-TR-2008-048.pdf: 369160 bytes, checksum: 37f9c4f3719876fc3cd8809f8990c044 (MD5)
MIT-CSAIL-TR-2008-048.ps: 73870 bytes, checksum: 63a7e9a7b7ca11294f74df2be3dc3a69 (MD5)
Previous issue date: 2008-10-19 |
en |
| dc.format.extent |
19 p. |
en_US |
| dc.relation |
|
en_US |
| dc.relation |
Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory |
en_US |
| dc.subject |
parametric verification |
en_US |
| dc.subject |
event-based approach |
en_US |
| dc.subject |
counter-example guided abstraction refinement (CEGAR) |
en_US |
| dc.subject |
automatic timing synthesis |
en_US |
| dc.title |
Event Order Abstraction for Parametric Real-Time System Verification |
en_US |
