Show simple item record

dc.contributor.authorÁlvarez Faura, M. del Carme
dc.contributor.authorBalcázar Navarro, José Luis
dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-06-29T15:47:58Z
dc.date.available2020-06-29T15:47:58Z
dc.date.issued1990-10
dc.identifier.citationAlvarez, C.; Balcazar, J. L.; Gabarro, J. "Parallel complexity in the design and analysis of concurrent systems". 1990.
dc.identifier.urihttp://hdl.handle.net/2117/191920
dc.description.abstractWe study the parallel complexity of three problems on concurrency: decision of firing sequences for Petri nets, trace equivalence for partially commutative monoids, and strong bisimilarity in finite transition systems. We show that the first two problems can be efficiently parallelized, allowing logarithmic time Parallel RAM algorithms and even constant time unbounded fan-in circuits with threshold gates. However, lower bounds imply that they cannot be solved in constant time by a PRAM algorithm. On the other hand, strong bisimilarity in finite labelled transition systems can be classified as P-complete; as a consequence, algorithms for automated analysis of finite state systems based on bisimulation seem to be inherently sequential in the following sense: the design of an efficient parallel algorithm to solve any of these problems will require an exceedingly hard algorithmic breakthrough.
dc.format.extent18 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-90-38
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshPetri nets
dc.subject.lcshMonoids
dc.subject.otherPetri nets
dc.subject.otherpartially commutative monoids
dc.subject.otherCCS
dc.subject.otherPRAM algorithms
dc.subject.otherboolean circuits
dc.subject.otherP-completeness
dc.titleParallel complexity in the design and analysis of concurrent systems
dc.typeExternal research report
dc.subject.lemacXarxes de Petri
dc.subject.lemacMonoides
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.contributor.groupUniversitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.rights.accessOpen Access
local.identifier.drac1837749
dc.description.versionPostprint (published version)
local.citation.authorAlvarez, C.; Balcazar, J. L.; Gabarro, J.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain