A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Global and Communicating State Machine Models in Event Driven B: A Simple Railway Case Study
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Abstract State Machines: Designing Distributed Systems with State Machines and B
B '98 Proceedings of the Second International B Conference on Recent Advances in the Development and Use of the B Method
csp2B: A Practical Approach to Combining CSP and B
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Refinement and reachability in event_b
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Development of a synchronous subset of AADL
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Formal modelling for ada implementations: tasking event-b
Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
| Hi-index | 0.00 |
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We first consider a model with two executing tasks, presented with the aid of state machine diagrams. We then present a faulty variant of this model which, under particular event timings, may ”drop” an interrupt. We show how the failure to discharge a particular proof obligation leads us to the conceptual error in this model. Finally we generalise the correct model to n tasks, leading to a reduction in proof effort.