Weak Bisimulation for Probabilistic Timed Automata and Applications to Security

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Ruggero Lanotte Articles by Andrea Maggiolo-Schettini Articles by Angelo Troina

First International Conference on Software Engineering and Formal Methods (SEFM'03)

Brisbane, Australia

September 22-September 27

ISBN: 0-7695-1949-0

	ASCII Text	x
	Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina, "Weak Bisimulation for Probabilistic Timed Automata and Applications to Security," Software Engineering and Formal Methods, International Conference on, pp. 34, First International Conference on Software Engineering and Formal Methods (SEFM'03), 2003.

	BibTex	x
	@article{ 10.1109/SEFM.2003.1236205, author = {Ruggero Lanotte and Andrea Maggiolo-Schettini and Angelo Troina}, title = {Weak Bisimulation for Probabilistic Timed Automata and Applications to Security}, journal ={Software Engineering and Formal Methods, International Conference on}, volume = {0}, year = {2003}, isbn = {0-7695-1949-0}, pages = {34}, doi = {http://doi.ieeecomputersociety.org/10.1109/SEFM.2003.1236205}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Software Engineering and Formal Methods, International Conference on TI - Weak Bisimulation for Probabilistic Timed Automata and Applications to Security SN - 0-7695-1949-0 SP EP A1 - Ruggero Lanotte, A1 - Andrea Maggiolo-Schettini, A1 - Angelo Troina, PY - 2003 KW - null VL - 0 JA - Software Engineering and Formal Methods, International Conference on ER -

Ruggero Lanotte, Università di Pisa

Andrea Maggiolo-Schettini, Università di Pisa

Angelo Troina, Università di Pisa

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SEFM.2003.1236205

We are interested in describing timed systems that exhibit probabilistic behaviors. To this purpose, we define a model of probabilistic timed automata and give a concept of weak bisimulation together with an algorithm to decide it. We use this model for describing and analyzing a probabilistic non-repudiation protocol in a timed setting.

Citation:

Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina, "Weak Bisimulation for Probabilistic Timed Automata and Applications to Security," sefm, pp.34, First International Conference on Software Engineering and Formal Methods (SEFM'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.