On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey

Forfattere

  • Hans Hüttel
  • Sandeep Shukla

DOI:

https://doi.org/10.7146/brics.v3i39.20021

Resumé

This paper gives an overview of the computational complexity of all the equivalences in the linear/branching time hierarchy [vG90a] and the preorders
in the corresponding hierarchy of preorders. We consider finite state or regular processes as well as infinite-state BPA [BK84b] processes.
A distinction, which turns out to be important in the finite-state processes, is that of simulation-like equivalences/preorders vs. trace-like equivalences
and preorders. Here we survey various known complexity results for these relations. For regular processes, all simulation-like equivalences and preorders are decidable in polynomial time whereas all trace-like equivalences and preorders are PSPACE-Complete. We also consider interesting special
classes of regular processes such as deterministic, determinate, unary, locally unary, and tree-like processes and survey the known complexity results in
these special cases. For infinite-state processes the results are quite different. For the class of context-free processes or BPA processes any preorder or equivalence beyond bisimulation is undecidable but bisimulation equivalence is polynomial time
decidable for normed BPA processes and is known to be elementarily decidable in the general case. For the class of BPP processes, all preorders and equivalences apart from bisimilarity are undecidable. However, bisimilarity
is decidable in this case and is known to be decidable in polynomial time for normed BPP processes.

Downloads

Publiceret

1996-06-09

Citation/Eksport

Hüttel, H., & Shukla, S. (1996). On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey. BRICS Report Series, 3(39). https://doi.org/10.7146/brics.v3i39.20021

Nummer

Nr. 39 (1996): RS-39 On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey

Sektion

Artikler

Licens

Authors who publish with this journal agree to the following terms:

    1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

    1. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  1. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).