ACM Computing Surveys (CSUR)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Formal verification of parallel programs
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Petri nets and speed independent design
Communications of the ACM
Comments on capabilities, limitations and “correctness” of Petri nets
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Limitations of Dijkstra's Semaphore Primitives and Petri nets
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
A Petri Net model of the CDC 6400
Proceedings of the SIGOPS workshop on System performance evaluation
COORDINATION OF ASYNCHRONOUS EVENTS
COORDINATION OF ASYNCHRONOUS EVENTS
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
Modelling of parallel-systems.
Modelling of parallel-systems.
Towards a theory for the analysis and synthesis of systems exhibiting concurrency.
Towards a theory for the analysis and synthesis of systems exhibiting concurrency.
On liveness and boundedness of asymmetric choice nets
Theoretical Computer Science
Property-preserving subnet reductions for designing manufacturing systems with shared resources
Theoretical Computer Science
A Model Driven Approach to the Analysis of Timeliness Properties
ECMDA-FA '09 Proceedings of the 5th European Conference on Model Driven Architecture - Foundations and Applications
Analysis of properties of petri synthesis net
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
Concurrent (hardware and software) systems can become extremely complex due to the existence of multiple loci of control. Posteriori analysis of such systems is very difficult. This paper presents a systematic bottom-up modular approach to synthesis. The synthesis procedure at each stage yields all invariants (of a certain kind) of the system. These invariants can be used as an aid to proving certain properties of the system such as boundedness, conservativeness, mutual exclusion, absence of deadlock, etc. The use of the synthesis rule and the utility of the invariants are illustrated by examples.