Probability timed automata for investigating communication processes

DOI10.1515/amcs-2015-0031zbMath1322.68128OpenAlexW1469710624MaRDI QIDQ747506

Henryk Piech, Grzegorz Grodzki

Publication date: 16 October 2015

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/amcs-2015-0031

zbMATH Keywords

probabilistic timed automatacommunication securityprotocol logic

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60)

Uses Software

• PRISM
• SeVe

Cites Work

• Unnamed Item
• Compositional refinement in agent-based security protocols
• Computing knowledge in security protocols under convergent equational theories
• Distributed temporal logic for the analysis of security protocol models
• Weak bisimulation for probabilistic timed automata
• To know or not to know: Epistemic approaches to security protocol verification
• A proof of security of Yao's protocol for two-party computation
• SeVe: automatic tool for verification of security protocols
• A novel pairing-free certificateless authenticated key agreement protocol with provable security
• Automated verification of selected equivalences for security protocols
• A logic of authentication
• FSM Encoding for BDD Representations
• Formal Modeling and Analysis of Timed Systems

This page was built for publication: Probability timed automata for investigating communication processes