| Publication | Date of Publication | Type |
|---|
Taking complete finite prefixes to high level, symbolically
Fundamenta Informaticae | 2024-10-22 | Paper |
Concurrency in Boolean networks
Natural Computing | 2024-02-09 | Paper |
Generalized Alignment-Based Trace Clustering of Process Behavior
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
| Taking complete finite prefixes to high level, symbolically | 2023-11-16 | Paper |
Pomset bisimulation and unfolding for reset Petri nets
Information and Computation | 2022-03-14 | Paper |
Optimized SAT encoding of conformance checking artefacts
Computing | 2021-04-22 | Paper |
Goal-driven unfolding of Petri nets
(available as arXiv preprint) | 2020-05-27 | Paper |
| Boolean networks: beyond generalized asynchronicity | 2018-08-10 | Paper |
| Pomsets and unfolding of reset Petri nets | 2018-06-26 | Paper |
Anti-alignments in conformance checking -- the dark side of process models
Application and Theory of Petri Nets and Concurrency | 2016-10-04 | Paper |
A Canonical Contraction for Safe Petri Nets
Lecture Notes in Computer Science | 2015-11-12 | Paper |
Non-atomic transition firing in contextual nets
Application and Theory of Petri Nets and Concurrency | 2015-08-27 | Paper |
An inverse method for parametric timed automata
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
Avoiding shared clocks in networks of timed automata
Logical Methods in Computer Science | 2013-11-28 | Paper |
Back in time Petri nets
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Building occurrence nets from reveals relations
Fundamenta Informaticae | 2013-06-27 | Paper |
A concurrency-preserving translation from time Petri nets to networks of timed automata
Formal Methods in System Design | 2012-09-27 | Paper |
Avoiding shared clocks in networks of timed automata
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Unfolding-based diagnosis of systems with an evolving topology
Information and Computation | 2010-10-07 | Paper |
Factorization properties of symbolic unfoldings of colored Petri nets
Applications and Theory of Petri Nets | 2010-06-22 | Paper |
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Information Processing Letters | 2010-03-24 | Paper |
Efficient on-the-fly algorithm for checking alternating timed simulation
Lecture Notes in Computer Science | 2009-12-01 | Paper |
AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
International Journal of Foundations of Computer Science | 2009-11-19 | Paper |
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Petri Nets and Other Models of Concurrency - ICATPN 2006 | 2009-04-02 | Paper |
Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Unfolding-Based Diagnosis of Systems with an Evolving Topology
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Symbolic Unfoldings for Networks of Timed Automata
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Techniques for Networked and Distributed Systems - FORTE 2005
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Formal Techniques for Networked and Distributed Systems – FORTE 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
