Temporal logic for real time systems
Temporal logic for real time systems
Concurrency in programming and database systems
Concurrency in programming and database systems
Formal methods for the specification and design of real-time safety critical systems
Journal of Systems and Software
Communicating Real-Time State Machines
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
Temporal proof methodologies for timed transition systems
Information and Computation
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Program Verification
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Theoretical Foundations of Computer Sciences
Theoretical Foundations of Computer Sciences
Design and verification in real-time distributed computing: an introduction to compositional methods
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Putting Time into Proof Outlines
Proceedings of the Real-Time: Theory in Practice, REX Workshop
(Real) Time: A Philosophical Perspective
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Compositional Verification of Real-Time Systems using Extended Hoare Triples
Proceedings of the Real-Time: Theory in Practice, REX Workshop
| Hi-index | 0.00 |
One aspect that separates real-time programs from sequential and concurrent programs is that correctness depends not only on the logical correctness but also on the temporal properties of the system. In a multiprocessor environment, the allocation of processes among processors and the scheduling policy of each processor are two essential parameters that affect timing behavior of the system, and should be considered in formal modeling and verification techniques. In this paper, we introduce a precedence graph based model for real-time systems. Then, based on this model, we develop an axiomatic approach to reason about the timing behavior of real-time programs. The approach is demonstrated for maximal parallelism and priority based preemptive scheduling.