Modeling and analysis of concurrent processing systems by temporal petri nets

Simple item page
dc.creatorLu, Harngdar A
dc.date.accessioned2016-11-14T23:09:08Z
dc.date.available2011-02-18T23:28:29Z
dc.date.available2016-11-14T23:09:08Z
dc.date.issued1987-05
dc.degree.departmentComputer Scienceen_US
dc.description.abstractTemporal Petri nets, a new class of Petrinets in which timing constraints are represented by the operators of temporal logic, have recently been proposed. Due to the versati1ity of the temporal logic operators to express temporal Tempora1 Petrinets, a new class of Petrinets in which timing constraints are represented by the operators of temporal logic, have recently been proposed. Due to the versati1ity of the temporal logic operators to express temporal assertions, temporal Petri nets are expected to be suitable for describing causal and temporal relationships between events of a system, including eventuality and fairness. In this thesis we investigate the potential of temporal Petrinets as a design/verification tool for concurrent systems through modeling and analysis of the handshake daisy chain arbiters and the alternating bit protocol. We present some methods for analyzing temporal Petri nets. A brief comparison of temporal Petri nets with other verification methods is a1so given.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2346/20041en_US
dc.language.isoeng
dc.publisherTexas Tech Universityen_US
dc.rights.availabilityUnrestricted.
dc.subjectPetri netsen_US
dc.subjectParallel processing (Electronic computers)en_US
dc.titleModeling and analysis of concurrent processing systems by temporal petri nets
dc.typeThesis

Files

Collections

Texas Tech University