- Computing Minimal Models Modulo Subset-Simulation for Modal Logics Fabio Papacchini RenateA. Schmidt Mon 23 December 2013
- An Efficient Simulation Algorithm on Kripke Structures Francesco Ranzato Fri 22 November 2013
- A More Efficient Simulation Algorithm on Kripke Structures Francesco Ranzato Fri 22 November 2013
- Backward and forward bisimulation minimisation of tree automata Johanna Høgberg Andreas Maletti Jonathan May Tue 09 April 2013
- Bisimulation Minimization of Tree Automata ParoshAziz Abdulla Lisa Kaati Johanna Høgberg Tue 09 April 2013
- Computing simulations over tree automata: efficient techniques for reducing tree automata Parosh A. Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomáš Vojnar Tue 09 April 2013
- A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata Parosh A. Abdulla Lukas Holik Lisa Kaati Tomas Vojnar Tue 09 April 2013
- Composed Bisimulation for Tree Automata Parosh A. Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomas Vojnar Tue 09 April 2013
- Advanced automata minimization Richard Mayr Lorenzo Clemente Tue 26 February 2013
- When Simulation Meets Antichains Parosh Abdulla Yu-Fang Chen Lukáš Holík Richard Mayr Tomáš Vojnar Thu 13 September 2012
- Computing Simulations over Tree Automata Parosh Abdulla Ahmed Bouajjani Lukáš Holík Lisa Kaati Tomáš Vojnar Thu 13 September 2012
- An efficient simulation algorithm based on abstract interpretation Francesco Ranzato Francesco Tapparo Thu 13 September 2012
- An efficient simulation algorithm based on abstract interpretation Francesco Ranzato Francesco Tapparo Thu 13 September 2012
- A New Efficient Simulation Equivalence Algorithm Francesco Ranzato Francesco Tapparo Thu 13 September 2012
- From Bisimulation to Simulation: Coarsest Partition Problems Raffaella Gentilini Carla Piazza Alberto Policriti Thu 13 September 2012
- Minimization of Tree Automata Thomas von Bomhard Mon 28 May 2012
Library Size: 13G (16 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A
