Design of Grid Structures on the Basis of Transition Systems with the Substantiation of the Correctness of Their Operation

Kryvyi, S. L.; Boyko, Y.V.; Pogorilyy, S. D.; Boretskyi, Oleksandr; Glybovets, Mykola

doi:10.1007/s10559-017-9911-0

Cited by 10 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…7. It is described in [10], [11] that the TS product semantics and the semantics of the corresponding PN are consistent in the sense that a sequence of global transitions represents the global history of the TS product A if and only if it is an admissible sequence of transitions in the PN. Accordingly, elements of the set R become transitions of the PN, and the global states of the TS product (the set of states of each TS involved in the synchronous product before or after the global transition) become the places of the received network.…”

Section: Abstractionmentioning

confidence: 99%

Method of semantic application verification in GPGPU technology

Kryvyi¹,

Pogorilyy²,

Slynko³

et al. 2020

SRIT

View full text Add to dashboard Cite

An application development and verification method for massively parallel systems using NVIDIA GPUs is proposed. The method allows creating models at different levels of abstraction using the apparatus of marked transition systems. The compositions (product) of such systems are transformed into a Petri net, which are then analyzed by appropriate means. The proposed method allows specifying model properties by temporal logic formulas. This allows studying the properties of massively parallel systems which is almost impossible to analyze manually, since the number of execution threads in the latest NVIDIA video adapter architectures (Pascal, Volta, Turing, Ampere) is measured in hundreds of thousands or millions.

show abstract

Section: Abstractionmentioning

confidence: 99%