34 search results - page 1 / 7 » Reachability results for timed automata with unbounded data ... |
ACTA
2010
13 years 5 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
WIA
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
ENTCS
2007
13 years 4 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...
FUIN
2007
13 years 4 months ago
2007
Reachability analysis for timed automata using SAT-based methods was considered in many papers, occurring to be a very efficient model checking technique. In this paper we show ho...
ICTAC
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...