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

Author: Beauquier D.   Slissenko  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.275, Iss.1, 2002-03, pp. : 347-388

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract