Hardness of Preorder Checking for Basic Formalisms

Abstract

We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a standard timed automaton. In both cases, we show that simulation checking is EXPTIME-hard, and for the case of a non-flat implementation, the result holds even if there is no… (More)
DOI: 10.1007/978-3-642-17511-4_8

Topics

2 Figures and Tables

Slides referencing similar topics