| Publication | Date of Publication | Type |
|---|
| Active prediction for discrete event systems | 2026-03-23 | Paper |
Avoid one's doom: finding cliff-edge configurations in Petri nets
(available as arXiv preprint) | 2024-02-08 | Paper |
| Avoid one's doom: finding cliff-edge configurations in Petri nets | 2024-02-08 | Paper |
| Drawing the line: basin boundaries in safe Petri nets | 2022-12-22 | Paper |
| Computing the reveals relation in occurrence nets | 2021-03-03 | Paper |
Computing the reveals relation in occurrence nets
(available as arXiv preprint) | 2021-03-03 | Paper |
Distributed computation of vector clocks in Petri net unfoldings for test selection
Discrete Event Dynamic Systems | 2020-09-01 | Paper |
The complexity of diagnosability and opacity verification for Petri nets
Fundamenta Informaticae | 2018-10-02 | Paper |
| The complexity of diagnosability and opacity verification for Petri nets | 2018-08-20 | Paper |
| Computing Information Flow Using Symbolic Model-Checking | 2017-04-25 | Paper |
| Optimal constructions for active diagnosis | 2017-02-21 | Paper |
Computation of summaries using net unfoldings
(available as arXiv preprint) | 2017-02-21 | Paper |
Optimal constructions for active diagnosis
Journal of Computer and System Sciences | 2016-09-16 | Paper |
Non-atomic transition firing in contextual nets
Application and Theory of Petri Nets and Concurrency | 2015-08-27 | Paper |
Cunf: a tool for unfolding and verifying Petri nets with read arcs
Automated Technology for Verification and Analysis | 2014-07-08 | Paper |
Computing the reveals relation in occurrence nets
Theoretical Computer Science | 2014-01-10 | Paper |
Contextual merged processes
Application and Theory of Petri Nets and Concurrency | 2013-06-28 | Paper |
| Comparison of algorithms for checking emptiness on Büchi automata | 2012-09-28 | Paper |
Verification of Petri nets with read arcs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Efficient unfolding of contextual Petri nets
Theoretical Computer Science | 2012-08-13 | Paper |
Efficient Contextual Unfolding
CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
Construction and SAT-based verification of contextual unfoldings
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
On the computation of McMillan's prefix for contextual nets and graph grammars
Lecture Notes in Computer Science | 2010-10-04 | Paper |
| Abstraction refinement with Craig interpolation and symbolic pushdown systems | 2009-04-14 | Paper |
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
McMillan’s Complete Prefix for Contextual Nets
Transactions on Petri Nets and Other Models of Concurrency I | 2009-02-03 | Paper |
Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-05-02 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Static Analysis
Lecture Notes in Computer Science | 2006-10-31 | Paper |
| scientific article; zbMATH DE number 2242594 (Why is no real title available?) | 2006-01-02 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Weighted pushdown systems and their application to interprocedural dataflow analysis
Science of Computer Programming | 2005-10-10 | Paper |
Model checking LTL with regular valuations for pushdown systems
Information and Computation | 2004-11-23 | Paper |
Assembling molecules in ATOMIX is hard
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2090847 (Why is no real title available?) | 2004-08-13 | Paper |
Determinization and Complementation of Streett Automata
Lecture Notes in Computer Science | 2003-07-16 | Paper |
| scientific article; zbMATH DE number 1796143 (Why is no real title available?) | 2002-09-04 | Paper |
| scientific article; zbMATH DE number 1670780 (Why is no real title available?) | 2001-11-11 | Paper |
A uniform framework for problems on context-free grammars
Bulletin of the European Association for Theoretical Computer Science EATCS | 2001-07-18 | Paper |
