| Publication | Date of Publication | Type |
|---|
| An approximation-based approach for the random exploration of large models | 2023-05-05 | Paper |
| Update on the Asymptotic Optimality of LPT | 2022-03-31 | Paper |
| A Comparison of Random Task Graph Generation Methods for Scheduling Problems | 2020-07-20 | Paper |
| Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes | 2018-12-18 | Paper |
| Controlling and assessing correlations of cost matrices in heterogeneous scheduling | 2018-01-11 | Paper |
| Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations | 2017-04-03 | Paper |
| The emptiness problem for tree automata with at least one global disequality constraint is NP-hard | 2016-11-23 | Paper |
| On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism | 2015-09-23 | Paper |
| Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata | 2015-09-23 | Paper |
| Handling Left-Quadratic Rules When Completing Tree Automata | 2015-03-23 | Paper |
| Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives | 2015-03-19 | Paper |
| Enhancing Approximations for Regular Reachability Analysis | 2013-08-07 | Paper |
| On Positive TAGED with a Bounded Number of Constraints | 2012-09-20 | Paper |
| From Linear Temporal Logic Properties to Rewrite Propositions | 2012-09-05 | Paper |
| Loops and overloops for tree-walking automata | 2012-08-09 | Paper |
| On the complexity of computing the profinite closure of a rational language | 2011-10-10 | Paper |
| Loops and Overloops for Tree Walking Automata | 2011-07-29 | Paper |
| A Random Testing Approach Using Pushdown Automata | 2011-07-07 | Paper |
| Parametric random generation of deterministic tree automata | 2010-10-07 | Paper |
| Component simulation-based substitutivity managing QoS and composition issues | 2010-08-26 | Paper |
| A note on partially ordered tree automata | 2010-06-09 | Paper |
| A theoretical limit for safety verification techniques with regular fix-point computations | 2010-04-19 | Paper |
| HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA | 2009-11-19 | Paper |
| How to Tackle Integer Weighted Automata Positivity | 2009-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3181700 | 2009-10-12 | Paper |
| Random Generation of Deterministic Tree (Walking) Automata | 2009-07-09 | Paper |
| TAGED Approximations for Temporal Properties Model-Checking | 2009-07-09 | Paper |
| Handling Algebraic Properties in Automatic Analysis of Security Protocols | 2008-09-11 | Paper |
| Finer Is Better: Abstraction Refinement for Rewriting Approximations | 2008-08-28 | Paper |
| Efficiency of automata in semi-commutation verification techniques | 2008-07-29 | Paper |
| A polynomial time algorithm to compute the Abelian kernel of a finite monoid | 2003-08-31 | Paper |
| Some complexity results for polynomial rational expressions. | 2003-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540963 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4330723 | 2002-05-14 | Paper |
| On Shuffle Ideals | 2002-01-01 | Paper |
| A Lower Bound For Reversible Automata | 2001-06-26 | Paper |
