A temporal logic for real-time partial ordering with named transactions

DOI10.1016/S0304-3975(96)00270-8zbMath0912.68195OpenAlexW2098573901MaRDI QIDQ1391307

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

zbMATH Keywords

named transactionstransaction partial ordering logic

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Uses Software

• NQTHM
• Z
• Modechart

Cites Work

• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Time, clocks, and the ordering of events in a distributed system
• A Graph-Theoretic Approach for Timing Analysis and its Implementation
• A Machine-Oriented Logic Based on the Resolution Principle
• A variant of a recursively unsolvable problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A temporal logic for real-time partial ordering with named transactions