"A Class of Automata for Computing Reachability Relations in Timed Systems."

Catalin Dima (2005)

Details and statistics

DOI:

access: unavailable

type: Conference or Workshop Paper

metadata version: 2006-09-07

a service of  Schloss Dagstuhl - Leibniz Center for Informatics