This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05)
Timed automata with data structures for distributed systems design and analysis
Koblenz, Germany
September 07-September 09
ISBN: 0-7695-2435-4
Systems of data management timed automata (SDM-TAs) 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.
Index Terms:
formal specification,automata theory,data structures,decidability,reachability analysis,distributed processing,cryptographic protocol,timed automata,data structure,distributed systems design,system analysis,data management,decidability,reachability,Automata,Data structures,System analysis and design,State-space methods,Cryptographic protocols,Real time systems,Data communication,Synchronization,Timing,Data security
Citation:
A. Troina, A. Maggiolo-Schettini, R. Lanotte, "Timed automata with data structures for distributed systems design and analysis," sefm, pp.44,45,46,47,48,49,50,51,52,53, Third IEEE International Conference on Software Engineering and Formal Methods (SEFM'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.