Safety analysis of timing properties in real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Safety Analysis Using Petri Nets
IEEE Transactions on Software Engineering
Reasoning About Time in Higher-Level Language Software
IEEE Transactions on Software Engineering
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Multilevel specification of real time systems
Communications of the ACM - Special issue on software engineering
A Unified High-Level Petri Net Formalism for Time-Critical Systems
IEEE Transactions on Software Engineering
Communicating Real-Time State Machines
IEEE Transactions on Software Engineering - Special issue: specification and analysis of real-time systems
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Communicating sequential processes
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Proving Properties of Real-Time Systems Through Logical Specifications and Petri Net Models
IEEE Transactions on Software Engineering
Probabilistic Timed Protocol Verification for the Extended State Transition Model
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Specification and Verification of Real-Time Properties Using LOTOS and SQTL
IWSSD '96 Proceedings of the 8th International Workshop on Software Specification and Design
Using timed CSP for specification verification and simulation of multimedia synchronization
IEEE Journal on Selected Areas in Communications
Synchronization and storage models for multimedia objects
IEEE Journal on Selected Areas in Communications
Hi-index | 0.24 |
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserves the advantages of CFSM, such as the ability to express communication, synchronization and concurrency in computer systems. A given time-dependent specification can be formalized as a Timed CFSM, from which the reachability graph is constructed to verify the correctness of the specification. To cope with the space explosion problem from which all reachability analysis methods suffer, we propose a space reduction algorithm to meet the space constraint of the verification environment.