Loading...
Please wait, while we are loading the content...
Similar Documents
Real time scheduling verification with incomplete information
| Content Provider | Semantic Scholar |
|---|---|
| Author | Talamo, Maurizio D'Iddio, Andrea Callia Schunck, Christian H. Arcieri, Franco |
| Copyright Year | 2012 |
| Abstract | Schedulers play a critical role in ensuring the performance of IT systems and highly relevant for their security. In many security applications a scheduling must be analyzed rapidly and often this implies that not all information required to uniquely identify individual jobs can be obtained both for practical and efficiency reasons. Here we develop a framework for the automated, real time verification of a scheduling with limited information. Given a set of jobs and a specification of the dependencies between these jobs the task is to check whether the jobs has been scheduled in such an order that the dependencies are satisfied. Dependencies between jobs are specified using a partial order. Due to the loss of information some jobs may become indistinguishable and the partial order property may be lost. By introducing an approach based on abstraction at the combinatorial level we introduce a new framework to represent the approximated information and to define methods and algorithms to check the correctness of abstracted schedulings. Finally we present an application regarding scheduling process for smart cards. Further areas of application include model checking and process mining. |
| Starting Page | 336 |
| Ending Page | 344 |
| Page Count | 9 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.wseas.us/e-library/conferences/2012/CambridgeUSA/MATHCC/MATHCC-53.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
