Show simple item record

dc.contributor.authorFröschle, Sibylle
dc.contributor.authorJančar, Petr
dc.contributor.authorLasota, Slawomir
dc.contributor.authorSawa, Zdeněk
dc.identifier.citationInformation and computation. 2010, vol. 208, issue 1, p. 42-62.en
dc.description.abstractWe show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n3logn)) and history preserving bisimilarity (in O(n6)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on this class. The common general scheme of both algorithms is based on a fixpoint characterization of the equivalences for tree-like labelled event structures. The technique for realizing the greatest fixpoint computation in the case of hereditary history preserving bisimilarity is based on the revealed tight relationship between equivalent tree-like labelled event structures. In the case of history preserving bisimilarity, a technique of deciding classical bisimilarity on acyclic Petri nets is used.en
dc.relation.ispartofseriesInformation and computationen
dc.subjectequivalence checkingen
dc.subjectnon-interleaving equivalencesen
dc.subjectlabelled event structuresen
dc.subjecthereditary history preserving bisimilarityen
dc.subjecthistory preserving bisimilarityen
dc.subjectbisimulation equivalenceen
dc.subjectbasic parallel processesen
dc.titleNon-interleaving bisimulation equivalences on Basic Parallel Processesen
dc.identifier.locationNení ve fondu ÚKen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record