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

Abstract

We extend Lamport's partial-ordering models[10] for real-time computing and invent to use the concept of named transactions to reference groups of related events. We then propose Transaction Partial-Ordering Logic (TPOL) as a new specification language with special syntax and high-level semantics tailored to describe the interaction among transactions in a distributed real-time system. Finally we examine TPOL satisfiability problems with different restrictions.