11 citations · 37 across the 18 of their papers we have counts for
8 papers · 1 filter
Initial Algebras Unchained -- A Novel Initial Algebra Construction Formalized in Agda
Thorsten Wißmann, Stefan Milius
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad…
Weighted and Branching Bisimilarities from Generalized Open Maps
Jérémy Dubut, Thorsten Wißmann
In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open…
Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence
Thorsten Wißmann, Stefan Milius, Lutz Schröder
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabi…
Explaining Behavioural Inequivalence Generically in Quasilinear Time
Thorsten Wißmann, Stefan Milius, Lutz Schröder
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabi…
Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages
Ulrich Dorsch, Stefan Milius, Lutz Schröder +1
We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbo…
A New Foundation for Finitary Corecursion and Iterative Algebras
Stefan Milius, Dirk Pattinson, Thorsten Wißmann
This paper contributes to a theory of the behaviour of "finite-state" systems that is generic in the system type. We propose that such systems are modelled as coalgebras with a fin…
A coalgebraic treatment of conditional transition systems with upgrades
Harsh Beohar, Barbara König, Sebastian Küpper +2
We consider conditional transition systems, that model software product lines with upgrades, in a coalgebraic setting. By using Birkhoff's duality for distributive lattices, we der…
Regular Behaviours with Names
Stefan Milius, Lutz Schröder, Thorsten Wißmann
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and -equivalence on a conveniently abstract categorical level…