Parametric corecursion and completely iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (FICS, 2002)

Final Coalgebras And a Solution Theorem for Arbitrary Endofunctors. - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2002)

On Rational Monads and Free Iterative Theories. - Jirí Adámek; Stefan Milius; Jirí Velebil (CTCS, 2002)

On Iteratable Endofunctors. - Stefan Milius (CTCS, 2002)

Some Remarks on Finitary and Iterative Monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Appl. Categorical Struct., 2003)

On Colimits in Categories of Relations. - Stefan Milius (Appl. Categorical Struct., 2003)

Free Iterative Theories: A Coalgebraic View. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2003)

Infinite trees and completely iterative theories: a coalgebraic view. - Peter Aczel; Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2003)

Preface. - Jirí Adámek; Stefan Milius (CMCS, 2004)

From Iterative Algebras to Iterative Theories (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2004)

Iterative Algebras for a Base. - Jirí Adámek; Stefan Milius; Jirí Velebil (CTCS, 2004)

On coalgebra based on classes. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2004)

Coalgebras, monads and semantics. - Stefan Milius (2005)

Koalgebren Monaden und Semantik. - Stefan Milius (Ausgezeichnete Informatikdissertationen, 2005)

Elgot Algebras: (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (MFPS, 2005)

Completely iterative algebras and completely iterative monads. - Stefan Milius (Inf. Comput., 2005)

A general final coalgebra theorem. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2005)

How Iterative are Iterative Algebras? - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS, 2006)

Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004. - Jirí Adámek; Stefan Milius (Inf. Comput., 2006)

Terminal coalgebras and free iterative theories. - Jirí Adámek; Stefan Milius (Inf. Comput., 2006)

Elgot Algebras. - Jirí Adámek; Stefan Milius; Jirí Velebil (Log. Methods Comput. Sci., 2006)

Iterative algebras at work. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2006)

The category-theoretic solution of recursive program schemes. - Stefan Milius; Lawrence S. Moss (Theor. Comput. Sci., 2006)

What Are Iteration Theories? - Jirí Adámek; Stefan Milius; Jirí Velebil (MFCS, 2007)

Recursive coalgebras of finitary functors. - Jirí Adámek; Dominik Lücke; Stefan Milius (RAIRO Theor. Informatics Appl., 2007)

Algebras with parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2007)

Modelbasierte Softwareentwicklung mit SCADE in der Eisenbahnautomatisierung. - Stefan Milius; Uwe Steinke (MBEES, 2008)

Bases for parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2008)

On Algebras with Iteration. - Jirí Adámek; Stephen L. Bloom; Stefan Milius (J. Log. Comput., 2008)

Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]. - Stefan Milius; Lawrence S. Moss (Theor. Comput. Sci., 2008)

Complete Iterativity for Algebras with Effects. - Stefan Milius; Thorsten Palm; Daniel Schwencke (CALCO, 2009)

A Description of Iterative Reflections of Monads (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (FoSSaCS, 2009)

Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract). - Jirí Adámek; Stefan Milius; Jirí Velebil (MFPS, 2009)

CIA Structures and the Semantics of Recursion. - Stefan Milius; Lawrence S. Moss; Daniel Schwencke (FoSSaCS, 2010)

A Sound and Complete Calculus for Finite Stream Circuits. - Stefan Milius (LICS, 2010)

Recursive Program Schemes and Context-Free Monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (CMCS@ETAPS, 2010)

Equational properties of iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2010)

Iterative reflections of monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2010)

From Corecursive Algebras to Corecursive Monads. - Jirí Adámek; Mahdieh Haddadi; Stefan Milius (CALCO, 2011)

Power-Set Functors and Saturated Trees. - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (CSL, 2011)

Formal Safety Analysis in Industrial Practice. - Ilyas Daskaya; Michaela Huhn; Stefan Milius (FMICS, 2011)

Semantics of Higher-Order Recursion Schemes - Jirí Adámek; Stefan Milius; Jirí Velebil (Log. Methods Comput. Sci., 2011)

Elgot theories: a new perspective on the equational properties of iteration. - Jirí Adámek; Stefan Milius; Jirí Velebil (Math. Struct. Comput. Sci., 2011)

On second-order iterative monads. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2011)

On Finitary Functors and Their Presentations. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CMCS, 2012)

A Coalgebraic Perspective on Minimization and Determinization. - Jirí Adámek; Filippo Bonchi; Mathias Hülsbusch; Barbara König 001; Stefan Milius; Alexandra Silva 001 (FoSSaCS, 2012)

Well-Pointed Coalgebras (Extended Abstract). - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (FoSSaCS, 2012)

Coproducts of Monads on Set. - Jirí Adámek; Stefan Milius; Nathan J. Bowler; Paul Blain Levy (LICS, 2012)

A framework for formal verification of systems of synchronous components. - Stefan Milius; Henning Günther; Jan Peleska 001; Oliver Möller; Helge Löding; Martin Sulzmann; Ramin Hedayati; Axel Zechner (MBEES, 2012)

On the Formal Verification of Systems of Synchronous Software Components. - Henning Günther; Stefan Milius; Oliver Möller (SAFECOMP, 2012)

On the specification of operations on the rational behaviour of systems - Marcello M. Bonsangue; Stefan Milius; Jurriaan Rot (EXPRESS/SOS, 2012)

Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion. - Stefan Milius; Tadeusz Litak (FICS, 2013)

Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. - Stefan Milius; Lawrence S. Moss; Daniel Schwencke (Log. Methods Comput. Sci., 2013)

Well-Pointed Coalgebras - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (Log. Methods Comput. Sci., 2013)

Rational Operational Models. - Stefan Milius; Marcello M. Bonsangue; Robert S. R. Myers; Jurriaan Rot (MFPS, 2013)

How iterative reflections of monads are constructed. - Jirí Adámek; Stefan Milius; Jirí Velebil (Inf. Comput., 2013)

Sound and Complete Axiomatizations of Coalgebraic Language Equivalence. - Marcello M. Bonsangue; Stefan Milius; Alexandra Silva 001 (ACM Trans. Comput. Log., 2013)

How to Kill Epsilons with a Dagger - A Coalgebraic Take on Systems with Algebraic Label Structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (CMCS, 2014)

Canonical Nondeterministic Automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (CMCS, 2014)

An Open Alternative for SMT-Based Verification of Scade Models. - Henning Basold; Henning Günther; Michaela Huhn; Stefan Milius (FMICS, 2014)

Generalized Eilenberg Theorem I: Local Varieties of Languages. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (FoSSaCS, 2014)

Towards a Coalgebraic Chomsky Hierarchy - (Extended Abstract). - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (IFIP TCS, 2014)

Corecursive Algebras, Corecursive Monads and Bloom Monads. - Jirí Adámek; Mahdieh Haddadi; Stefan Milius (Log. Methods Comput. Sci., 2014)

Towards a Coalgebraic Chomsky Hierarchy. - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (CoRR, 2014)

On Continuous Nondeterminism and State Minimality. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (MFPS, 2014)

Observations on formal safety analysis in practice. - Michaela Huhn; Stefan Milius (Sci. Comput. Program., 2014)

Base modules for parametrized iterativity. - Jirí Adámek; Stefan Milius; Jirí Velebil (Theor. Comput. Sci., 2014)

Simplified Coalgebraic Trace Equivalence. - Alexander Kurz 001; Stefan Milius; Dirk Pattinson; Lutz Schröder (Software, Services, and Systems, 2015)

Syntactic Monoids in a Category. - Jirí Adámek; Stefan Milius; Henning Urbat (CALCO, 2015)

Generic Trace Semantics and Graded Monads. - Stefan Milius; Dirk Pattinson; Lutz Schröder (CALCO, 2015)

Finitary Corecursion for the Infinitary Lambda Calculus. - Stefan Milius; Thorsten Wißmann (CALCO, 2015)

Varieties of Languages in a Category. - Jirí Adámek; Robert S. R. Myers; Henning Urbat; Stefan Milius (LICS, 2015)

First Results of a Formal Analysis of the Network Time Security Specification. - Kristof Teichel; Dieter Sibold; Stefan Milius (SSR, 2015)

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. - Jirí Adámek; Paul Blain Levy; Stefan Milius; Lawrence S. Moss; Lurdes Sousa (Appl. Categorical Struct., 2015)

On finitary functors and their presentations. - Jirí Adámek; Stefan Milius; Lawrence S. Moss; Henning Urbat (J. Comput. Syst. Sci., 2015)

Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure. - Filippo Bonchi; Stefan Milius; Alexandra Silva 001; Fabio Zanasi (Theor. Comput. Sci., 2015)

Coalgebraic constructions of canonical nondeterministic automata. - Robert S. R. Myers; Jirí Adámek; Stefan Milius; Henning Urbat (Theor. Comput. Sci., 2015)

Profinite Monads, Profinite Equations, and Reiterman's Theorem. - Liang-Ting Chen 001; Jirí Adámek; Stefan Milius; Henning Urbat (FoSSaCS, 2016)

A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (FoSSaCS, 2016)

An Attack Possibility on Time Synchronization Protocols Secured with TESLA-Like Mechanisms. - Kristof Teichel; Dieter Sibold; Stefan Milius (ICISS, 2016)

Regular Behaviours with Names - On Rational Fixpoints of Endofunctors on Nominal Sets. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (Appl. Categorical Struct., 2016)

A New Foundation for Finitary Corecursion. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (CoRR, 2016)

Regular Behaviours with Names. - Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2016)

One Eilenberg Theorem to Rule Them All. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (CoRR, 2016)

Complete Elgot Monads and Coalgebraic Resumptions. - Sergey Goncharov 001; Stefan Milius; Christoph Rauch (MFPS, 2016)

On Corecursive Algebras for Functors Preserving Coproducts. - Jirí Adámek; Stefan Milius (CALCO, 2017)

Proper Functors and their Rational Fixed Point. - Stefan Milius (CALCO, 2017)

Efficient Coalgebraic Partition Refinement. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CONCUR, 2017)

Automatic verification of application-tailored OSEK kernels. - Hans-Peter Deifel; Merlin Göttlinger; Stefan Milius; Lutz Schröder; Christian Dietrich 001; Daniel Lohmann (FMCAD, 2017)

Nominal Automata with Name Binding. - Lutz Schröder; Dexter Kozen; Stefan Milius; Thorsten Wißmann (FoSSaCS, 2017)

Eilenberg Theorems for Free. - Henning Urbat; Jirí Adámek; Liang-Ting Chen 001; Stefan Milius (MFCS, 2017)

A Coalgebraic Paige-Tarjan Algorithm. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2017)

Guard Your Daggers and Traces: Properties of Guarded (Co-)recursion. - Stefan Milius; Tadeusz Litak (Fundam. Informaticae, 2017)

Predicate Liftings and Functor Presentations in Coalgebraic Expression Languages. - Ulrich Dorsch; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CMCS, 2018)

On Algebras with Effectful Iteration. - Stefan Milius; Jirí Adámek; Henning Urbat (CMCS, 2018)

CoPaR: An Efficient Generic Partition Refiner. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (CoRR, 2018)

Graded Monads for the Linear Time - Branching Time Spectrum. - Ulrich Dorsch; Stefan Milius; Lutz Schröder (CoRR, 2018)

Fixed points of functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (J. Log. Algebraic Methods Program., 2018)

A Categorical Approach to Syntactic Monoids. - Jirí Adámek; Stefan Milius; Henning Urbat (Log. Methods Comput. Sci., 2018)

Proper Functors and Fixed Points for Finite Behaviour. - Stefan Milius (Log. Methods Comput. Sci., 2018)

From Equational Specifications of Algebras with Structure to Varieties of Data Languages (Invited Paper). - Stefan Milius (CALCO, 2019)

Graded Monads and Graded Logics for the Linear Time - Branching Time Spectrum. - Ulrich Dorsch; Stefan Milius; Lutz Schröder (CONCUR, 2019)

Generic Partition Refinement and Weighted Tree Automata. - Hans-Peter Deifel; Stefan Milius; Lutz Schröder; Thorsten Wißmann (FM, 2019)

Equational Axiomatization of Algebras with Structure. - Stefan Milius; Henning Urbat (FoSSaCS, 2019)

Varieties of Data Languages. - Henning Urbat; Stefan Milius (ICALP, 2019)

On functors preserving coproducts and algebras with iterativity. - Jirí Adámek; Stefan Milius (Theor. Comput. Sci., 2019)

Generalized Eilenberg Theorem: Varieties of Languages in a Category. - Jirí Adámek; Stefan Milius; Robert S. R. Myers; Henning Urbat (ACM Trans. Comput. Log., 2019)

On Well-Founded and Recursive Coalgebras. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (FoSSaCS, 2020)

Harnessing LTL With Freeze Quantification. - Daniel Hausmann 001; Stefan Milius; Lutz Schröder (CoRR, 2020)

Unifying Metadata-Based Storage Reconstruction and Carving with LAYR. - Janine Schneider; Hans-Peter Deifel; Stefan Milius; Felix C. Freiling (Digit. Investig., 2020)

A new foundation for finitary corecursion and iterative algebras. - Stefan Milius; Dirk Pattinson; Thorsten Wißmann (Inf. Comput., 2020)

Efficient and Modular Coalgebraic Partition Refinement. - Thorsten Wißmann; Ulrich Dorsch; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2020)

Toward a Uniform Theory of Effectful State Machines. - Sergey Goncharov 001; Stefan Milius; Alexandra Silva 001 (ACM Trans. Comput. Log., 2020)

Initial Algebras Without Iteration ((Co)algebraic pearls). - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2021)

Monads on Categories of Relational Structures. - Chase Ford; Stefan Milius; Lutz Schröder (CALCO, 2021)

Nominal Büchi Automata with Name Allocation. - Henning Urbat; Daniel Hausmann 001; Stefan Milius; Lutz Schröder (CONCUR, 2021)

Explaining Behavioural Inequivalence Generically in Quasilinear Time. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (CONCUR, 2021)

Nondeterministic Syntactic Complexity. - Robert S. R. Myers; Stefan Milius; Henning Urbat (FoSSaCS, 2021)

Coalgebra Encoding for Efficient Minimization. - Hans-Peter Deifel; Stefan Milius; Thorsten Wißmann (FSCD, 2021)

On Language Varieties Without Boolean Operations. - Fabian Birkmann; Stefan Milius; Henning Urbat (LATA, 2021)

Behavioural Preorders via Graded Monads. - Chase Ford; Stefan Milius; Lutz Schröder (LICS, 2021)

A Linear-Time Nominal μ-Calculus with Name Allocation. - Daniel Hausmann 001; Stefan Milius; Lutz Schröder (MFCS, 2021)

An Initial Algebra Theorem Without Iteration. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CoRR, 2021)

From generic partition refinement to weighted tree automata minimization. - Thorsten Wißmann; Hans-Peter Deifel; Stefan Milius; Lutz Schröder (Formal Aspects Comput., 2021)

On the behaviour of coalgebras with side effects and algebras with effectful iteration. - Jirí Adámek; Stefan Milius; Henning Urbat (J. Log. Comput., 2021)

Finitary monads on the category of posets. - Jirí Adámek; Chase Ford; Stefan Milius; Lutz Schröder (Math. Struct. Comput. Sci., 2021)

