Show simple item record

dc.contributor.authorCritchlow, Carol M.en_US
dc.contributor.authorPanangaden, Prakashen_US
dc.date.accessioned2007-04-23T17:43:48Z
dc.date.available2007-04-23T17:43:48Z
dc.date.issued1989-05en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR89-998en_US
dc.identifier.urihttps://hdl.handle.net/1813/6914
dc.description.abstractWe investigate the relative expressive power of finite delay operators in SCCS. These were introduced by Milner and by Hennessy to study fairness properties of processes in the context of SCCS. We show that the context sensitive delay operator introduced by Hennessy is more expressive than the finite delay operator introduced by Milner. This result is closely related to recent results by Panangaden and Stark on the expressive power of fair merge in asynchronous dataflow (Kahn) networks. It indicates that the expressiveness results obtained there are not sensitive to the precise computational model since SCCS, unlike Kahn networks, is synchronous and permits expansion of recursively defined processes.en_US
dc.format.extent735149 bytes
dc.format.extent228862 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.titleThe Expressive Power of Delay Operators in SCCSen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics