ULTraS at work: Compositionality metaresults for bisimulation and trace semantics

The ULTraS metamodel can be instantiated to a large number of well established models, including labeled transition systems together with their probabilistic, deterministic timed, and stochastic timed extensions. Several metaequivalences have been defined on the ULTraS metamodel, which can be instantiated to well known behavioral equivalences for those specific models. However, new equivalences pop up, instead of the widely accepted ones, in the case of processes featuring probabilities and internal nondeterminism. Most importantly, the properties of the metaequivalences have not been investigated yet. Focusing on bisimulation and trace semantics, we first show that, by simply introducing the notion of resolution in the ULTraS theory, and exchanging the order of certain universal quantifiers in the definition of the metaequivalences, it is possible to retrieve the behavioral equivalences not captured before, as well as to keep the new ones. We then study the compositionality, with respect to typical process algebraic operators, of the two bisimulation metaequivalences and of the two trace metaequivalences respectively arising from the two different quantification orders. The congruence metaresults for parallel composition confirm the existence of a foundational difference in the compositionality of bisimulation and trace semantics when internal nondeterminism is present, which had recently emerged in the specific setting of probabilistic and nondeterministic processes.