Monitoring of Timing Constraints with Confidence Threshold Requirements
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Monitoring of Timing Constraints with Confidence Threshold Requirements
IEEE Transactions on Computers
Distributed algorithms for partially clairvoyant dispatchers
Cluster Computing
A verification system for timed interval calculus
Proceedings of the 30th international conference on Software engineering
On the design and implementation of a shared memory dispatcher for partially clairvoyant schedulers
International Journal of Parallel Programming
Safe Runtime Verification of Real-Time Properties
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
Feasibility of semiring-based timing constraints
ACM Transactions on Embedded Computing Systems (TECS)
A verification system for interval-based specification languages
ACM Transactions on Software Engineering and Methodology (TOSEM)
A concept lattice-based event model for Cyber-Physical Systems
Proceedings of the 1st ACM/IEEE International Conference on Cyber-Physical Systems
A model for interaction rules to define governance policies in collaborative environments
CSCWD'05 Proceedings of the 9th international conference on Computer Supported Cooperative Work in Design II
A shared memory dispatching approach for partially clairvoyant schedulers
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
| Hi-index | 0.00 |
Efficient algorithms have been developed by a number of authors to detect constraint violation or satisfaction of timed events. In extant work, the time of every event occurrence is assumed to be known exactly. However, there are practical situations where we are not sure about theexact time of occurrence of an event but we may be able to capture the uncertainty by a time interval. In this paper, we propose new types of timing constraints: possible and certain constraints that are pertinent to an event model where timestamps are given by time intervals. We extend previous work in timed event monitoring that is time-point based to our interval-based model. We give an efficient algorithm for monitoring timing constraints under event timing uncertainty, and sketch its proof of correctness by extending the pruning algorithm on the constraint graph to cover interval timestamps.