Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Statecharts: A visual formalism for complex systems
Science of Computer Programming
Temporal logic for real time systems
Temporal logic for real time systems
STATEMATE: A Working Environment for the Development of Complex Reactive Systems
IEEE Transactions on Software Engineering
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
OBSERV—a prototyping language and environment
ACM Transactions on Software Engineering and Methodology (TOSEM)
A compositional axiomatization of Statecharts
Theoretical Computer Science - Selected papers of the International BCS-FACS Workshop on Semantics for Concurrency, Leicester, UK, July 1990
A verifier for real-time properties
Real-Time Systems
Formal methods for the specification and design of real-time safety critical systems
Journal of Systems and Software
Journal of the ACM (JACM)
Visual tools for verifying real-time systems
Theories and experiences for real-time system development
Real-time symbolic model checking for discrete time models
Theories and experiences for real-time system development
Approximations for verifying timing properties
Theories and experiences for real-time system development
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
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
Verification of a Multiplier: 64 Bits and Beyond
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
| Hi-index | 0.00 |
Model-checking is a powerful automated technique for verifying finite state real-time safety critical systems, but suffers from a combinatorial explosion of states as system complexity increases. We introduce a method for compositional reasoning in real-time temporal logic that is suitable for model-checking finite state real-time reactive modules with data variables. This allows for the formal development of systems by top-down hierarchical program derivation. A system can be decomposed into modules, and the modules checked separately instead of checking the complete system all at once. This procedure often results in a significant decrease in the size of the reachability graphs that must be checked, particularly if the modules are loosely coupled. The compositional model-checking method developed in this paper is illustrated using a real time resource allocation problem and the StateTime toolset.