Fully symbolic TCTL model checking for complete and incomplete real-time systems ? ??
We use a symbolic formalism for real-time systems, called FSMT. We present a converter, able to transform timed automata into FSMTs. We present a fully symbolic full TCTL model checking algorithm for FSMTs. FSMTs can simulate parallelized interleaving semantics allowing parallelism of non-synchronising transitions. We extend our methods to incomplete real-time systems where part of the system is put into a black box.
incomplete real-time systems timed automata full tctl model checking