Show simple item record

dc.contributor.authorHENNESSY, MATTHEW
dc.date.accessioned2008-11-24T11:24:43Z
dc.date.available2008-11-24T11:24:43Z
dc.date.created5-8 July 1988en
dc.date.issued1988
dc.date.submitted1988en
dc.identifier.citationRance Cleaveland and Matthew Hennessy `Priorities in process algebra? in proceedings of Third Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, 5-8 July 1988, IEEE Computer Society, 1988, pp 193-202en
dc.identifier.otherYen
dc.identifier.urihttp://hdl.handle.net/2262/24960
dc.descriptionPUBLISHEDen
dc.description.abstractAn operational semantics for an algebraic theory of concurrency is developed that incorporates a notion of priority into the definition of the execution of actions. An equivalence based on strong observational equivalences is defined and shown to be a congruence, and a complete axiomization is given for finite terms. Several examples highlight the novelty and usefulness of the approachesen
dc.format.extent193-202en
dc.format.extent617804 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherIEEE Computer Societyen
dc.rightsYen
dc.subjectAdministrative Staff Authorsen
dc.titlePriorities in process algebras.en
dc.typeConference Paperen
dc.type.supercollectionscholarly_publicationsen
dc.type.supercollectionrefereed_publicationsen
dc.identifier.peoplefinderurlhttp://people.tcd.ie/mcbhenne
dc.identifier.rssinternalid51022
dc.identifier.rssurihttp://ieeexplore.ieee.org/iel2/203/271/00005118.pdf?tp=&isnumber=&arnumber=5118


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record