| Publication | Date of Publication | Type |
|---|
| Bounded-memory algorithms for verification on-the-fly | 2024-04-29 | Paper |
Reachability analysis on distributed executions
Lecture Notes in Computer Science | 2022-11-02 | Paper |
Interval approximations of message causality in distributed executions
STACS 92 | 2022-08-18 | Paper |
Measuring concurrency of regular distributed computations
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
| Coverability synthesis in parametric Petri nets | 2020-05-27 | Paper |
Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
Theory of Computing Systems | 2017-08-15 | Paper |
Diagnosis of asynchronous discrete-event systems: a net unfolding approach
IEEE Transactions on Automatic Control | 2017-06-20 | Paper |
Robustness of time Petri nets under guard enlargement
Fundamenta Informaticae | 2017-03-16 | Paper |
Discrete parameters in Petri nets
Application and Theory of Petri Nets and Concurrency | 2015-08-27 | Paper |
Foreword in honor of Glynn Winskel
Theoretical Computer Science | 2014-07-25 | Paper |
Application of branching cells to QoS aware service orchestrations
Theoretical Computer Science | 2014-07-25 | Paper |
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design | 2014-06-30 | Paper |
QoS-aware management of monotonic service orchestrations
Formal Methods in System Design | 2014-06-30 | Paper |
Blending timed formal models with clock transition systems
Fundamenta Informaticae | 2014-04-25 | Paper |
Back in time Petri nets
Lecture Notes in Computer Science | 2013-08-16 | Paper |
Robustness of time Petri nets under guard enlargement
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Robustness of time Petri nets under architectural constraints
Lecture Notes in Computer Science | 2012-11-21 | Paper |
Symbolic unfolding of parametric stopwatch Petri nets
Automated Technology for Verification and Analysis | 2010-10-04 | Paper |
Diagnosis Using Unfoldings of Parametric Time Petri Nets
Lecture Notes in Computer Science | 2010-09-10 | Paper |
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science | 2010-03-30 | 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 |
Symbolic Unfoldings for Networks of Timed Automata
Automated Technology for Verification and Analysis | 2008-09-04 | Paper |
LaTe, a Non-fully Deterministic Testing Language
Lecture Notes in Computer Science | 2007-05-02 | 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 |
Distributed monitoring of concurrent and asynchronous systems
Discrete Event Dynamic Systems | 2005-04-25 | Paper |
| scientific article; zbMATH DE number 1973978 (Why is no real title available?) | 2003-09-03 | Paper |
An event structure based semantics for high-level message sequence charts
Mathematical Structures in Computer Science | 2003-04-06 | Paper |
| scientific article; zbMATH DE number 1418452 (Why is no real title available?) | 2000-03-19 | Paper |
Fault detection and diagnosis in distributed systems: An approach by partially stochastic Petri nets
Discrete Event Dynamic Systems | 1999-07-19 | Paper |
On-the-fly analysis of distributed computations
Information Processing Letters | 1997-02-28 | Paper |
On-line computations of the ideal lattice of posets
RAIRO - Theoretical Informatics and Applications | 1995-10-09 | Paper |
Computing on-line the lattice of maximal antichains of posets
Order | 1995-02-09 | Paper |
Testing for unboundedness of fifo channels
Theoretical Computer Science | 1993-10-17 | Paper |
