Sciweavers

732 search results - page 71 / 147
» Axiomatising timed automata
Sort
View
AHSWN
2010
177views more  AHSWN 2010»
13 years 9 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi
FORMATS
2004
Springer
14 years 2 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker
FOSSACS
2006
Springer
14 years 19 days ago
Denotational Semantics of Hybrid Automata
Abstract. We introduce a denotational semantics for non-linear hybrid automata, and relate it to the operational semantics given in terms of hybrid trajectories. The semantics is d...
Abbas Edalat, Dirk Pattinson
ICALP
2011
Springer
13 years 13 days ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy
TPHOL
2008
IEEE
14 years 3 months ago
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS
Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for veri...
Sayan Mitra, K. Mani Chandy