Show simple item record

dc.contributor.authorBloom, Barden_US
dc.contributor.authorKwiatkowska, Martaen_US
dc.date.accessioned2007-04-23T17:54:33Z
dc.date.available2007-04-23T17:54:33Z
dc.date.issued1991-08en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR91-1223en_US
dc.identifier.urihttps://hdl.handle.net/1813/7063
dc.description.abstractWe compare finite pomsets and Mazurkiewicz traces, two models of true concurrency which generalize strings. We show that Mazurkiewicz traces are equivalent to a restricted class of pomsets. The restrictions lead to extra structure, with results analogous to the differences between simply typed and untyped languages. For example, traces are consistently complete in the prefix order, while pomsets are not; also, traces can be distinguished by observing sequences of actions, in contrast to the elaborate scheme required for distinguishing pomsets. Finally, we discuss the operations of sequential and parallel composition in the two models. This is part of an ongoing effort to relate models of concurrency.en_US
dc.format.extent2403287 bytes
dc.format.extent466868 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.titleTrade-offs in True Concurrency: Pomsets and Mazurkiewicz Tracesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics