Zobrazeno 1 - 10
of 276
pro vyhledávání: '"SCHRÖDER, LUTZ"'
Game-theoretic characterizations of process equivalences traditionally form a central topic in concurrency; for example, most equivalences on the classical linear-time / branching-time spectrum come with such characterizations. Recent work on so-call
Externí odkaz:
http://arxiv.org/abs/2411.03069
While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is currently missing.
Externí odkaz:
http://arxiv.org/abs/2410.14460
Generic notions of bisimulation for various types of systems (nondeterministic, probabilistic, weighted etc.) rely on identity-preserving (normal) lax extensions of the functor encapsulating the system type, in the paradigm of universal coalgebra. It
Externí odkaz:
http://arxiv.org/abs/2410.14440
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automata or, equivalently, nominal orbit-finite automata, tend to have compu
Externí odkaz:
http://arxiv.org/abs/2408.03658
Compositionality proofs in higher-order languages are notoriously involved, and general semantic frameworks guaranteeing compositionality are hard to come by. In particular, Turi and Plotkin's bialgebraic abstract GSOS framework, which provides off-t
Externí odkaz:
http://arxiv.org/abs/2405.16708
Autor:
Prucker, Simon, Schröder, Lutz
Data trees serve as an abstraction of structured data, such as XML documents. A number of specification formalisms for languages of data trees have been developed, many of them adhering to the paradigm of register automata, which is based on storing
Externí odkaz:
http://arxiv.org/abs/2405.14272
We present a systematic approach to logical predicates based on universal coalgebra and higher-order abstract GSOS, thus making a first step towards a unifying theory of logical relations. We first observe that logical predicates are special cases of
Externí odkaz:
http://arxiv.org/abs/2401.05872
We report on COOL-MC, a model checking tool for fixpoint logics that is parametric in the branching type of models (nondeterministic, game-based, probabilistic etc.) and in the next-step modalities used in formulae. The tool implements generic model
Externí odkaz:
http://arxiv.org/abs/2311.01315
Autor:
Beohar, Harsh, Gurke, Sebastian, König, Barbara, Messing, Karla, Forster, Jonas, Schröder, Lutz, Wild, Paul
We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlier work that obtains Hennessy-Milner theorems as corollaries to a fixpo
Externí odkaz:
http://arxiv.org/abs/2310.05711
Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the intended seman
Externí odkaz:
http://arxiv.org/abs/2307.14826