1355 search results - page 18 / 271 » Alternating Timed Automata over Bounded Time |
IPL
2008
13 years 7 months ago
2008
Quasi-reversible automata is a suitable representation for reversible languages. In this work a method is proposed to obtain such an automaton for any given reversible language re...
HYBRID
2009
Springer
14 years 2 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
ATVA
2005
Springer
14 years 1 months ago
2005
Springer
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
FM
2001
Springer
14 years 2 days ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
ALT
2010
Springer
13 years 9 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability