List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Processes, systems \& tests: defining contextual equivalences | 2024-12-06 | Paper |
| Processes against tests: on defining contextual equivalences Journal of Logical and Algebraic Methods in Programming | 2022-09-30 | Paper |
| Extensional Petri net Formal Aspects of Computing | 2019-03-13 | Paper |
| Place bisimulation and liveness for open Petri nets | 2018-08-16 | Paper |
| A compositional semantics for the reversible \(\pi\)-calculus 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
| Rigid families for the reversible \(\pi \)-calculus Reversible Computation | 2016-08-10 | Paper |
| Rigid families for CCS and the \(\pi\)-calculus Theoretical Aspects of Computing - ICTAC 2015 | 2016-02-25 | Paper |
| A Petri Net Model of Handshake Protocols Electronic Notes in Theoretical Computer Science | 2014-06-27 | Paper |
| Defining fairness in reactive and concurrent systems Journal of the ACM | 2014-02-17 | Paper |
| Probabilistic \(\pi\)-calculus and event structures Electronic Notes in Theoretical Computer Science | 2014-01-17 | Paper |
| Typed event structures and the \(\pi\)-calculus (extended abstract) | 2013-10-10 | Paper |
| Event structure semantics of parallel extrusion in the pi-calculus Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
| Fair adversaries and randomization in two-player games Foundations of Software Science and Computational Structures | 2010-04-27 | Paper |
| Typed event structures and the linear \(\pi \)-calculus Theoretical Computer Science | 2010-04-22 | Paper |
| Counterexamples in Probabilistic LTL Model Checking for Markov Chains CONCUR 2009 - Concurrency Theory | 2009-10-22 | Paper |
| New perspectives on fairness. | 2009-09-19 | Paper |
| The Calculus of Handshake Configurations Foundations of Software Science and Computational Structures | 2009-03-31 | Paper |
| Compositional Event Structure Semantics for the Internal π-Calculus CONCUR 2007 – Concurrency Theory | 2008-09-18 | Paper |
| Security types for dynamic web data Theoretical Computer Science | 2008-08-06 | Paper |
| Semantic subtyping for the pi-calculus Theoretical Computer Science | 2008-06-24 | Paper |
| Model Checking Almost All Paths Can Be Less Expensive Than Checking All Paths FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
| Encoding ℂDuce in the ℂπ-Calculus CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
| CONCUR 2005 – Concurrency Theory Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Probabilistic event structures and domains Theoretical Computer Science | 2006-09-13 | Paper |
| Distributing probability over non-determinism Mathematical Structures in Computer Science | 2006-05-22 | Paper |
| CONCUR 2004 - Concurrency Theory Lecture Notes in Computer Science | 2005-08-23 | Paper |
Research outcomes over time
This page was built for person: Daniele Varacca
