88 citations
- École Normale Supérieure Paris-SaclayFR90 papers
- Centre National de la Recherche ScientifiqueFR87 papers
- Institut national de recherche en sciences et technologies du numériqueFR29 papers
- Université Paris-SaclayFR16 papers
- Chennai Mathematical InstituteIN10 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Institute of Science and Technology AustriaAT8 papers
- Université Libre de BruxellesBE7 papers
- Aalborg UniversityDK6 papers
- Université Paris CitéFR6 papers
- University of MonsBE6 papers
- Centre Inria de l'Université de RennesFR5 papers
Showing 2017 · cs.LOShow all
2 papers · 2 filters
cs.LO2017★ 5 cited
A Reduced Semantics for Deciding Trace Equivalence
David Baelde, Stéphanie Delaune, Lucca Hirschi
Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be de…
cs.LO2017
When are Stochastic Transition Systems Tameable?
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +1
A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most g…