Name
Abstract | ||
|---|---|---|
We present an automatic approach to detecting symmetry relations for general concurrent models. Despite the success of symmetry reduction in mitigating state explosion problem, one essential step towards its soundness and effectiveness, i.e., how to discover sufficient symmetries with least human efforts, is often either overlooked or oversimplified. In this work, we show how a concurrent model can be viewed as a constraint satisfaction problem (CSP), and present an algorithm capable of detecting symmetries arising from the CSP which induce automorphisms of the model. To the best of our knowledge, our method is the first approach that can automatically detect both process and data symmetries as demonstrated via a number of systems.
|
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ASE.2013.6693062 | ASE |
Keywords | Field | DocType |
constraint satisfaction problems | Constraint satisfaction,Local consistency,Computer science,Constraint graph,Theoretical computer science,Constraint satisfaction problem,Concurrent constraint logic programming,Constraint satisfaction dual problem,Backtracking,Constraint logic programming | Conference |
ISSN | ISBN | Citations |
1527-1366 | 978-1-4799-0215-6 | 0 |
PageRank | References | Authors |
0.34 | 0 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shao Jie Zhang | 1 | 56 | 4.71 |
| Jun Sun | 2 | 1407 | 120.35 |
| Chengnian Sun | 3 | 749 | 22.97 |
| Yang Liu | 4 | 2194 | 188.81 |
| Junwei Ma | 5 | 1 | 1.04 |
| Jin Song Dong | 6 | 120 | 9.88 |