Anzeige
Erschienen in:
2015 | OriginalPaper | Buchkapitel
Modelling of APGAS Programming Systems with Using of P/T Petri Process Nets
verfasst von : Ivo Martiník
Erschienen in: Computer Science and its Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Property-preserving Petri net process algebras (PPPA) were designed for the specification and verification of the Petri net processes. PPPA does not need to verify the composition of the Petri net processes because all their algebraic operators preserve the specified set of the properties. These original PPPA are generalized for the newly introduced class of the P/T Petri process nets (PPPN) in this article. The only one PLACE-SUBST algebraic operator is defined for the class of PPPN and its chosen properties are presented. The PPPN can be with the support of the PLACE-SUBST operator easily applied into the area of design, simulation and verification of multithreading programming systems executed in parallel or distributed environment. This fact is then demonstrated on the simple example based on the Asynchronous Partitioned Global Address Space (APGAS) programming model used in the High Performance (Cloud) Computing environment and implemented in the X10 programming language.