| Publication | Date of Publication | Type |
|---|
Introducing divergence for infinite probabilistic models
| 2024-10-23 | Paper |
Branch-well-structured transition systems and extensions
Logical Methods in Computer Science | 2024-06-27 | Paper |
Avoiding state explosion by composition of minimal covering graphs
| 2024-04-29 | Paper |
Coverability and Termination in Recursive Petri Nets
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
Synchronizability of communicating finite state machines is not decidable
Logical Methods in Computer Science | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7730616 (Why is no real title available?)
| 2023-08-21 | Paper |
The Well Structured Problem for Presburger Counter Machines
| 2023-02-03 | Paper |
Verification of Flat FIFO Systems
| 2023-02-03 | Paper |
The Reachability Problem for Two-Dimensional Vector Addition Systems with States
Journal of the ACM | 2022-12-08 | Paper |
Branch-well-structured transition systems and extensions
| 2022-08-19 | Paper |
scientific article; zbMATH DE number 7561336 (Why is no real title available?)
| 2022-07-21 | Paper |
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
| 2022-07-18 | Paper |
Property-directed verification and robustness certification of recurrent neural networks
| 2022-06-22 | Paper |
scientific article; zbMATH DE number 7471708 (Why is no real title available?)
| 2022-02-09 | Paper |
Coverability, termination, and finiteness in recursive Petri nets
Fundamenta Informaticae | 2022-02-01 | Paper |
scientific article; zbMATH DE number 7453189 (Why is no real title available?)
| 2022-01-06 | Paper |
Commodification of accelerations for the Karp and Miller construction
Discrete Event Dynamic Systems | 2021-12-09 | Paper |
Forward analysis for WSTS, part I: completions
Mathematical Structures in Computer Science | 2021-01-07 | Paper |
Forward analysis for WSTS. III: Karp-Miller trees
| 2020-11-25 | Paper |
Verification of flat FIFO systems
| 2020-11-03 | Paper |
Minimal coverability tree construction made complete and efficient
| 2020-09-23 | Paper |
Forward analysis for WSTS. III: Karp-Miller trees
| 2020-06-26 | Paper |
Synchronizability of communicating finite state machines is not decidable
| 2020-05-27 | Paper |
Approaching the coverability problem continuously
| 2019-09-17 | Paper |
Parameterized verification of monotone information systems
Formal Aspects of Computing | 2018-10-23 | Paper |
Reachability in two-dimensional vector addition systems with states is PSPACE-complete
2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The ideal theory for WSTS
| 2018-03-26 | Paper |
Handling infinitely branching well-structured transition systems
Information and Computation | 2017-12-20 | Paper |
The logical view on continuous Petri nets
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
scientific article; zbMATH DE number 6790161 (Why is no real title available?)
| 2017-10-12 | Paper |
Extending the Rackoff technique to affine nets
| 2017-01-26 | Paper |
Forward analysis and model checking for trace bounded WSTS
Theoretical Computer Science | 2016-06-03 | Paper |
Bounded Parikh automata
Electronic Proceedings in Theoretical Computer Science | 2016-03-01 | Paper |
Reachability in timed counter systems
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Automatic verification of counter systems with ranking function
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Unambiguous constrained automata
International Journal of Foundations of Computer Science | 2014-08-04 | Paper |
Handling infinitely branching WSTS
Automata, Languages, and Programming | 2014-07-01 | Paper |
About \textsc{Fast} and \textsc{TReX} accelerations
| 2013-09-26 | Paper |
On the \(\omega\)-language expressive power of extended Petri nets
| 2013-09-25 | Paper |
Reachability in register machines with polynomial updates
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Monotonic extensions of Petri nets: forward and backward search revisited
| 2013-08-16 | Paper |
Bounded Parikh automata
International Journal of Foundations of Computer Science | 2013-07-30 | Paper |
Ordinal theory for expressiveness of well-structured transition systems
Information and Computation | 2013-06-06 | Paper |
Affine Parikh automata
RAIRO - Theoretical Informatics and Applications | 2012-11-22 | Paper |
Unambiguous constrained automata
Developments in Language Theory | 2012-11-02 | Paper |
Forward analysis for WSTS. II: Complete WSTS
Logical Methods in Computer Science | 2012-10-22 | Paper |
The Theory of WSTS: The Case of Complete WSTS
Lecture Notes in Computer Science | 2012-09-04 | Paper |
Place-boundedness for vector addition systems with one zero-test
| 2012-08-29 | Paper |
Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
Journal of Applied Non-Classical Logics | 2012-07-17 | Paper |
Model checking vector addition systems with one zero-test
Logical Methods in Computer Science | 2012-07-03 | Paper |
Forward analysis for WSTS. I: Completions
| 2012-04-24 | Paper |
Forward analysis and model checking for trace bounded WSTS
Applications and Theory of Petri Nets | 2011-06-29 | Paper |
Ordinal theory for expressiveness of well structured transition systems
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Mixing coverability and reachability to analyze VASS with one zero-test
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters | 2009-12-18 | Paper |
Towards Model-Checking Programs with Lists
Infinity in Logic and Computation | 2009-11-12 | Paper |
Forward Analysis for WSTS, Part II: Complete WSTS
Automata, Languages and Programming | 2009-07-14 | Paper |
Reversal-Bounded Counter Machines Revisited
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Towards a Model-Checker for Counter Systems
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
An efficient automata approach to some problems on context-free grammars.
Information Processing Letters | 2008-06-27 | Paper |
Tools and Algorithms for the Construction and Analysis of Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Model Checking Software
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Verification of programs with half-duplex communication
Information and Computation | 2005-11-22 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
A well-structured framework for analysing Petri net extensions
Information and Computation | 2005-02-22 | Paper |
scientific article; zbMATH DE number 2086244 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 1988956 (Why is no real title available?)
| 2003-10-20 | Paper |
Well-abstracted transition systems: Application to FIFO automata.
Information and Computation | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1954380 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1759636 (Why is no real title available?)
| 2002-12-02 | Paper |
scientific article; zbMATH DE number 1759422 (Why is no real title available?)
| 2002-10-07 | Paper |
Well-structured transition systems everywhere!
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1633145 (Why is no real title available?)
| 2001-08-12 | Paper |
scientific article; zbMATH DE number 1560298 (Why is no real title available?)
| 2001-07-16 | Paper |
scientific article; zbMATH DE number 1500528 (Why is no real title available?)
| 2001-01-29 | Paper |
A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
Theoretical Computer Science | 2000-01-12 | Paper |
scientific article; zbMATH DE number 1232238 (Why is no real title available?)
| 1999-01-03 | Paper |
scientific article; zbMATH DE number 1232241 (Why is no real title available?)
| 1999-01-03 | Paper |
scientific article; zbMATH DE number 1223710 (Why is no real title available?)
| 1998-11-15 | Paper |
Verifying identical communicating processes is undecidable
Theoretical Computer Science | 1998-10-22 | Paper |
Composition/décomposition de réseaux de Pétri et de leurs graphes de couverture
RAIRO - Theoretical Informatics and Applications | 1997-12-03 | Paper |
A polynomial algorithm for the membership problem with categorial grammars
Theoretical Computer Science | 1997-02-27 | Paper |
Unreliable channels are easier to verify than perfect channels
Information and Computation | 1996-03-27 | Paper |
Reduction and covering of infinite reachability trees
Information and Computation | 1992-06-25 | Paper |
scientific article; zbMATH DE number 4115984 (Why is no real title available?)
| 1988-01-01 | Paper |
Fifo nets without order deadlock
Acta Informatica | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4030997 (Why is no real title available?)
| 1987-01-01 | Paper |
An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
Theoretical Computer Science | 1985-01-01 | Paper |
Une généralisation des théorèmes de Higman et de Simon aux mots infinis
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3862446 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3932399 (Why is no real title available?)
| 1983-01-01 | Paper |
scientific article; zbMATH DE number 3780569 (Why is no real title available?)
| 1982-01-01 | Paper |
