Full metadata record
DC FieldValueLanguage
dc.contributor.authorShieh, SPen_US
dc.contributor.authorChen, JNen_US
dc.date.accessioned2014-12-08T15:49:06Z-
dc.date.available2014-12-08T15:49:06Z-
dc.date.issued1998-05-15en_US
dc.identifier.issn0140-3664en_US
dc.identifier.urihttp://hdl.handle.net/11536/32623-
dc.description.abstractIn 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. (C) 1998 Elsevier Science B.V.en_US
dc.language.isoen_USen_US
dc.subjecttime-critical systemsen_US
dc.subjectspecificationen_US
dc.subjectvalidationen_US
dc.subjectverificationen_US
dc.subjectreachability analysisen_US
dc.subjectthe space explosion problemen_US
dc.subjectpath approachen_US
dc.titleSpecification, validation, and verification of time-critical systemsen_US
dc.typeArticleen_US
dc.identifier.journalCOMPUTER COMMUNICATIONSen_US
dc.citation.volume21en_US
dc.citation.issue5en_US
dc.citation.spage460en_US
dc.citation.epage469en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000074593900005-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000074593900005.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.