activity
20132026
most citedBehavioural equivalences for coalgebras with unobservable moves

19 citations · 96 across the 34 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

cs.PL2017

A Promising Future: Omission Failures in Choreographic Programming

Eva Graversen, Fabrizio Montesi, Marco Peressotti

Choreographic programming promises a simple approach to the coding of concurrent and distributed systems: write the collective communication behaviour of a system of processes as a…

cs.PL2017

Communications in Choreographies, Revisited

Luís Cruz-Filipe, Fabrizio Montesi, Marco Peressotti

Choreographic Programming is a paradigm for developing correct-by-construction concurrent programs, by writing high-level descriptions of the desired communications and then synthe…

cs.LO2017★ 2 cited

Behavioural equivalences for timed systems

Tomasz Brengos, Marco Peressotti

Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and…

cs.LO2017

On the trade-off between labels and weights in quantitative bisimulation

Marco Peressotti

Reductions for transition systems have been recently introduced as a uniform and principled method for comparing the expressiveness of system models with respect to a range of prop…

cs.LO2017

Loose Graph Simulations

Alessio Mansutti, Marino Miculan, Marco Peressotti

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern m…

cs.LO2017★ 1 cited

Reductions for Transition Systems at Work: Deriving a Logical Characterization of Quantitative Bisimulation

Marino Miculan, Marco Peressotti

Weighted labelled transition systems (WLTSs) are an established meta-model aiming to provide general results and tools for a wide range of systems such as non-deterministic, stocha…