Show simple item record

dc.contributor.authorBloom, Barden_US
dc.date.accessioned2007-04-23T16:31:28Z
dc.date.available2007-04-23T16:31:28Z
dc.date.issued1993-08en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR93-1372en_US
dc.identifier.urihttps://hdl.handle.net/1813/6146
dc.description.abstractWe investigate the relationship between operational semantics, equational semantics, and ready equivalence (a well-known relative of failure equivalence and testing equivalence) in process algebra. We give a class of structural operational semantic rules, called winterized rules, which define operations respecting ready equivalence. The class of winterized rules is surprisingly broad; it includes some copying operations which would seem to violate ready equivalence. Membership in this class is decidable in $O(n^{2})$ time. We show that for any process algebra defined by such rules has complete equational axiom system. These methods - winterizability in particular - apply mutatis mutandis to other linear-time process equivalences.en_US
dc.format.extent3589638 bytes
dc.format.extent791375 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleReady, Set, Go: Structural Operational Semantics for Linear-Time Process Algebrasen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics