apl. Prof. Dr. Stefan Milius


Personal Website: http://www.stefan-milius.eu



Organisation


Technische Fakultät
Lehrstuhl für Informatik 8 (Theoretische Informatik)



Project lead

Go to first page Go to previous page 1 of 2 Go to next page Go to last page

Koinduktion und Algebra in der Axiomatisierung und Algorithmik von Systemäquivalenzen
apl. Prof. Dr. Stefan Milius
(01/06/2019 - 31/05/2022)

Coinduction meets algebra for the axiomatization and algorithmics of system equivalences
apl. Prof. Dr. Stefan Milius; Prof. Dr. Lutz Schröder
(01/02/2019 - 31/01/2022)

DAAD Reisekostenbeihilfe - Eingeladener Vortrag auf dem Workshop “{Symmetry, Logic, Computation}” des Simons Institutes in Berkeley CA, USA
apl. Prof. Dr. Stefan Milius
(07/11/2016 - 10/11/2016)

Advances in Coalgebraic Automata Theory
apl. Prof. Dr. Stefan Milius
(01/01/2015 - 31/12/2015)

COAX: Coinduction Meets Algebra For the Axiomatization of System Equivalence
apl. Prof. Dr. Stefan Milius; Prof. Dr. Lutz Schröder
(01/10/2014 - 31/07/2018)


Project member


DAAD Reisekostenbeihilfe - Eingeladener Vortrag auf dem Workshop “{Symmetry, Logic, Computation}” des Simons Institutes in Berkeley CA, USA
apl. Prof. Dr. Stefan Milius
(07/11/2016 - 10/11/2016)

Advances in Coalgebraic Automata Theory
apl. Prof. Dr. Stefan Milius
(01/01/2015 - 31/12/2015)

DAAD Reisekostenbeihilfe - eingeladener Vortrag auf dem Workshop über “Coalgebras in Computation, Logic, Probability and Quantum Physics”
apl. Prof. Dr. Stefan Milius
(18/03/2013 - 22/03/2013)


Publications (Download BibTeX)

Go to first page Go to previous page 5 of 6 Go to next page Go to last page

Bonchi, F., Milius, S., Silva, A., & Zanasi, F. (2014). How to Kill Epsilons with a Dagger: A Coalgebraic Take on Systems with Algebraic Label Structure. In Proc. Coalgebraic Methods in Computer Science (CMCS'14) (pp. 53-74). Grenoble, France, FR: Berlin/Heidelberg: Springer.
Huhn, M., & Milius, S. (2014). Observations on formal safety analysis in practice. Science of Computer Programming, 80A, 150--168.
Adámek, J., Milius, S., Myers, R., Urbat, H., & Urbat, H. (2014). On Continuous Nondeterminism and State Minimality. Electronic Notes in Theoretical Computer Science, 308, 3-23. https://dx.doi.org/10.1016/j.entcs.2014.10.002
Goncharov, S., Milius, S., & Silva, A. (2014). Towards a Coalgebraic Chomsky Hierarchy. In Proc. 8th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (pp. 265-280). Rom: Heidelberg: Springer.
Milius, S., Moss, L., & Schwencke, D. (2013). Abstract GSOS rules and a Modular Treatment of Recursive Definitions. Logical Methods in Computer Science, 9(3:28), 1-52. https://dx.doi.org/10.2168/LMCS-9(3:28)2013
Heckel, R., & Milius, S. (Eds.) (2013). Algebra and Coalgebra in Computer Science: 5th International Conference, CALCO 2013 (Proceedings). Springer.
Milius, S., & Litak, T.M. (2013). Guard Your Daggers and Traces: On The Equational Properties of Guarded (Co-)recursion. In Proc. Fixed Points in Computer Science (pp. 72-86). Cornell: Cornell University Library.
Adámek, J., Milius, S., & Velebil, J. (2013). How Iterative Reflections of Monads are Constructed. Information and Computation, 225, 83--118.
Heckel, R., & Milius, S. (2013). Preface to Proceedings of CALCO 2013. In Algebra and Coalgebra in Computer Science, (pp. 359 p. 29 illus). Warschau: Berlin/Heidelberg: Springer.
Milius, S., Bonsangue, M., Myers, R., & Rot, J. (2013). Rational Operational Models. In Proc. of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX (pp. 257-282). Berlin München: Elsevier BV.

Last updated on 2019-26-02 at 22:51