34 search results - page 3 / 7 » Reachability results for timed automata with unbounded data ... |
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We describe a partial order reduction technique for a realtime component model. Components are described as timed automata with data ports, which can be composed in stati...
FMSD
2006
13 years 7 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
AC
2003
Springer
14 years 17 days ago
2003
Springer
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
JSW
2008
13 years 7 months ago
2008
Precise analysis of the Web structure can facilitate data pre-processing and enhance the accuracy of the mining results in the procedure of Web usage mining. STPN Stochastic Timed...