Show simple item record

dc.contributor.authorKutar, M.
dc.date.accessioned2011-02-03T16:41:16Z
dc.date.available2011-02-03T16:41:16Z
dc.date.issued1998
dc.identifier.citationKutar , M 1998 , A comparison of timed CSP and time basic nets for the specification of time constraints . UH Computer Science technical Report , vol. 311 , University of Hertfordshire .
dc.identifier.otherPURE: 88292
dc.identifier.otherPURE UUID: aee1e16d-77e4-4e57-8ba2-42139cd0fdfd
dc.identifier.otherdspace: 2299/5294
dc.identifier.urihttp://hdl.handle.net/2299/5294
dc.description.abstractA level crossing case study was specified in times CSP. The same case study was then specified using Time Basic Nets. To provide an element of control a second case study, the secure room, was specified first using Time Basic Nets and then times CSP. Neither Timed CSP nor Time Basic Nets were adequate for the specification of the time constraints contained within the level crossing case study, although both techniques proved suitable for the specification of the secure room. The report concludes with a critique of the two techniques, both as ‘ordinary’ specification languages and in relation to their suitability for the specification of time constraints.en
dc.language.isoeng
dc.publisherUniversity of Hertfordshire
dc.relation.ispartofseriesUH Computer Science technical Report
dc.rightsOpen
dc.titleA comparison of timed CSP and time basic nets for the specification of time constraintsen
dc.contributor.institutionSchool of Computer Science
dc.relation.schoolSchool of Computer Science
dcterms.dateAccepted1998
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record