Abstract We introduce a generalization of the bisimulation game that can be employed to find all relevant distinguishing Hennessy–Milner logic formulas for two compared finite-state processes. By measuring use expressive powers, we adapt formula generation just yield belonging coarsest behavioral preorders/equivalences from linear-time–branching-time spectrum. The induced algorithm determine be...

DEFINITION: Beahvioral equivalences serve to establish in which cases two reactive (possible concurrent) systems offer similar interaction capabilities relatively to other systems representing their operating environment. Behavioral equivalences have been mainly developed in the context of process algebras, mathematically rigorous languages that have been used for describing and verifying prope...

Exercises 1.2 (a) Composition in RC is well-defined by representatives. (b) A morphism of RC is invertible ⇐⇒ it is a class of strong equivalences ⇐⇒ its counit is an isomorphism. (c) Objects of RC are isomorphic iff they are equivalent categories. (d) RC/T ' Copt(T ) (?). Rigid comparisons embody an important idea from domain theory: approximation. This must have the property that if X ′ appro...

We present an approach to defining Hilbert spaces of functions depending on infinitely many variables or parameters, with emphasis on a weighted tensor product construction based on stable space splittings. The construction has been used in an exemplary way for guiding dimensionand scale-adaptive algorithms in application areas such as statistical learning theory, reduced order modeling, and in...

In the current paper, we re-examine the connection between formal argumentation and logic programming from the perspective of semantics. We observe that one particular translation from logic programs to instantiated argumentation (the one described by Wu, Caminada and Gabbay) is able to serve as a basis for describing various equivalences between logic programming semantics and argumentation se...