93 search results - page 10 / 19 » Timed Unfoldings for Networks of Timed Automata |
112
click to vote
ETFA
2008
IEEE
15 years 6 months ago
2008
IEEE
The reactivity of Networked Automation Systems (NAS) has direct influence on safety and quality aspects. It can be determined by a response time analysis, which itself can be calc...
111
click to vote
ACRI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
111
click to vote
ENTCS
2007
14 years 11 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-...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
In a typical realistic scenario, there exist some past data about the structure of the network which are analyzed with respect to some possibly future spreading process, such as b...
107
click to vote
CONEXT
2007
ACM
15 years 3 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...