A Quadratic Lower Bound for Simulation

arXiv (Cornell University)

Abstract

We show that deciding simulation equivalence and simulation preorder have quadratic lower bounds assuming that the Strong Exponential Time Hypothesis holds. This is in line with the best know quadratic upper bounds of simulation equivalence. This means that deciding simulation is inherently quadratic. A typical consequence of this result is that computing simulation equivalence is fundamentally harder than bisimilarity.

Authors 2

1. Jan Friso Groote

   Eindhoven University of Technology

   Affiliation as printed

   Eindhoven University of Technology Eindhoven , The Netherlands

2. Jan Martens Aachen

   Leiden University

   Affiliation as printed

   Leiden University Leiden , The Netherlands