| Publication | Date of Publication | Type |
|---|
| Refactoring of multi-instance BPMN processes with time and resources | 2024-06-05 | Paper |
Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT Rewriting Logic and Its Applications | 2023-07-28 | Paper |
Runtime enforcement with reordering, healing, and suppression Software Engineering and Formal Methods | 2023-05-26 | Paper |
Counterexample Simplification for Liveness Property Violation Software Engineering and Formal Methods | 2023-05-05 | Paper |
| Debugging of concurrent systems using counterexample analysis | 2022-11-04 | Paper |
| Probabilistic model checking of BPMN processes at runtime | 2022-08-19 | Paper |
Resource provisioning strategies for BPMN processes: specification and analysis using Maude Journal of Logical and Algebraic Methods in Programming | 2021-11-03 | Paper |
Bounded analysis and decomposition for behavioural descriptions of components Lecture Notes in Computer Science | 2021-05-25 | Paper |
Automated verification of automata communicating via FIFO and bag buffers Formal Methods in System Design | 2018-07-16 | Paper |
| Checking protocol compatibility using Maude | 2017-05-19 | Paper |
| Analyzing Chor specifications by translation into FSP | 2017-05-19 | Paper |
Automated analysis of asynchronously communicating systems Model Checking Software | 2016-06-22 | Paper |
Debugging process algebra specifications Lecture Notes in Computer Science | 2015-02-04 | Paper |
PIC2LNT: model transformation for model checking an applied pi-calculus Tools and Algorithms for the Construction and Analysis of Systems | 2013-08-05 | Paper |
Structural reconfiguration of systems under behavioral adaptation Science of Computer Programming | 2013-06-06 | Paper |
Counterexample guided synthesis of monitors for realizability enforcement Automated Technology for Verification and Analysis | 2012-11-21 | Paper |
A generic framework for \(n\)-protocol compatibility checking Science of Computer Programming | 2012-07-13 | Paper |
Realizability and dynamic reconfiguration of chor specifications Informatica (Ljubljana) | 2012-05-30 | Paper |
Translating FSP into LOTOS and networks of automata Formal Aspects of Computing | 2010-12-17 | Paper |
Translating FSP into LOTOS and Networks of Automata Lecture Notes in Computer Science | 2009-03-06 | Paper |
On the semantics of communicating hardware processes and their translation into LOTOS for the verification of asynchronous circuits with CADP Science of Computer Programming | 2009-02-19 | Paper |
| scientific article; zbMATH DE number 5368992 (Why is no real title available?) | 2008-11-19 | Paper |
Translating Hardware Process Algebras into Standard Process Algebras: Illustration with CHP and LOTOS Lecture Notes in Computer Science | 2007-11-29 | Paper |
Adaptation of Open Component-Based Systems Lecture Notes in Computer Science | 2007-11-28 | Paper |
| scientific article; zbMATH DE number 2188495 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 1956498 (Why is no real title available?) | 2003-07-30 | Paper |