Extending symmetry reduction techniques to a realistic model of computation
From MaRDI portal
Publication:5178995
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 1744968 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Finding the smallest image of a set
- Fundamental algorithms for permutation groups
- The Number of Partitions of a Set
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(10)- Improving Discrete Model Representations via Symmetry Considerations
- Vector symmetry reduction
- scientific article; zbMATH DE number 1693448 (Why is no real title available?)
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 1744968 (Why is no real title available?)
- Formal Modeling and Analysis of Timed Systems
- On the constructive orbit problem
- An adaptive prefix-assignment technique for symmetry reduction
- Symmetry reduction in infinite games with finite branching
- Local symmetry and compositional verification
This page was built for publication: Extending symmetry reduction techniques to a realistic model of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178995)