Decidable verification for reducible timed automata specified in a first order logic with time

Danièle Beauquier, Anatol Slissenko. Decidable verification for reducible timed automata specified in a first order logic with time. Theoretical Computer Science, 275(1-2):347-388, 2002. [doi]

Abstract

Abstract is missing.