Deciding global partial-order properties
Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between events. Recently, the use of partial order semantics that allows independent events of concurrent processes to be unordered is becoming popular. Temporal logics that are interpreted over partial orders allow specifications relating global snapshots, and permit reduction algorithms to generate only one representative linearization of every possible partial-order execution during state-space search. This paper considers the satisfiability and the model checking problems for temporal logics interpreted over partially ordered sets of global configurations. For such logics, only undecidability results have been proved previously. In this paper, we present an Expspace decision procedure for a fragment that contains an eventuality operator and its dual. We also sharpen previous undecidability results, which used global predicates over configurations. We show that although our logic allows only local propositions (over events), it becomes undecidable when adding some natural until operator.
KeywordsPartial Order Model Check Temporal Logic Causal Structure Atomic Proposition
Unable to display preview. Download preview PDF.
- 1.R. Alur, W. Penczek, and D. Peled. Model-checking of causality properties. 10th Symposium on Logic in Computer Science, 90–100, 1995.Google Scholar
- 3.W. Ebinger. Logical definability of trace languages. In V. Diekert, G. Rozenberg (Eds.) The Book of Traces, World Scientific, 382–390, 1995.Google Scholar
- 4.J. Esparza. Model checking using net unfolding. Science of Computer Programming 23, 1994.Google Scholar
- 6.S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science 75, 21–43, 1992.Google Scholar
- 8.A. Mazurkiewicz. Trace Theory. In W. Brauer, W. Reisig, G. Rozenberg (eds.), Advances in Petri Nets 1986, LNCS 255, 279–324, 1987.Google Scholar
- 9.K.L. McMillan. Using unfoldings to avoid the state explosion problem in the verification of asynchronous circuits. Fourth CAV, LNCS 663, 164–177, 1992.Google Scholar
- 10.D. Peled. Combining partial order reductions with on-the-fly model checking. Sixth Conferenceon Computer Aided Verification, LNCS 818, 377–390, 1994.Google Scholar
- 13.P.S. Thiagarajan. A trace based extension of linear time temporal logic. Ninth Symposium on Logic in Computer Science, 1994.Google Scholar
- 14.P.S. Thiagarajan and I. Walukiewicz. An expressively complete linear time temporal logic for Mazurkiewicz traces. 12th Symposium on Logic in Computer Science, 1997.Google Scholar
- 15.A. Valmari. A Stubborn attack on state explosion. Proc. 2nd Conference on Computer-Aided Verification, LNCS 531, 156–165, 1990.Google Scholar
- 16.M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. First Symposium on Logic in Computer Science, 332–344, 1986.Google Scholar
- 17.I. Walukiewicz. Difficult configurations — on the complexity of LTrL. 25th International Colloquium on Automata, Languages, and Programming, 1998.Google Scholar