ACM Transactions on Computer Systems (TOCS)
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Modeling of Concurrent Task Execution in a Distributed System for Real-Time Control
IEEE Transactions on Computers
Stochastic petri net simulation
WSC '89 Proceedings of the 21st conference on Winter simulation
Coloured Petri Nets: a high level language for system design and analysis
APN 90 Proceedings on Advances in Petri nets 1990
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Practical program verification: automatic program proving for real-time embedded software
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Principles of proving concurrent programs in Gypsy
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Generalized Stochastic Petri Nets Revisitied: Random Switches and Priorities
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
A reduction theory for coloured nets
Advances in Petri Nets 1989, covers the 9th European Workshop on Applications and Theory in Petri Nets-selected papers
Efficient Discrete-Event Simulation of Colored Petri Nets
IEEE Transactions on Software Engineering - Special issue: best papers of the sixth international workshop on Petri nets and performance models (PNPM'95)
A symbolic simulation mechanism for well-formed coloured Petri nets
ANSS '92 Proceedings of the 25th annual symposium on Simulation
IEEE Transactions on Parallel and Distributed Systems
Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Generalized Stochastic Petri Nets: A Definition at the Net Level and its Implications
IEEE Transactions on Software Engineering
Modular State Level Analysis of Distributed Systems Techniques and Tool Support
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Manual and Automatic Exploitation of Symmetries in SPN Models
ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets
Efficient simulation of SWN models
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Characterization of timed well-formed Petri nets behavior by means of occurrence equations
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
On the success of stochastic Petri nets
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Computing communication cost by Petri nets for hardware/software codesign
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
Automatic verification for a class of distributed systems
Distributed Computing
Study on parallel system performance modeling based on TCPN
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
| Hi-index | 0.01 |
A colored generalized stochastic Petri net (CGSPN) model was used to study the correctness and performance of the Lamport concurrent algorithm to solve the mutual exclusion problem on machines lacking an atomic test and set instruction. In particular, a parametric formal proof of liveness is developed based on the structure and initial state of the model. The performance evaluation is based on a Markovian analysis that exploits the symmetries of the model to reduce the cost of the numerical solution. Both kinds of analysis are supported by efficient algorithms. The potential of the GSPN modeling technique is illustrated on an academic but nontrivial example of an application from distributed systems.