Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
DOI10.1007/11768869_10zbMATH Open1461.68136OpenAlexW1855675516MaRDI QIDQ4989486FDOQ4989486
Authors: Ruggero Lanotte, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina
Publication date: 25 May 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11768869_10
Recommendations
- Design and verification of long-running transactions in a timed framework
- A timed model for communicating sequential processes
- scientific article; zbMATH DE number 3956423
- Hierarchical timed high level nets and their branching processes
- A model of reconfiguration in communicating sequential processes with a notion of transactions
- scientific article; zbMATH DE number 4011913
- Modeling Timed Concurrent Systems
- A model for concurrency in nested transactions systems
- Towards integrated verification of timed transition models
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (4)
This page was built for publication: Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4989486)