Global and Local Views of State Fairness

Abstract In this paper, we compare global and local versions of state fairness for systems of concurrent programs and Petri nets. We then investigate complexity and decidability issues for the fair nontermination problem. It turns out that for systems of concurrent Boolean programs and 1-bounded Petri nets, the problem is PSPACE-complete with respect to global state fairness, but EXPTIME-complete with respect to local state fairness. For general systems of concurrent programs, both the globally and locally state fair nontermination problems are undecidable. (In fact, they are Π 1 -complete and Σ|-complete, respectively. 1 ) On the other hand, the problem is decidable for general Petri nets with respect to global state fairness, and undecidable (Σ 1 -complete) with respect to local state fairness.

[1]  A. Prasad Sistla,et al.  Reasoning with Many Processes , 1987, LICS.

[2]  Richard E. Ladner,et al.  The Complexity of Problems in Systems of Communicating Sequential Processes , 1980, J. Comput. Syst. Sci..

[3]  Amir Pnueli,et al.  On the extremely fair treatment of probabilistic algorithms , 1983, STOC.

[4]  Michael O. Rabin.  N-Process Synchronization by 4 log _2 N-Valued Shared Variables , 1980, FOCS.

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

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Heino Carstensen,et al.  Decidability Questions for Fairness in Petri Nets , 1987, STACS.

[8]  Micha Sharir,et al.  Termination of Probabilistic Concurrent Program , 1983, TOPL.

[9]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[10]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[11]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[12]  Amir Pnueli,et al.  Impartiality, Justice and Fairness: The Ethics of Concurrent Termination , 1981, ICALP.

[13]  Rodney R. Howell,et al.  Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets , 1989, Theor. Comput. Sci..

[14]  Ashok K. Chandra,et al.  Computable nondeterministic functions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[15]  Charles Rackoff,et al.  The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

[16]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[17]  John H. Reif,et al.  Universal games of incomplete information , 1979, STOC.

[18]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[19]  Gregor von Bochmann,et al.  Formal Methods in Communication Protocol Design , 1980, IEEE Trans. Commun..

[20]  Hsu-Chun Yen,et al.  On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs , 1988, Theor. Comput. Sci..

[21]  Scott A. Smolka,et al.  On the Analysis of Cooperation and Antagonism in Networks of Communicating Processes , 1985, PODC.

[22]  Eike Best,et al.  Fairness and Conspiracies , 1984, Inf. Process. Lett..

[23]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[24]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[25]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[26]  Zohar Manna,et al.  How to cook a temporal proof system for your pet language , 1983, POPL '83.

[27]  Neil D. Jones,et al.  Complexity of Some Problems in Petri Nets , 1977, Theor. Comput. Sci..

[28]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[29]  Rüdiger Valk,et al.  Infinite behaviour and fairness in Petri nets , 1985, European Workshop on Applications and Theory in Petri Nets.

[30]  Mohamed G. Gouda,et al.  Proving liveness for networks of communicating finite state machines , 1986, TOPL.