Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

Abstract

Full Citation:

Ronald de Haan, Stefan Szeider. Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. 2015, Technical report AC-TR-15-002, Algorithms and Complexity Group, TU Wien.

Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.