A Lazy Reachability Algorithm for Timed Automata B. Srivathsan LaBRI, Universit´e Bordeaux 1 The reachability problem for timed automata refers to deciding if there exists - Reachability problem - Document - PDFSEARCH.IO

First Page	Meta Content
	A Lazy Reachability Algorithm for Timed Automata B. Srivathsan LaBRI, Universit´e Bordeaux 1 The reachability problem for timed automata refers to deciding if there exists Add to Reading List Document Date: 2010-12-23 06:40:11 Open Document File Size: 72,24 KB Share Result on Facebook

A Lazy Reachability Algorithm for Timed Automata B. Srivathsan LaBRI, Universit´e Bordeaux 1 The reachability problem for timed automata refers to deciding if there existsAdd to Reading List