A temporal logic for real-time partial ordering with named transactions
From MaRDI portal
Publication:1391307
DOI10.1016/S0304-3975(96)00270-8zbMATH Open0912.68195OpenAlexW2098573901MaRDI QIDQ1391307FDOQ1391307
Authors: Farn Wang
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00270-8
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A variant of a recursively unsolvable problem
- Title not available (Why is that?)
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- A Machine-Oriented Logic Based on the Resolution Principle
- Title not available (Why is that?)
- Time, clocks, and the ordering of events in a distributed system
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Graph-Theoretic Approach for Timing Analysis and its Implementation
- Title not available (Why is that?)
Cited In (2)
Uses Software
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 Q1391307)