State space reduction by proving confluence
From MaRDI portal
Recommendations
- State space reduction using partial -confluence
- Combining techniques to reduce state space and prove strong properties
- State space reduction for process algebra specifications
- State space reduction for process algebra specifications
- State space reduction using partial order techniques
- Trace spaces: an efficient new technique for state-space reduction
Cited in
(17)- Zero, successor and equality in BDDs
- A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
- A coalgebraic representation of reduction by cone of influence
- Compositional state space reduction using untangled actions
- Good to know about the efficiency of state space methods
- Trace spaces: an efficient new technique for state-space reduction
- Confluence Reduction for Probabilistic Systems
- State Space Reduction of Rewrite Theories Using Invisible Transitions
- State space reduction of linear processes using control flow reconstruction
- Sequential and distributed on-the-fly computation of weak tau-confluence
- State space reduction using partial -confluence
- Confluence reduction for Markov automata
- Combining techniques to reduce state space and prove strong properties
- State space reduction for process algebra specifications
- Equivalence checking 40 years after: a review of bisimulation tools
- A linear process-algebraic format with data for probabilistic automata
- Cones and foci: A mechanical framework for protocol verification
This page was built for publication: State space reduction by proving confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4806211)