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

DOI10.1016/J.SCICO.2008.07.001zbMath1170.68024OpenAlexW2150977952MaRDI QIDQ955710

Paolo Milazzo, Andrea Maggiolo-Schettini, Angelo Troina, Ruggero Lanotte

Publication date: 20 November 2008

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2008.07.001

zbMATH Keywords

model checkingcompensationshierarchical timed automatalong-running transactions

Mathematics Subject Classification ID

Database theory (68P15) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

Weak bisimulation for probabilistic timed automata ⋮ A survey of timed automata for the development of real-time systems

Uses Software

• Kronos
• Uppaal

This page was built for publication: Design and verification of long-running transactions in a timed framework