Security in a model for long-running transactions

MaRDI QIDQ5506367zbMATH OpenFDO

Authors Damas Gruska, Andrea Maggiolo-Schettini, Paolo Milazzo

Publication date 28 January 2009

zbMATH Keywords

communicating hierarchical transaction-based timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cryptography (94A60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
• Design and verification of long-running transactions in a timed framework
• Communicating Sequential Processes. The First 25 Years
• A calculus for long-running transactions.
• Process opacity for timed process algebra

Cited in

(1)

• Design and verification of long-running transactions in a timed framework

This page was built for publication: Security in a model for long-running transactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506367)