CONCUR ’94: Concurrency Theory

We develop decision procedures based on proof tableaux for a number of non-interleaving equivalences over processes. The processes considered are those which can be described in a simple extension of BPP, Basic Parallel Processes, obtained by omitting the restriction operator from CCS . Decision procedures are given for both strong and weak versions of causal bisimulation, location equivalence and ST-bisimulation.

[1]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

[2]  Michael J. Butler.  Refinement and Decomposition of Value-Passing Action Systems , 1993, CONCUR.

[3]  Moshe Y. Vardi.  Verification of Concurrent Programs: The Automata-Theoretic Framework , 1991, Ann. Pure Appl. Log..

[4]  Xinxin Liu.  Characterizing Bisimulation Congruence in the {calculus 2.2 Simultaneous Substitution Deenition 2.2 a Substitution Is a Function from N to N. We Use ; to Range over Substitutions, and Posttx Substitutions in Application. for a given Substitution , 1994 .

[5]  Richard D. Schlichting,et al.  Fail-stop processors: an approach to designing fault-tolerant computing systems , 1983, TOCS.

[6]  Rocco De Nicola,et al.  A Symbolic Semantics for the π-calculus , 1994 .

[7]  Zohar Manna,et al.  Adequate Proof Principles for Invariance and Liveness Properties of Concurrent Programs , 1984, Sci. Comput. Program..

[8]  Joseph Naor,et al.  Constructions of Permutation Arrays for Certain Scheduling Cost Measures , 1995, Random Struct. Algorithms.

[9]  Bengt Jonsson.  Simulations Between Specifications of Distributed Systems , 1991, CONCUR.

[10]  Pierre Collette,et al.  Application of the Composition Principle to Unity-like Specifications , 1993, TAPSOFT.

[11]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[12]  Willem P. de Roever,et al.  A Proof Rule for Fair Termination of Guarded Commands , 1985, Inf. Control..

[13]  Krishna V. Palem,et al.  Efficient program transformations for resilient parallel computation via randomization (preliminary version) , 1992, STOC '92.

[14]  Cliff B. Jones,et al.  Developing methods for computer programs including a notion of interference , 1981 .

[15]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[16]  Ivan Christoff,et al.  Testing Equivalences and Fully Abstract Models for Probabilistic Processes , 1990, CONCUR.

[17]  Orna Grumberg,et al.  Abstract interpretation of reactive systems : abstractions preserving .. , 1994 .

[18]  Miroslaw Malek,et al.  Fault-Tolerant Semiconductor Memories , 1984, Computer.

[19]  Colin Stirling,et al.  Modal and Temporal Logics for Processes , 1996, Banff Higher Order Workshop.

[20]  Nissim Francez,et al.  Infinite Trees, Markings and Well Foundedness , 1986, CAAP.

[21]  Pierre Collette.  An Explanatory Presentation of Composition Rules for Assumption-Commitment Specifications , 1994, Inf. Process. Lett..

[22]  Wojciech Penczek,et al.  Propositional Temporal Logics and Equivalences , 1992, CONCUR.

[23]  Mordechai Ben-Ari,et al.  Principles of concurrent and distributed programming , 2005, PHI Series in computer science.

[24]  Cliff B. Jones,et al.  Tentative steps toward a development method for interfering programs , 1983, TOPL.

[25]  A. Prasad Sistla,et al.  On Verifying that a Concurrent Program Satisfies a Nondeterministic Specification , 1989, Inf. Process. Lett..

[26]  Matthew Hennessy,et al.  The Power of the Future Perfect in Program Logics , 1985, Inf. Control..

[27]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

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

[29]  Jan A. Bergstra,et al.  Process Algebra with a Zero Object , 1990, CONCUR.

[30]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[31]  Howard Barringer,et al.  Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework , 1984, Seminar on Concurrency.

[32]  Alexander A. Shvartsman,et al.  Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms , 1995, Nord. J. Comput..

[33]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[34]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[35]  Franz Pichler,et al.  Computer Aided Systems Theory — EUROCAST '93 , 1993, Lecture Notes in Computer Science.

[36]  S. M. Brien,et al.  A Time-Interval Calculus , 1992, MPC.

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

[38]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[39]  Davide Sangiorgi,et al.  Algebraic Theories for Name-Passing Calculi , 1993, Inf. Comput..

[40]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[41]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

[42]  Ernst-Rüdiger Olderog,et al.  Nets, terms and formulas , 1991 .

[43]  Michael R. Hansen,et al.  Semantics and Completeness of Duration Calculus , 1991, REX Workshop.

[44]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[45]  R. J. vanGlabbeek.  Bounded nondeterminism and the approximation induction principle in process algebra , 1987 .

[46]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[47]  Zohar Manna,et al.  A Hardware Semantics Based on Temporal Intervals , 1983, ICALP.

[48]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[49]  Jan Friso Groote,et al.  Transition System Specifications with Negative Premises , 1993, Theor. Comput. Sci..

[50]  Ernst-Rüdiger Olderog,et al.  Proof Rules and Transformations Dealing with Fairness , 1983, Sci. Comput. Program..

[51]  Albert R. Meyer,et al.  Bisimulation can't be traced , 1988, POPL '88.

[52]  Sergios Theodoridis,et al.  PARLE'94 Parallel Architectures and Languages Europe , 1994, Lecture Notes in Computer Science.

[53]  Nils Klarlund,et al.  Liminf Progress Measures , 1991, MFPS.

[54]  Naomi Nishimura,et al.  Asynchronous shared memory parallel computation , 1990, SPAA '90.

[55]  Alexander A. Shvartsman.  Achieving Optimal CRCW PRAM Fault-Tolerance , 1991, Inf. Process. Lett..

[56]  Jon Mauney,et al.  Formal specification and simulation of instruction-level parallelism , 1994, EURO-DAC '94.

[57]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[58]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[59]  Moti Yung,et al.  Time-optimal message-efficient work performance in the presence of faults , 1994, PODC '94.

[60]  Ugo Montanari,et al.  Dynamic congruence vs. progressing bisimulation for CCS , 1992, Fundam. Informaticae.

[61]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[62]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[63]  W-P de Roever,et al.  The quest for compositionality - a survey of assertion - based proof systems for concurrent programs. Part 1 ; concurrency based on shared variables , 1985 .

[64]  Fred B. Schneider,et al.  Proving Nondeterministically Specified Safety Properties Using Progress Measures , 1993, Inf. Comput..

[65]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[66]  Chris Verhoef,et al.  A General Conservative Extension Theorem in Process Algebra , 1994, PROCOMET.

[67]  Robin Milner,et al.  Modal Logics for Mobile Processes , 1991, CONCUR.

[68]  Michael R. Hansen,et al.  A Real-Time Duration Semantics for Circuits , 1992 .

[69]  Paul G. Spirakis,et al.  Efficient robust parallel computations , 2018, STOC '90.

[70]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[71]  Jørgen Staunstrup.  Specification and Verification of Concurrent Programs , 1979 .

[72]  N. Klarlund.  Progress measures, immediate determinacy, and a subset construction for tree automata , 1992 .

[73]  A. Cau,et al.  Parallel composition of assumption-commitment specifications a unifying approach for shared variable and distributed message passing concurrency , 1995 .

[74]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[75]  Kaisa Sere,et al.  Superposition Refinement of Parallel Algorithms , 1991, FORTE.

[76]  Gian Luigi Ferrari,et al.  A Pi-Calculus with Explicit Substitutions: the Late Semantics , 1994, MFCS.

[77]  Nils Klarlund,et al.  Rabin measures and their applications to fairness and automata theory , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

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

[79]  Alexander A. Shvartsman.  An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory , 1992, Inf. Process. Lett..

[80]  Alban Ponse,et al.  Process expressions and Hoare's logic , 1989 .

[81]  Z. M. Kedem,et al.  Combining tentative and definite executions for dependable parallel computing , 1990 .

[82]  Â. È Ê Â Â Û Û Ò Ç ^ R R Ó Ae — Ú Ú Ë Ë Â Ê Ì È Â Ê Â.  Verifying Temporal Properties without Temporal Logic , 1988 .

[83]  R. Subramonian,et al.  Asynchronous PRAMs are (almost) as good as synchronous PRAMs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[84]  Davide Sangiorgi,et al.  A Theory of Bisimulation for the pi-Calculus , 1993, CONCUR.

[85]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[86]  Jan Friso Groote,et al.  Proof Theory for µCRL: A Language for Processes with Data , 1993, Semantics of Specification Languages.

[87]  Colin Stirling,et al.  A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language , 1988, Theor. Comput. Sci..

[88]  Glynn Winskel,et al.  Petri Nets and Bisimulations , 1994 .

[89]  Martín Abadi,et al.  Conjoining specifications , 1995, TOPL.

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

[91]  A. Steven Klusener.  Completeness in Real Time Process Algebra , 1991, CONCUR.

[92]  Leslie Lamport,et al.  The temporal logic of actions , 1994, TOPL.