A Complete Finite Prefix for Process Algebra

In this paper we show how to use McMillan's complete finite prefix approach for process algebra. We present the model of component event structures as a semantics for process algebra, and show how to construct a complete finite prefix for this model. We present a simple adequate order (using an order on process algebra expressions) as an optimization to McMillan's original algorithm.

[1]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[2]  Glynn Winskel,et al.  An Introduction to Event Structures , 1989 .

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

[4]  Burkhard Graves.  Computing Reachability Properties Hidden in Finite Net Unfoldings , 1997, FSTTCS.

[5]  Diego Latella,et al.  Partial Order Models for Quantitative Extensions of LOTOS , 1998, Comput. Networks.

[6]  Frank Wallner,et al.  Model Checking LTL Using Net Unforldings , 1998, CAV.

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

[8]  Diego Latella,et al.  A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions , 1996, Formal Methods Syst. Des..

[9]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[10]  Javier Esparza.  Model Checking Using Net Unfoldings , 1994, Sci. Comput. Program..

[11]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..

[12]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[13]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

[14]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

[15]  Ilaria Castellani,et al.  Flow Models of Distributed Computations: Three Equivalent Semantics for CCS , 1994, Inf. Comput..

[16]  Kenneth L. McMillan,et al.  Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings , 1995, CAV.