Timed Automata with Data Structures for Distributed Systems Design and Analysis

Authors:
Ruggero Lanotte;Andrea Maggiolo-Schettini;Angelo Troina
Affiliations:
Universita dell Insubria;Universita di Pisa;Universita di Pisa
Venue:
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Year:
2005

Citing 7
Cited 1

A theory of timed automata

Theoretical Computer Science
A calculus for cryptographic protocols: the spi calculus

Proceedings of the 4th ACM conference on Computer and communications security
Relations between secrets: two formal analyses of the Yahalom protocol

Journal of Computer Security
UPPAAL - Now, Next, and Future

MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Specification and Verification of Protocols With Time Constraints

Electronic Notes in Theoretical Computer Science (ENTCS)
A simple language for real-time cryptographic protocol analysis

ESOP'03 Proceedings of the 12th European conference on Programming

Expressive power of hybrid systems with real variables, integer variables and arrays

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.