Reiterman's Theorem on Finite Algebras for a Monad. - Jirí Adámek; Liang-Ting Chen 001; Stefan Milius; Henning Urbat (ACM Trans. Comput. Log., 2021)

Coalgebraic Semantics for Nominal Automata. - Florian Frank 002; Stefan Milius; Henning Urbat (CMCS, 2022)

Stateful Structural Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (FSCD, 2022)

Graded Monads and Behavioural Equivalence Games. - Chase Ford; Stefan Milius; Lutz Schröder; Harsh Beohar; Barbara König 001 (LICS, 2022)

Distributed Coalgebraic Partition Refinement. - Fabian Birkmann; Hans-Peter Deifel; Stefan Milius (TACAS (2), 2022)

Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence. - Thorsten Wißmann; Stefan Milius; Lutz Schröder (Log. Methods Comput. Sci., 2022)

Software and Benchmarks for Distributed Coalgebraic Partition Refinement. - Fabian Birkmann; Hans-Peter Deifel; Stefan Milius (Zenodo, 2022)

Higher-Order Mathematical Operational Semantics (Early Ideas). - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CALCO, 2023)

On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2023)

Nominal Topology for Data Languages. - Fabian Birkmann; Stefan Milius; Henning Urbat (ICALP, 2023)

Weak Similarity in Higher-Order Mathematical Operational Semantics. - Henning Urbat; Stelios Tsampas 001; Sergey Goncharov 001; Stefan Milius; Lutz Schröder (LICS, 2023)

Positive Data Languages. - Florian Frank 002; Stefan Milius; Henning Urbat (MFCS, 2023)

On Kripke, Vietoris and Hausdorff Polynomial Functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CoRR, 2023)

Towards a Higher-Order Mathematical Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (Proc. ACM Program. Lang., 2023)

Eilenberg's variety theorem without Boolean operations. - Fabian Birkmann; Stefan Milius; Henning Urbat (Inf. Comput., 2023)

Monoidal Extended Stone Duality. - Fabian Birkmann; Henning Urbat; Stefan Milius (FoSSaCS (1), 2024)

Bialgebraic Reasoning on Higher-order Program Equivalence. - Sergey Goncharov 001; Stefan Milius; Stelios Tsampas 001; Henning Urbat (LICS, 2024)

Initial Algebras Unchained - A Novel Initial Algebra Construction Formalized in Agda. - Thorsten Wißmann; Stefan Milius (LICS, 2024)

Algebraic Reasoning over Relational Structures. - Jan Jurka; Stefan Milius; Henning Urbat (CoRR, 2024)

Higher-Order Mathematical Operational Semantics. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CoRR, 2024)

Alternating Nominal Automata with Name Allocation. - Florian Frank 002; Daniel Hausmann 001; Stefan Milius; Lutz Schröder; Henning Urbat (CoRR, 2024)

Algebraic Language Theory with Effects. - Fabian Birkmann; Stefan Milius; Henning Urbat; Thorsten Wißmann (CoRR, 2024)

Terminal Coalgebras for Finitary Functors. - Jirí Adámek; Stefan Milius; Lawrence S. Moss (CALCO, 2025)

Algebraic Language Theory with Effects. - Fabian Lenke; Stefan Milius; Henning Urbat; Thorsten Wißmann (ICALP, 2025)

Automated Analysis and Synthesis of Message Authentication Codes. - Stefan Milius; Dominik Paulus; Dominique Schröder; Lutz Schröder; Julian Thomas (IACR Cryptol. ePrint Arch., 2025)

Learning Automata with Name Allocation. - Florian Frank 002; Stefan Milius; Jurriaan Rot; Henning Urbat (CoRR, 2025)

Bialgebraic Reasoning on Stateful Languages. - Sergey Goncharov 001; Stefan Milius; Lutz Schröder; Stelios Tsampas 001; Henning Urbat (CoRR, 2025)