227 search results - page 7 / 46 » On the Reachability Problem in Cryptographic Protocols |
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
— This paper describes reachability calculations for a hybrid system formalism governing UAVs interacting with another vehicle in a safety-critical situation. We examine this pro...
CCS
2001
ACM
13 years 12 months ago
2001
ACM
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
CANS
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we study the broadcast authentication problem for both erasure and adversarial networks. Two important concerns for authentication protocols are the authentication ...
ACTA
2010
13 years 7 months ago
2010
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...
TACAS
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...