The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum
<|reference_start|>The complexity of deciding characteristic formulae in van Glabbeek's branching-time spectrum: Characteristic formulae give a complete logical description of the behaviour of processes modulo some chosen notion of behavioural semantics. They allow one to reduce equivalence or preorder checking to model checking, and are exactly the formulae in the modal logics characterizing classic behavioural equivalences and preorders for which model checking can be reduced to equivalence or preorder checking.   This paper studies the complexity of determining whether a formula is characteristic for some finite, loop-free process in each of the logics providing modal characterizations of the simulation-based semantics in van Glabbeek's branching-time spectrum. Since characteristic formulae in each of those logics are exactly the consistent and prime ones, it presents complexity results for the satisfiability and primality problems, and investigates the boundary between modal logics for which those problems can be solved in polynomial time and those for which they become computationally hard.   Amongst other contributions, this article also studies the complexity of constructing characteristic formulae in the modal logics characterizing simulation-based semantics, both when such formulae are presented in explicit form and via systems of equations.<|reference_end|>
@article{aceto2024the,
    title={The complexity of deciding characteristic formulae in van Glabbeek's
  branching-time spectrum},
    author={Luca Aceto and Antonis Achilleos and Aggeliki Chalki and Anna
  Ingolfsdottir},
    journal={arXiv preprint arXiv:2405.13697},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.13697},
    primaryClass={cs.LO}
}