| Publication | Date of Publication | Type |
|---|
| Automata on infinite trees with counting constraints | 2022-11-02 | Paper |
| Security Policies Enforcement Using Finite Edit Automata | 2014-06-27 | Paper |
| The probability nesting game | 2013-08-15 | Paper |
| On the complexity of finite memory policies for Markov decision processes | 2010-06-17 | Paper |
| A Decidable Probability Logic for Timed Probabilistic Systems | 2010-02-05 | Paper |
| Decidability of Parameterized Probabilistic Information Flow | 2008-06-03 | Paper |
| Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-28 | Paper |
| A Logic of Probability with Decidable Model Checking | 2006-12-04 | Paper |
| Decidable properties for monadic abstract state machines | 2006-08-16 | Paper |
| Periodicity based decidable classes in a first order timed logic | 2006-04-28 | Paper |
| Biography of A. O. Slissenko | 2003-08-17 | Paper |
| A codicity undecidable problem in the plane. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411831 | 2003-07-10 | Paper |
| On probabilistic timed automata. | 2003-01-22 | Paper |
| Decidable verification for reducible timed automata specified in a first order logic with time | 2002-07-31 | Paper |
| Groups and tilings | 2002-07-15 | Paper |
| A first order logic for specification of timed algorithms: Basic properties and a decidable class | 2002-05-20 | Paper |
| Monadic Logic of Order over Naturals has no Finite Base | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547957 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4946211 | 2000-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4934321 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266546 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260364 | 1999-09-19 | Paper |
| Polytime model checking for times probabilistic computation tree logic | 1999-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3839068 | 1998-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347948 | 1997-10-26 | Paper |
| Polyomino tilings, cellular automata and codicity | 1997-02-28 | Paper |
| Automata on infinite trees with counting constraints | 1996-04-16 | Paper |
| Tiling figures of the plane with two bars | 1995-03-22 | Paper |
| Rabin tree automata and finite monoids | 1995-01-09 | Paper |
| THE EFFECT OF THE NUMBER OF SUCCESSFUL PATHS IN A BÜCHI TREE AUTOMATON | 1993-11-01 | Paper |
| Languages and scanners | 1992-06-26 | Paper |
| On translating one polyomino to tile the plane | 1992-06-26 | Paper |
| An undecidable problem about rational sets and contour words of polyominoes | 1991-01-01 | Paper |
| Minimal automaton for a factorial, transitive, and rational language | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026368 | 1986-01-01 | Paper |
| Codeterministic automata on infinite words | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687742 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692897 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4720793 | 1985-01-01 | Paper |
