Posts by Collection

portfolio

publications

COSMOS: A Statistical Model Checker for the Hybrid Automata Stochastic Logic

Published in Quantitative Evaluation of Systems (QEST), 2011

Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes

Published in Quantitative Evaluation of Systems (QEST), 2013

Applications of an expressive statistical model checking approach to the analysis of genetic circuits

Published in Theoretical Computer Science, 2015

HASL: An expressive language for statistical verification of stochastic models

Published in The Computer Journal, 2016

Reachability Design Through Approximate Bayesian Computation

Published in Computational Methods in Systems Biology (CMSB), 2019

Petri Nets Validation of Markovian Models of Emergency Department Arrivals

Published in Application and Theory of Petri Nets and Concurrency (PETRI NETS), 2020

Automaton-ABC: A statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models

Published in Theoretical Computer Science, 2021

A framework for optimisation based stochastic process discovery

Published in Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (QEST+FORMATS), 2024

Probabilistic Process Discovery with Stochastic Process Trees

Published in Performance Evaluation Methodologies and Tools (ValueTools), 2024

Statistical Bayesian Inference for Stochastic Process Discovery

Published in Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (QEST+FORMATS), 2025

Statistical Bayesian Inference for Stochastic Process Discovery

Published in International Conference on Quantitative Evaluation of SysTems (QEST), 2025

An efficient stochastic process discovery framework based on optimization

Published in International Journal on Software Tools for Technology Transfer, 2026

Rationale. Introduces a framework that for discovering of the optimal instance of a stochastic workflow net (SWN), based on exact computation of the probabilities of each log trace to be emitted by a SWN instance. The computation of the trace probability is done via breadth-first unfolding of the rachability graph underlying the SWN and relies on memoization in order to improve the computation efficiency.

talks

Talk 1 on Relevant Topic in Your Field

Published:

This is a description of your talk, which is a markdown file that can be all markdown-ified like any other post. Yay markdown!

Conference Proceeding talk 3 on Relevant Topic in Your Field

Published:

This is a description of your conference proceedings talk, note the different field in type. You can put anything in this field.

teaching

Teaching experience 1

Undergraduate course, University 1, Department, 2014

This is a description of a teaching experience. You can use markdown like any other post.

Teaching experience 2

Workshop, University 1, Department, 2015

This is a description of a teaching experience. You can use markdown like any other post.