Trapping Mutual Exclusion in the Box Calculus

Abstract The box calculus is a process algebra with a simple Petri net semantics. We show that it provides for the concise translation of parallel programs and for the combination of verification techniques from process algebra and Petri nets. This is done by proving some properties of mutual exclusion algorithms.

[1]  Raymond R. Devillers.  Construction of S-invariants and S-components for Refined Petri Boxes , 1993, Application and Theory of Petri Nets.

[2]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[3]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[4]  Colin Stirling,et al.  Verifying Temporal Properties of Processes , 1990, CONCUR.

[5]  G. Boudol,et al.  Notes on Algebraic Calculi of Processes , 1989, Logics and Models of Concurrent Systems.

[6]  Glynn Winskel,et al.  Models for Concurrency , 1992 .

[7]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

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

[9]  Richard P. Hopkins,et al.  B(PN)2 - a Basic Petri Net Programming Notation , 1993, PARLE.

[10]  Manuel Silva Suárez,et al.  Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows , 1991, Applications and Theory of Petri Nets.

[11]  David Walker,et al.  CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus , 1989, Automatic Verification Methods for Finite State Systems.

[12]  Edsger W. Dijkstra,et al.  Solution of a problem in concurrent programming control , 1965, CACM.

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

[14]  Eike Best,et al.  Nonsequential Processes: A Petri Net View , 1988 .

[15]  Manuel Silva Suárez,et al.  A New Technique for Finding a Generating Family of Siphons, Traps and st-Components. Application to Colored Petri Nets , 1991, Applications and Theory of Petri Nets.

[16]  Abraham Silberschatz,et al.  Operating System Concepts , 1983 .

[17]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[18]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[19]  P. H. Starke.  Validation of Petri Net Models by ‘Petri-Net-Machine’ , 1986 .

[20]  Kamel Barkaoui,et al.  Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems , 1990, Discret. Appl. Math..

[21]  David Walker,et al.  Local Model Checking in the Modal mu-Calculus , 1991, Theor. Comput. Sci..

[22]  Glenn Bruns,et al.  A Practical Technique for Process Abstraction , 1993, CONCUR.

[23]  Donald E. Knuth,et al.  Additional comments on a problem in concurrent programming control , 1966, CACM.