Formal timing analysis of distributed systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4089533 (Why is no real title available?)
- scientific article; zbMATH DE number 4108727 (Why is no real title available?)
- scientific article; zbMATH DE number 4128370 (Why is no real title available?)
- A multiprocess network logic with temporal and spatial modalities
- Interleaving set temporal logic
- Knowledge and common knowledge in a distributed environment
- The temporal logic of branching time
- Time, clocks, and the ordering of events in a distributed system
- “Sometimes” and “not never” revisited
Cited in
(10)- Pervasive verification of distributed real-time systems
- scientific article; zbMATH DE number 3868587 (Why is no real title available?)
- A temporal logic for real-time partial-ordering with named transactions
- Quantitative program logic and expected time bounds in probabilistic distributed algorithms.
- scientific article; zbMATH DE number 1857641 (Why is no real title available?)
- Semantic models of a timed distributed dataspace architecture
- Algebraic Reasoning About Timeliness
- Aneris: a mechanised logic for modular reasoning about distributed systems
- TTL : a formalism to describe local and global properties of distributed systems
- A graphical proof theory of logical time
This page was built for publication: Formal timing analysis of distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1193762)