Exploració per tema "P-completeness"

Ara es mostren els items 1-2 de 2

    • Deciding bisimilarity is P-complete 

      Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim; Santha, Miklos (1990)
      Report de recerca
      Accés obert
      On finite labelled transition systems, the problems of deciding strong bisimilarity, observation equivalence, and observation congruence are P-complete under many-one NC-reducibility. As a consequence, algorithms for ...

    • Parallel complexity in the design and analysis of concurrent systems 

      Álvarez Faura, M. del Carme; Balcázar Navarro, José Luis; Gabarró Vallès, Joaquim (1990-10)
      Report de recerca
      Accés obert
      We 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 ...