- The Benefit of Being Non-Lazy in Probabilistic łambda-Calculus: Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-Name Gianluca Curzi Michele Pagani Sat 04 July 2020
- Undecidability of Bisimilarity by Defender's Forcing Petr Jančar Jivří Srba Tue 25 June 2019
- BPA bisimilarity is EXPTIME-hard Stefan Kiefer Tue 12 February 2019
- The Expressive Power of Time Petri Nets B. Bérard F. Cassez S. Haddad D. Lime O. H. Roux Thu 24 May 2018
Library Size: 13G (4 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A
