Compositional State Space Reduction Using Untangled Actions

DOI10.1016/j.entcs.2006.10.052zbMath1277.68213OpenAlexW2128352233MaRDI QIDQ2866342

Marta Kwiatkowska, Xu Wang

Publication date: 13 December 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.10.052

zbMATH Keywords

determinismprocess algebracompositionalitypartial order reductionconflict-freedompartial confluenceuntangled action

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Rigorous development of component-based systems using component metadata and patterns

Uses Software

• FDR2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Confluence for process verification
• The weakest deadlock-preserving congruence
• More stubborn set methods for process algebras
• Confluence Thanks to Extensional Determinism
• Computer Aided Verification
• Partial-order reduction in symbolic state-space exploration
• Partial-order reduction in the weak modal mu-calculus

This page was built for publication: Compositional State Space Reduction Using Untangled Actions