Sciweavers

1035 search results - page 106 / 207
» Communications in cellular automata
Sort
View
PIMRC
2008
IEEE
14 years 4 months ago
Self-organized spatial reuse scheduling in multihop cellular systems
Multihop cellular systems using fixed relay stations are the most promising candidate in the next generation of cellular systems. In order to maximize multihop transmission gains, ...
Chungha Koh, Kang Jin Yoon, Kyung-Ho Sohn, Suji Mo...
FORTE
2007
13 years 11 months ago
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
Fei He, Luciano Baresi, Carlo Ghezzi, Paola Spolet...
ACTA
2010
104views more  ACTA 2010»
13 years 10 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...
FUIN
2007
99views more  FUIN 2007»
13 years 10 months ago
Verifying Security Protocols Modelled by Networks of Automata
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Miroslaw Kurkowski, Wojciech Penczek
CONCUR
2012
Springer
12 years 19 days ago
Avoiding Shared Clocks in Networks of Timed Automata
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
Sandie Balaguer, Thomas Chatain