Sciweavers

101 search results - page 6 / 21
» When Are Timed Automata Determinizable
Sort
View
FORMATS
2005
Springer
14 years 1 months ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
ACTA
2010
104views more  ACTA 2010»
13 years 7 months ago
Reachability results for timed automata with unbounded data structures
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...
Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo...
FM
2005
Springer
114views Formal Methods» more  FM 2005»
14 years 1 months ago
Systematic Implementation of Real-Time Models
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
Martin De Wulf, Laurent Doyen, Jean-Françoi...
WINET
2010
153views more  WINET 2010»
13 years 6 months ago
Data aggregation in sensor networks using learning automata
One way to reduce energy consumption in wireless sensor networks is to reduce the number of packets being transmitted in the network. As sensor networks are usually deployed with a...
Mehdi Esnaashari, Mohammad Reza Meybodi
ICECCS
2005
IEEE
73views Hardware» more  ICECCS 2005»
14 years 1 months ago
Integrating Object-Z with Timed Automata
When designing a complex system, Object-Z is a powerful logic-based language for modeling the system state aspects, and Timed Automata is an excellent graph-based notation for cap...
Jin Song Dong, Roger Duke, Ping Hao