Introduction to distributed algorithms
Introduction to distributed algorithms
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Exploiting symmetry in temporal logic model checking
Formal Methods in System Design - Special issue on symmetry in automatic verification
SMC: a symmetry-based model checker for verification of safety and liveness properties
ACM Transactions on Software Engineering and Methodology (TOSEM)
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
Protocol Verification as a Hardware Design Aid
ICCD '92 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Structural Symmetry and Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symmetry Reductions inModel Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Symmetry in temporal logic model checking
ACM Computing Surveys (CSUR)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding Symmetry in Models of Concurrent Systems by Static Channel Diagram Analysis
Electronic Notes in Theoretical Computer Science (ENTCS)
On the constructive orbit problem
Annals of Mathematics and Artificial Intelligence
Efficient approximate verification of B and Z models via symmetry markers
Annals of Mathematics and Artificial Intelligence
Ten years of analyzing actors: Rebeca experience
Formal modeling
| Hi-index | 0.01 |
We provide two examples of Promela models of concurrent, distributed systems, whose associated Kripke structures have more complex symmetry groups than those of models commonly cited in the literature. We present a tool, Spin-to-Grape, which allows the state-graph of a Promela model to be manipulated using the group-theoretic package Gap and its graph-theoretic add on, Grape. Through studying these examples we show a correspondence between the symmetry group of the channel diagram of a system and the symmetry group of the Kripke structure associated with the system. We then identify some general classes of systems and describe the symmetry groups of the associated models. Finally we discuss ways in which symmetry reduction techniques incorporated within Spin, e.g. the SymmSpin package, could be extended to exploit symmetry in such models.