The weakest deadlock-preserving congruence
Information Processing Letters
Stubborn set methods for process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Partial order reduction: linear and branching temporal logics and process algebras
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Confluence for Process Verification
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Partial-Order Reduction in the Weak Modal Mu-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Partial-Order Reduction in Symbolic State Space Exploration
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Trace Theoretic Verification of Asynchronous Circuits Using Unfoldings
Proceedings of the 7th International Conference on Computer Aided Verification
Partial $\tau$-confluence for efficient state space generation
Partial $\'tau$-confluence for efficient state space generation
Trace theory for automatic hierarchical verification of speed-independent circuits
Trace theory for automatic hierarchical verification of speed-independent circuits
On process-algebraic verification of asynchronous circuits
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
On Process-algebraic Verification of Asynchronous Circuits
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
An Improvement of Software Architecture Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Analysis of the Petri net model of parallel manufacturing processes with shared resources
Information Sciences: an International Journal
On Process-algebraic Verification of Asynchronous Circuits
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a failure-based equivalence which preserves divergences) that determines their sets of ''conflict-free'' actions, called untangled actions. Untangled actions are compositional, i.e. synchronisation on untangled actions will not destroy their ''conflict-freedom''. For networks of processes, using global untangled actions derived from local ones, efficient reduction algorithms have been devised for systems with a large number of small processes running in parallel.