scientific article; zbMATH DE number 6831517

DOI10.13328/J.CNKI.JOS.005191zbMATH Open1389.68053MaRDI QIDQ3132071FDOQ3132071

Authors Qizhe Yang, Guoqiang Li

Publication date 29 January 2018

zbMATH Keywords

program verificationcoverability\(k\)-shapeasynchronous communication programcommunication Petri net

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Asynchronous communication of Petri nets and the refinement of transitions
• Verification of asynchronous circuits by BDD-based model checking of Petri nets
• scientific article; zbMATH DE number 1437515
• scientific article; zbMATH DE number 4172388
• Synchronous and asynchronous communications in composable parametrized high-level Petri nets
• A verifiable low-level concurrent programming model based on colored Petri nets
• Modeling and verification of the SDL-specified communication protocols using high-level Petri nets
• Specification of asynchronous component systems with modal I/O-Petri nets
• Refinement and asynchronous composition of modal Petri nets

Cited in

(4)

• Efficient implementation of coverability verification on communication-free Petri net
• A verifiable low-level concurrent programming model based on colored Petri nets
• Safety verification of asynchronous pushdown systems with shaped stacks
• On the completeness of verifying message passing programs under bounded asynchrony

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132071)