Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Process algebra
Branching processes of Petri nets
Acta Informatica
Flow models of distributed computations: three equivalent semantics for CCS
Information and Computation
A technique of state space search based on unfolding
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
A Consistent Causality-Based View on a Timed Process AlgebraIncluding Urgent Interactions
Formal Methods in System Design - Special issue: industrial critical systems
Partial order models for quantitative extensions of LOTOS
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Model Checking Using Net Unfoldings
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Computing Reachability Properties Hidden in Finite Net Unfoldings
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Model Checking LTL Using Net Unforldings
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings
Proceedings of the 7th International Conference on Computer Aided Verification
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
Nets, Terms and Formulas (Cambridge Tracts in Theoretical Computer Science)
First Passage Time Analysis of Stochastic Process Algebra Using Partial Orders
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Unfolding of Products of Symmetrical Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
A false history of true concurrency: from Petri to tools
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
| Hi-index | 0.00 |
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.