Decision procedures for time and chance

Decision procedures are provided for checking the satisfiability of a formula in each of the three systems TCg. TCb and TCf defined in [LS]. The procedures for TCg and TCf run in non-deterministic time 22on where n is the size of the formula and c is a constant. The procedure for TCb runs in non-deterministic time 22on2. A deterministic exponential lower bound is proved for the three systems. All three systems are also shown to be PSPACE-hard using results of [SC]. Those decision procedures are not as efficient as the deterministic (one or two)- exponential time procedures proposed in [BMP] and [EH1] for different logics of branching time that are weaker than ours in expressive power. No elementary decision procedure is known for a logic of branching time that is as expressive as ours. The decision procedures of the probabilistic logics of [HS] run in deterministic exponential time but their language is essentially less expressive than ours.

[1]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[2]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[3]  Mordechai Ben-Ari,et al.  The Temporal Logic of Branching Time , 1981, POPL.

[4]  Amir Pnueli,et al.  Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract) , 1983, ICALP.

[5]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[6]  A. Pnueli.  The Temporal Semantics of Concurrent Programs , 1979, Theor. Comput. Sci..

[7]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[8]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[9]  Karl R. Abrahamson.  Decidability and expressiveness of logics of processes , 1980 .

[10]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[11]  Mordechai Ben-Ari,et al.  The temporal logic of branching time , 1981, POPL '81.

[12]  Daniel Lehmann,et al.  On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem , 1981, POPL '81.

[13]  Leslie Lamport,et al.  "Sometime" is sometimes "not never": on the temporal logic of programs , 1980, POPL '80.

[14]  Amir Pnueli,et al.  Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System , 1984, Theor. Comput. Sci..

[15]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[16]  Saharon Shelah,et al.  Reasoning with Time and Chance (Extended Abstract) , 1983, ICALP.

[17]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[18]  Michael O. Rabin,et al.  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..