activity
20122018
most citedTree rules in probabilistic transition system specifications with negative and quantitative premises

17 citations · 22 across the 5 of their papers we have counts for

collaborators

5 papers

cs.LO2018★ 1 cited

Bisimilarity of Open Terms in Stream GSOS

Filippo Bonchi, Tom van Bussel, Matias David Lee +1

Stream GSOS is a specification format for operations and calculi on infinite sequences. The notion of bisimilarity provides a canonical proof technique for equivalence of closed te…

cs.LO2016

Unique Parallel Decomposition for the Pi-calculus

Matias David Lee, Bas Luttik

A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this…

cs.LO2015★ 1 cited

Rooted branching bisimulation as a congruence for probabilistic transition systems

Matias D. Lee, Erik P. de Vink

We propose a probabilistic transition system specification format, referred to as probabilistic RBB safe, for which rooted branching bisimulation is a congruence. The congruence th…

cs.LO2015★ 3 cited

SOS rule formats for convex and abstract probabilistic bisimulations

Pedro R. D'Argenio, Matias David Lee, Daniel Gebler

Probabilistic transition system specifications (PTSSs) in the format provide structural operational semantics for Segala-type systems that exhibit both probabilisti…

cs.PL2012★ 17 cited

Tree rules in probabilistic transition system specifications with negative and quantitative premises

Matias David Lee, Daniel Gebler, Pedro R. D'Argenio

Probabilistic transition system specifications (PTSSs) in the ntmufnu/ntmuxnu format provide structural operational semantics for Segala-type systems that exhibit both probabilisti…