Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the model checking problem for partial-order temporal logics. Solutions to this problem exist for partial order logics over local states. For the more general global logics that are interpreted over global states, only undecidability results have been proved. In this paper, we present a decision procedure for a partial order temporal logic over global states. We also sharpen the undecidability results by showing that a single until operator is sufficient for undecidability.
Bibliographical noteFunding Information:
The authors would like to thank Igor Walukiewicz for his important comments about the manuscript. This research was partially supported by NSF award CCR99-70925, SRC award 99-TJ-688, DARPA ITO Mobies award F33615-00-C-1707, Sloan Faculty Fellowship, and NSF CAREER award CCR97-34115.
- Model checking
- Partial order logics
- Temporal logics