Summary: Undecidability of Partial Order Logics
Dept. of CIS,
Univeristy of Pensylvania,
Philadelphia, PA, 19104, USA
600 Mountain Ave.
Murray Hill, NJ 07974, USA
In this paper we prove the undecidability of certain temporal logics
over partial orders. The proof we use is generic and can be applied
to characterize various termpoal operators that cannot be used for
automatic verification (model checking). We propose that these results
partially explain why the partial order model of concurrency has not
gained as much popularity as the interleaving model.
The causal order or partial order semantics for concurrent systems [8, 13]
often challenges the frequently used interleaving or total order model. The
former model has the advantage that it does not assume a fictive order