| Publication | Date of Publication | Type |
|---|
Kaki: efficient concurrent update synthesis for SDN
Formal Aspects of Computing | 2024-09-27 | Paper |
Optimal control strategies for stormwater detention ponds
Nonlinear Analysis. Hybrid Systems | 2024-07-30 | Paper |
Model verification through dependency graphs
Model Checking Software | 2024-02-23 | Paper |
Abstract Dependency Graphs and Their Application to Model Checking
Tools and Algorithms for the Construction and Analysis of Systems | 2023-11-24 | Paper |
Elimination of detached regions in dependency graph verification
Model Checking Software | 2023-10-16 | Paper |
Simulation relations and applications in formal methods
Lecture Notes in Computer Science | 2023-08-10 | Paper |
Start pruning when time gets urgent: partial order reduction for timed systems
Computer Aided Verification | 2023-05-26 | Paper |
| Partial order reduction for reachability games | 2023-02-03 | Paper |
Urgent Partial Order Reduction for Extended Timed Automata
1517.68259 | 2022-12-22 | Paper |
Synthesis for multi-weighted games with branching-time winning conditions
Application and Theory of Petri Nets and Concurrency | 2022-09-01 | Paper |
On-the-Fly Synthesis for Strictly Alternating Games
Application and Theory of Petri Nets and Concurrency | 2022-09-01 | Paper |
| Kaki: concurrent update synthesis for regular policies via Petri games | 2022-08-19 | Paper |
| Automata-driven partial order reduction and guided search for LTL model checking | 2022-07-08 | Paper |
| Faster pushdown reachability analysis with applications in network verification | 2022-06-22 | Paper |
| Stubborn set reduction for timed reachability and safety games | 2022-03-24 | Paper |
| Verification of multiplayer stochastic games via abstract dependency graphs | 2022-03-23 | Paper |
| Automatic synthesis of transiently correct network updates via Petri games | 2022-03-21 | Paper |
| Resilient capacity-aware routing | 2021-08-04 | Paper |
Stubborn set reduction for two-player reachability games
(available as arXiv preprint) | 2021-03-26 | Paper |
| Stubborn set reduction for two-player reachability games | 2021-03-26 | Paper |
| Simplification of CTL formulae for efficient model checking of Petri nets | 2019-12-18 | Paper |
Model checking and synthesis for branching multi-weighted logics
Journal of Logical and Algebraic Methods in Programming | 2019-06-20 | Paper |
Stubborn versus structural reductions for Petri nets
Journal of Logical and Algebraic Methods in Programming | 2018-12-19 | Paper |
A distributed fixed-point algorithm for extended dependency graphs
Fundamenta Informaticae | 2018-10-02 | Paper |
| Extended dependency graphs and efficient distributed fixed-point computation | 2018-08-20 | Paper |
| Distributed computation of fixed points on dependency graphs | 2018-08-16 | Paper |
| PTrie: data structure for compressing and storing sets via prefix sharing | 2017-11-03 | Paper |
| Polynomial time decidability of weighted synchronization under partial observability | 2017-09-12 | Paper |
Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization
Model Checking Software | 2016-06-22 | Paper |
Soundness of timed-arc workflow nets in discrete and continuous-time semantics
Fundamenta Informaticae | 2016-05-02 | Paper |
Language emptiness of continuous-time parametric timed automata
Automata, Languages, and Programming | 2015-11-04 | Paper |
Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets
Lecture Notes in Computer Science | 2015-08-06 | Paper |
Refinement checking on parametric modal transition systems
Acta Informatica | 2015-04-16 | Paper |
Synchronizing strategies under partial observability
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Soundness of timed-arc workflow nets
Application and Theory of Petri Nets and Concurrency | 2014-07-08 | Paper |
TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
Theoretical Computer Science | 2014-06-10 | Paper |
The algorithmics of bisimilarity
Advanced Topics in Bisimulation and Coinduction | 2014-04-25 | Paper |
| Completeness results for undecidable bisimilarity problems | 2013-09-09 | Paper |
Complexity of Weak Bisimilarity and Regularity for BPA and BPP
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
EXPTIME-completeness of thorough refinement on modal transition systems
Information and Computation | 2012-11-27 | Paper |
Extending modal transition systems with structured labels
MSCS. Mathematical Structures in Computer Science | 2012-09-06 | Paper |
Modal transition systems with weight intervals
The Journal of Logic and Algebraic Programming | 2012-08-14 | Paper |
TAPAAL 2.0: integrated development environment for timed-arc Petri nets
Tools and Algorithms for the Construction and Analysis of Systems | 2012-06-29 | Paper |
Dual-priced modal transition systems with time durations
Logic for Programming, Artificial Intelligence, and Reasoning | 2012-06-15 | Paper |
Energy games in multiweighted automata
Theoretical Aspects of Computing – ICTAC 2011 | 2012-01-06 | Paper |
Parametric modal transition systems
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Verification of Timed-Arc Petri Nets
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
On determinism in modal transition systems
Theoretical Computer Science | 2009-09-29 | Paper |
| scientific article; zbMATH DE number 5604065 (Why is no real title available?) | 2009-09-15 | Paper |
Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
Theoretical Aspects of Computing - ICTAC 2009 | 2009-08-20 | Paper |
Beyond Language Equivalence on Visibly Pushdown Automata
Logical Methods in Computer Science | 2009-04-29 | Paper |
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Computer Science Logic | 2009-03-12 | Paper |
Undecidability of bisimilarity by defender's forcing
Journal of the ACM | 2008-12-21 | Paper |
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Infinite Runs in Weighted Timed Automata with Energy Constraints
Lecture Notes in Computer Science | 2008-12-02 | Paper |
Height-Deterministic Pushdown Automata
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
| Reactive Systems | 2007-10-04 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Decidability issues for extended ping-pong protocols
Journal of Automated Reasoning | 2007-01-30 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Applications and Theory of Petri Nets 2005
Lecture Notes in Computer Science | 2005-12-14 | Paper |
SOFSEM 2005: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2163042 (Why is no real title available?) | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2155191 (Why is no real title available?) | 2005-04-11 | Paper |
On the computational complexity of bisimulation, redux
Information and Computation | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2086414 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086665 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087444 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081112 (Why is no real title available?) | 2004-08-04 | Paper |
Complexity of weak bisimilarity and regularity for BPA and BPP
Mathematical Structures in Computer Science | 2004-03-30 | Paper |
Strong bisimilarity of simple process algebras: Complexity lower bounds
Acta Informatica | 2004-03-11 | Paper |
Undecidability of domino games and hhp-bisimilarity.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1948498 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1927587 (Why is no real title available?) | 2003-06-12 | Paper |
| scientific article; zbMATH DE number 1864591 (Why is no real title available?) | 2003-02-06 | Paper |
| scientific article; zbMATH DE number 1759432 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1755136 (Why is no real title available?) | 2002-06-13 | Paper |
Basic process algebra with deadlocking states
Theoretical Computer Science | 2002-03-03 | Paper |
| scientific article; zbMATH DE number 1490005 (Why is no real title available?) | 2001-06-21 | Paper |
| scientific article; zbMATH DE number 1222574 (Why is no real title available?) | 1998-11-11 | Paper |
