Name
Abstract | ||
|---|---|---|
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 decidability of reachability. As an application, we model and analyze a cryptographic protocol. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/SEFM.2005.49 | SEFM |
Keywords | Field | DocType |
automata theory,data structures,decidability,distributed processing,formal specification,reachability analysis,cryptographic protocol,data management,data structure,decidability,distributed systems design,reachability,system analysis,timed automata | Data structure,Automata theory,Programming language,Cryptographic protocol,Computer science,Automaton,Formal specification,Decidability,Theoretical computer science,Reachability,Timed automaton,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2435-4 | 2 | 0.39 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruggero Lanotte | 1 | 257 | 28.31 |
| Andrea Maggiolo-Schettini | 2 | 789 | 89.11 |
| Angelo Troina | 3 | 375 | 26.31 |