ACM Transactions on Computer Systems (TOCS)
Modeling the software architecture of a prototype parallel machine
SIGMETRICS '87 Proceedings of the 1987 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Stochastic High-Level Petri Nets and Applications
IEEE Transactions on Computers
A symbolic reachability graph for coloured Petri nets
Theoretical Computer Science
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
International Workshop on Timed Petri Nets
On Stochastic High-Level Petri Nets
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Colored GSPN Models and Automatic Symmetry Detection
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Aggregation of States in Colored Stochastic Petri Nets: Application to a Multiprocessor Architecture
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Symbolic Reachability Graph and Partial Symmetries
Proceedings of the 16th International Conference on Application and Theory of Petri Nets
Modeling Symmetric Computer Architectures by SWNs
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Modeling Bus Contention and Memory Interference in a Multiprocessor System
IEEE Transactions on Computers
Integrating Low Level Symmetries into Reachability Analysis
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
| Hi-index | 0.00 |
The exploitation of symmetries for the reachability analysis of SPNs was recognized as a necessary step to handle reasonably complex models right from the beginning. Initially this step was performed manually by the modeler, and required a great deal of experience and ingenuity. Subsequently, the research has focused on techniques to automate such symmetries exploitation to simplify the modeler's task and still allow the solution of reasonably complex models. We recall some of the steps of this evolution, that has now simplified the definition of efficiently solvable models. We also attempt to devise some future perspectives to work on.