| Publication | Date of Publication | Type |
|---|
Operations on fixpoint equation systems
Logical Methods in Computer Science | 2024-09-04 | Paper |
| A truly symbolic linear-time algorithm for SCC decomposition | 2024-04-05 | Paper |
| The IMITATOR benchmarks library 2.1: A benchmarks library for extended parametric timed automata | 2024-01-31 | Dataset |
| Fast Symbolic Computation of Bottom SCCs - TACAS 2024 artifact | 2023-12-23 | Dataset |
Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin
Lecture Notes in Computer Science | 2023-08-02 | Paper |
| Adiar 1.2.0 : Experiment Data | 2023-07-07 | Dataset |
| Artifact for Paper Search-Space Pruning with Int-Splits for Faster QBF Solving | 2023-03-20 | Dataset |
Parameter Synthesis Algorithms for Parametric Interval Markov Chains
Formal Techniques for Distributed Objects, Components, and Systems | 2023-03-10 | Paper |
| Adiar 1.1.0 : Experiment Data | 2023-03-08 | Dataset |
| scientific article; zbMATH DE number 7649912 (Why is no real title available?) | 2023-02-03 | Paper |
Efficient convex zone merging in parametric timed automata
(available as arXiv preprint) | 2023-01-18 | Paper |
Automated verification of parallel nested DFS
Tools and Algorithms for the Construction and Analysis of Systems | 2022-10-13 | Paper |
| Data for paper "Efficient Convex Zone Merging in Parametric Timed Automata" | 2022-07-07 | Dataset |
| Adiar 1.0.1 : Experiment Data | 2021-11-02 | Dataset |
| On completeness of liveness synthesis for parametric timed automata (Extended Abstract) | 2021-10-27 | Paper |
| Iterative bounded synthesis for efficient cycle detection in parametric timed automata | 2021-08-04 | Paper |
| Setting parameters for biological models with ANIMO | 2021-06-22 | Paper |
Setting parameters for biological models with ANIMO
(available as arXiv preprint) | 2021-06-22 | Paper |
Certifying emptiness of timed Büchi automata
(available as arXiv preprint) | 2021-03-02 | Paper |
| Certifying emptiness of timed Büchi automata | 2021-03-02 | Paper |
Improving the timed automata approach to biological pathway dynamics
Lecture Notes in Computer Science | 2020-02-24 | Paper |
Two \textit{different} strong normalization proofs?
Higher-Order Algebra, Logic, and Term Rewriting | 2019-01-11 | Paper |
Confluence reduction for Markov automata
Theoretical Computer Science | 2017-02-06 | Paper |
Distributed Markovian bisimulation reduction aimed at CSL model checking
Electronic Notes in Theoretical Computer Science | 2014-05-13 | Paper |
A database approach to distributed state space generation
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
Improved distributed algorithms for SCC decomposition
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
| A state space distribution policy based on abstract interpretation | 2013-09-25 | Paper |
Confluence reduction for Markov automata
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Just-in-time: on strategy annotations
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
Improved multi-core nested depth-first search
Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
Multi-core Reachability for Timed Automata
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Efficient modelling and generation of Markov automata
Lecture Notes in Computer Science | 2012-09-25 | Paper |
A linear process-algebraic format with data for probabilistic automata
Theoretical Computer Science | 2012-03-13 | Paper |
On the axiomatizability of priority. II
Theoretical Computer Science | 2011-07-07 | Paper |
A calculus for four-valued sequential logic
Theoretical Computer Science | 2011-07-07 | Paper |
Confluence Reduction for Probabilistic Systems
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Distributed algorithms for SCC decomposition
Journal Of Logic And Computation | 2011-02-02 | Paper |
Equivalent semantic models for a distributed dataspace architecture.
Lecture Notes in Computer Science | 2010-02-09 | Paper |
State space reduction of linear processes using control flow reconstruction
Automated Technology for Verification and Analysis | 2009-12-01 | Paper |
Compositional Control Synthesis for Partially Observable Systems
CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
Accelerated Modal Abstractions of Labelled Transition Systems
Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
Computing Weakest Strategies for Safety Games of Imperfect Information
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Bug Hunting with False Negatives
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Symbolic Reachability for Process Algebras with Recursive Data Types
Theoretical Aspects of Computing - ICTAC 2008 | 2009-01-27 | Paper |
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
Generalizing DPLL and satisfiability for equalities
Information and Computation | 2007-08-23 | Paper |
An abstract interpretation toolkit for \(\mu\)CRL
Formal Methods in System Design | 2007-05-31 | Paper |
| Distribution of a simple shared dataspace architecture | 2007-01-04 | Paper |
Cones and foci: A mechanical framework for protocol verification
Formal Methods in System Design | 2006-11-17 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Which two-sorted algebras of Booleans and naturals have a finite basis?
Algebra Universalis | 2006-01-06 | Paper |
Verification of a sliding window protocol in \(\mu\) CRL and PVS
Formal Aspects of Computing | 2005-12-13 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Algebraic Methodology and Software Technology
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Algebraic Methodology and Software Technology
Lecture Notes in Computer Science | 2005-08-25 | Paper |
| scientific article; zbMATH DE number 2185672 (Why is no real title available?) | 2005-07-04 | Paper |
Zero, successor and equality in BDDs
Annals of Pure and Applied Logic | 2005-04-21 | Paper |
Semantic models of a timed distributed dataspace architecture
Theoretical Computer Science | 2005-04-06 | Paper |
| scientific article; zbMATH DE number 2090085 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087408 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 1927550 (Why is no real title available?) | 2003-06-12 | Paper |
| scientific article; zbMATH DE number 1905121 (Why is no real title available?) | 2003-05-21 | Paper |
| scientific article; zbMATH DE number 1759425 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1759447 (Why is no real title available?) | 2002-10-08 | Paper |
| scientific article; zbMATH DE number 1696764 (Why is no real title available?) | 2002-07-22 | Paper |
A rewriting approach to binary decision diagrams
The Journal of Logic and Algebraic Programming | 2002-05-21 | Paper |
| scientific article; zbMATH DE number 1487730 (Why is no real title available?) | 2000-08-10 | Paper |
| scientific article; zbMATH DE number 1361483 (Why is no real title available?) | 1999-11-10 | Paper |
Operational semantics of rewriting with priorities
Theoretical Computer Science | 1999-01-20 | Paper |
| scientific article; zbMATH DE number 996558 (Why is no real title available?) | 1997-04-03 | Paper |
