Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 460-469 |
| Number of pages | 10 |
| Journal | Computer Communications |
| Volume | 21 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 May 1998 |
Keywords
- Path approach
- Reachability analysis
- Specification
- The space explosion problem
- Time-critical systems
- Validation
- Verification
Fingerprint Dive into the research topics of 'Specification, validation, and verification of time-critical systems'. Together they form a unique fingerprint.
Cite this
Shieh, S., & Chen, J. N. (1998). Specification, validation, and verification of time-critical systems. Computer Communications, 21(5), 460-469. https://doi.org/10.1016/S0140-3664(97)00145-X