Parallel Simulation of Dynamic Communication Processes on the Base of Probability Time Automata

Henryk Piech, Grzegorz Grodzki, Aleksandra Ptak

2014

Abstract

The proposition is connected with the research of the security or threatens referring to message decryption, user dishonesty, non-fresh nonce, uncontrolled information jurisdiction, etc. (security attributes), in network communication processes. Encrypted messages are usually sent in the form of protocol operations. Protocols may be mutually interleaving, creating the so called runs, and their operations can appear as mutual parallel processes. The investigation regards both particular security attributes and their compositions referring to more general factors, such as: concrete users, protocols, public keys, secrets, messages, etc. The abovementioned situation forms a conception about parallel strategy realized with the help of PTA and Petri net that includes the set of security tokens (attributes) in each node.

References

  1. Alur, R. and Dill, D. L. (1994). A Theory of Timed Automata. Theoretical Computer Science, 126:183-235.
  2. Beauquier, D. (2003). On probabilistic timed automata. Theor. Comput. Sci., 292(1):65-84.
  3. Burrows, M., Abadi, M., and Needham, R. (1990). A logic of authentication. ACM Trans. Comput. Syst., 8(1):18-36.
  4. Kwiatkowska, M., Norman, G., Segala, R., and Sproston, J. (2002). Automatic verification of real-time systems with discrete probability distributions. Theoretical Computer Science, 282:101-150.
  5. Szpyrka, M. and Szmuc, T. (2006). Verification of automatic train protection systems with rtcp-nets. In Proceedings of the 25th International Conference on Computer Safety, Reliability, and Security, SAFECOMP'06, pages 344-357, Berlin, Heidelberg. Springer-Verlag.
  6. Tadeusiewicz, R. (2011). Introduction to inteligent systems, chapter no 1. In The Industrial Electronic Handbook, Wilamowski B.M., Irvin J.D.(Eds.), pages 1-12. CRC Press Boca Raton.
  7. Tudruj, M. and Masko, L. (2005). Towards massively parallel numerical computations based on dynamic smp clusters with communication on the fly. In Parallel and Distributed Computing, 2005. ISPDC 2005. The 4th International Symposium on, pages 155-162.
Download


Paper Citation


in Harvard Style

Piech H., Grodzki G. and Ptak A. (2014). Parallel Simulation of Dynamic Communication Processes on the Base of Probability Time Automata . In Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH, ISBN 978-989-758-038-3, pages 237-242. DOI: 10.5220/0005102702370242


in Bibtex Style

@conference{simultech14,
author={Henryk Piech and Grzegorz Grodzki and Aleksandra Ptak},
title={Parallel Simulation of Dynamic Communication Processes on the Base of Probability Time Automata},
booktitle={Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,},
year={2014},
pages={237-242},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005102702370242},
isbn={978-989-758-038-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Conference on Simulation and Modeling Methodologies, Technologies and Applications - Volume 1: SIMULTECH,
TI - Parallel Simulation of Dynamic Communication Processes on the Base of Probability Time Automata
SN - 978-989-758-038-3
AU - Piech H.
AU - Grodzki G.
AU - Ptak A.
PY - 2014
SP - 237
EP - 242
DO - 10.5220/0005102702370242