- Equivalence of pushdown automata via first-order grammars Petr Jančar Thu 10 August 2023
- Decidability of DPDA Language Equivalence via First-Order Grammars Petr Jancar Tue 17 January 2023
- Bisimilarity on Basic Parallel Processes Petr Jančar Tue 14 December 2021
- A Characterization of Regular Expressions Under Bisimulation J. C. M. Baeten F. Corradini C. A. Grabmayer Fri 26 July 2019
- Bisimulation equivalence of first-order grammars is Ackermann-hard Petr Jancar Fri 27 December 2013
- Note on Undecidability of Bisimilarity for Second-Order Pushdown Processes Petr Jančar Jiří Srba Fri 27 December 2013
- Bisimilarity as a Theory of Functional Programming Andrew D. Gordon Wed 30 January 2013
- Environmental bisimulations for higher-order languages Davide Sangiorgi Naoki Kobayashi Eijiro Sumii Mon 28 January 2013
- Bisimilarity of Probabilistic Pushdown Automata Vojtech Forejt Petr Jancar Stefan Kiefer James Worrell Tue 20 November 2012
- On the bisimulation proof method Davide Sangiorgi Fri 05 October 2012
- From Bisimulation to Simulation: Coarsest Partition Problems Raffaella Gentilini Carla Piazza Alberto Policriti Thu 13 September 2012
- Bisimulation Equivalence for First-Order Grammars Petr Jancar Fri 22 June 2012
- Bisimulation and Logic Colin Stirling Tue 05 June 2012
- A tutorial on (co)algebras and (co)induction Bart Jacobs Jan Rutten Wed 25 April 2012
- On the Complexity of Computing Probabilistic Bisimilarity Di Chen Franck van Breugel James Worrell Mon 02 April 2012
- Time-Abstracted Bisimulation: Implicit Specifications and Decidability Kim G. Larsen Yi Wang Tue 06 March 2012
- Decidability of bisimulation equivalences for parallel timer processes Kārlis Čerāns Tue 06 March 2012
Library Size: 13G (17 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
