Zobrazeno 1 - 10
of 147
pro vyhledávání: '"Lutz Schröder"'
Autor:
Daniel Hausmann, Lutz Schröder
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-
Externí odkaz:
https://doaj.org/article/ef01bde5e1b64ea3bb26fc62fdc6ff56
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 4 (2022)
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by
Externí odkaz:
https://doaj.org/article/98c929c64ef5449db902d51419a477b3
Autor:
Paul Wild, Lutz Schröder
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 2 (2022)
In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion. Like in the two
Externí odkaz:
https://doaj.org/article/8acd786f9fe946ffb8d36916978cc1a6
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical relational systems
Externí odkaz:
https://doaj.org/article/c33c206bad1f44a4829d9a83ac25faad
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 3 (2019)
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding op
Externí odkaz:
https://doaj.org/article/0341b7ba8945445ab238610f8f96fd70
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 3 (2018)
We study a model of side-effecting processes obtained by starting from a monad modelling base effects and adjoining free operations using a cofree coalgebra construction; one thus arrives at what one may think of as types of non-wellfounded side-effe
Externí odkaz:
https://doaj.org/article/f5ed398663584c3d831c63a056b4594d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and completenes
Externí odkaz:
https://doaj.org/article/84adfe63fa704e878d1104a4aa693d40
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component
Externí odkaz:
https://doaj.org/article/1847e2030e7f45ea8c0e2fb7fff532c0
Autor:
Dirk Pattinson, Lutz Schröder
Publikováno v:
Logical Methods in Computer Science, Vol Volume 7, Issue 1 (2011)
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies also to a
Externí odkaz:
https://doaj.org/article/69b489e64d5844f5b7508569f7aedcb5
Autor:
Lutz Schröder
Publikováno v:
Logical Methods in Computer Science, Vol Volume 4, Issue 4 (2008)
We discuss the treatment of initial datatypes and final process types in the wide-spectrum language HasCASL. In particular, we present specifications that illustrate how datatypes and process types arise as bootstrapped concepts using HasCASL's type
Externí odkaz:
https://doaj.org/article/52ef44084e4a42e4ae9ad6b22c00e73f