Real time scheduling verification with incomplete information

Authors:
Maurizio Talamo;Andrea Callia D'Iddio;Christian H. Schunck;Franco Arcieri
Affiliations:
Nestor Laboratory and Department of Mathematics, Tor Vergata University of Rome, Italy;Department of Mathematics, Tor Vergata University of Rome, Italy;Nestor Laboratory, Tor Vergata University of Rome, Italy;Nestor Laboratory, Tor Vergata University of Rome, Italy
Venue:
AMERICAN-MATH'12/CEA'12 Proceedings of the 6th WSEAS international conference on Computer Engineering and Applications, and Proceedings of the 2012 American conference on Applied Mathematics
Year:
2012

Citing 6
Cited 0

Modeling concurrency with partial orders

International Journal of Parallel Programming
Model checking and abstraction

ACM Transactions on Programming Languages and Systems (TOPLAS)
Partial orders and the axiomatic theory of shuffle (pomsets)

Partial orders and the axiomatic theory of shuffle (pomsets)
Verifying Extended Criteria for the Interoperability of Security Devices

OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Smart Card Handbook

Smart Card Handbook
Interleaving command sequences: a threat to secure smartcard interoperability

CIMMACS'11/ISP'11 Proceedings of the 10th WSEAS international conference on Computational Intelligence, Man-Machine Systems and Cybernetics, and proceedings of the 10th WSEAS international conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

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.