| Publication | Date of Publication | Type |
|---|
| Walking Through the Semantics of Exclusive and Event-Based Gateways in BPMN Choreographies | 2024-03-14 | Paper |
| Implementing a CTL model checker with \(\mu \mathcal{G}\), a language for programming graph neural networks | 2024-01-11 | Paper |
| scientific article; zbMATH DE number 7447773 (Why is no real title available?) | 2021-12-17 | Paper |
scientific article; zbMATH DE number 7447773 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-17 | Paper |
| scientific article; zbMATH DE number 7319030 (Why is no real title available?) | 2021-03-10 | Paper |
scientific article; zbMATH DE number 7319030 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-10 | Paper |
| scientific article; zbMATH DE number 7317251 (Why is no real title available?) | 2021-03-03 | Paper |
scientific article; zbMATH DE number 7317251 (Why is no real title available?)
(available as arXiv preprint) | 2021-03-03 | Paper |
Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations
Journal of Logical and Algebraic Methods in Programming | 2021-02-26 | Paper |
scientific article; zbMATH DE number 7269254 (Why is no real title available?)
(available as arXiv preprint) | 2020-11-03 | Paper |
| scientific article; zbMATH DE number 7269254 (Why is no real title available?) | 2020-11-03 | Paper |
Distribution and locality of concurrent systems
Automata, Languages and Programming | 2019-04-29 | Paper |
| scientific article; zbMATH DE number 7020138 (Why is no real title available?) | 2019-02-08 | Paper |
Timed process calculi with deterministic or stochastic delays: commuting between durational and durationless actions
Theoretical Computer Science | 2016-05-27 | Paper |
Towards Abstraction-Based Verification of Shape Calculus
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Model checking biological oscillators
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Bone remodelling in \textsc{BioShape}
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Spatial networks of hybrid I/O automata for modeling excitable tissue
Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
Fair \(\pi\)
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
Linearity, persistence and testing semantics in the asynchronous pi-calculus
Electronic Notes in Theoretical Computer Science | 2013-12-06 | Paper |
| Separation of synchronous and asynchronous communication via testing | 2013-10-07 | Paper |
| Fairness of components in system computations | 2013-09-25 | Paper |
The expressive power of urgent, lazy and busy-waiting actions in timed processes
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Bone remodelling: a complex automata-based model running in BioShape
Lecture Notes in Computer Science | 2010-10-04 | Paper |
Performance preorder: ordering processes with respect to speed
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Detecting synchronisation of biological oscillators by model checking
Theoretical Computer Science | 2010-05-11 | Paper |
Relating fairness and timing in process algebras.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
| A process algebraic approach to software architecture design | 2009-09-10 | Paper |
Modeling and simulation of cardiac tissue using hybrid I/O automata
Theoretical Computer Science | 2009-08-07 | Paper |
Explicit fairness in testing semantics
Logical Methods in Computer Science | 2009-06-30 | Paper |
Liveness of a mutex algorithm in a fair process algebra
Acta Informatica | 2009-05-08 | Paper |
Time and Fairness in a Process Algebra with Non-blocking Reading
Lecture Notes in Computer Science | 2009-02-03 | Paper |
A characterization of regular expressions under bisimulation
Journal of the ACM | 2008-12-21 | Paper |
StonyCam: A Formal Framework for Modeling, Analyzing and Regulating Cardiac Myocytes
Concurrency, Graphs and Models | 2008-06-19 | Paper |
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science | 2007-12-19 | Paper |
Checking a Mutex Algorithm in a Process Algebra with Fairness
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Performance of pipelined asynchronous systems
The Journal of Logic and Algebraic Programming | 2007-02-09 | Paper |
Transactions on Computational Systems Biology III
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Formal Methods for the Design of Real-Time Systems
Lecture Notes in Computer Science | 2006-10-19 | Paper |
Fairness of actions in system computations
Acta Informatica | 2006-09-12 | Paper |
Fairness of components in system computations
Theoretical Computer Science | 2006-05-29 | Paper |
On relating functional specifications to architectural specifications: A case study
Science of Computer Programming | 2006-01-10 | Paper |
Measuring the performance of asynchronous systems with PAFAS
Theoretical Computer Science | 2005-06-10 | Paper |
The expressive power of urgent, lazy and busy-waiting actions in timed processes Research supported by Murst progetto Saladin: Software Architectures and Languages to Coordinate Distributed Mobile Components.
Mathematical Structures in Computer Science | 2004-03-30 | Paper |
| scientific article; zbMATH DE number 2060758 (Why is no real title available?) | 2004-03-18 | Paper |
| scientific article; zbMATH DE number 2044505 (Why is no real title available?) | 2004-02-18 | Paper |
Comparing the worst-case efficiency of asynchronous systems with PAFAS
Acta Informatica | 2003-09-01 | Paper |
An Equational Axiomatization of Bisimulation over Regular Expressions
Journal Of Logic And Computation | 2003-06-16 | Paper |
Static analysis of real-time component-based systems configurations
Science of Computer Programming | 2003-05-14 | Paper |
Absolute versus relative time in process algebras.
Information and Computation | 2003-01-14 | Paper |
On the semantics of durational actions
Theoretical Computer Science | 2002-03-03 | Paper |
``Closed interval process algebra versus ``interval process algebra
Acta Informatica | 2001-08-20 | Paper |
On testing urgency through laziness over processes with durational actions
Theoretical Computer Science | 2001-08-20 | Paper |
A Finite Axiomatization of Nondeterministic Regular Expressions
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
A Finite Axiomatization of Nondeterministic Regular Expressions
RAIRO - Theoretical Informatics and Applications | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1500662 (Why is no real title available?) | 2000-09-04 | Paper |
Models of nondeterministic regular expressions
Journal of Computer and System Sciences | 2000-03-19 | Paper |
On performance congruences for process algebras
Information and Computation | 1999-01-13 | Paper |
| scientific article; zbMATH DE number 1231595 (Why is no real title available?) | 1998-12-21 | Paper |
| scientific article; zbMATH DE number 1231594 (Why is no real title available?) | 1998-12-21 | Paper |
On the coarsest congruence within global-clock-bounded equivalence
Theoretical Computer Science | 1998-08-13 | Paper |
Locality based semantics for process algebras
Acta Informatica | 1997-12-08 | Paper |
Performance preorder and competitive equivalence
Acta Informatica | 1997-09-11 | Paper |
| scientific article; zbMATH DE number 938663 (Why is no real title available?) | 1997-03-25 | Paper |
