A temporal logic for real-time partial-ordering with named transactions
From MaRDI portal
Publication:5096355
Recommendations
Cites work
- A Graph-Theoretic Approach for Timing Analysis and its Implementation
- A really temporal logic
- A variant of a recursively unsolvable problem
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 43081 (Why is no real title available?)
- Time, clocks, and the ordering of events in a distributed system
Cited in
(2)
This page was built for publication: A temporal logic for real-time partial-ordering with named transactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096355)