Partial $\tau$-confluence for efficient state space generation

Authors:
S. C.C. Blom
Affiliations:
-
Venue:
Partial $\'tau$-confluence for efficient state space generation
Year:
2001

Citing 0
Cited 8

Computer assisted manipulation of algebraic process specifications

ACM SIGPLAN Notices
µCRL: A Toolset for Analysing Algebraic Specifications

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
State Space Reduction by Proving Confluence

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Compositional State Space Reduction Using Untangled Actions

Electronic Notes in Theoretical Computer Science (ENTCS)
Partial Order Reductions Using Compositional Confluence Detection

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Confluence reduction for probabilistic systems

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Sequential and distributed on-the-fly computation of weak tau-confluence

Science of Computer Programming
Confluence reduction for markov automata

FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We extend the theory of partial order methods with a new notion of $\tau$-confluence. Based on this new notion we define a reduced transition system, which is branching bisimilar to the original state space. We show that the new notion is preserved under various transformations. We present an algorithm which efficiently computes the reduced transition system from a symbolic representation.