Three partition refinement algorithms
SIAM Journal on Computing
Better verification through symmetry
Formal Methods in System Design - Special issue on symmetry in automatic verification
Formal Methods in System Design - Special issue on symmetry in automatic verification
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Measure-adaptive state-space construction
Performance Evaluation
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
Aggregation Methods for Large Markov Chains
Proceedings of the International Workshop on Computer Performance and Reliability
A Model Checking Method for Partially Symmetric Systems
FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Symbolic Reachability Graph and Partial Symmetries
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Towards reachability trees for high-level Petri nets
Proceedings of the European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers
Optimal state-space lumping in Markov chains
Information Processing Letters
On the use of exact lumpability in partially symmetricalWell-formed Nets
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Approximate Analysis of Stochastic Models by Self-Correcting Aggregation
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Efficient lumpability check in partially symmetric systems
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
The GreatSPN tool: recent enhancements
ACM SIGMETRICS Performance Evaluation Review
From partially to fully lumped Markov chains in stochastic well formed Petri nets
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Simple O(m log n) time Markov chain lumping
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Reduced base model construction methods for stochastic activity networks
IEEE Journal on Selected Areas in Communications
Efficient simulation of stochastic well-formed nets through symmetry exploitation
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
The performance and dependability evaluation of complex systems by means of dynamic stochastic models (e.g. Markov chains) may be impaired by the combinatorial explosion of their state space. Among the possible methods to cope with this problem, symmetry-based ones can be applied to systems including several similar components. Often however these systems are only partially symmetric: their behavior is in general symmetric except for some local situation when the similar components need to be differentiated. In this paper two methods to efficiently analyze partially symmetrical models are presented in a general setting and the requirements for their efficient implementation are discussed. Some case studies are presented to show the methods' effectiveness and their applicative interest.