Skip to main content
Conference Proceedings

Pragmatics annotated coloured petri nets for protocol software generation and verification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9930 LNCS 1-27
DOI: 10.1007/978-3-662-53401-4_1
4Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.
Get full text

Abstract

Pragmatics Annotated Coloured Petri Nets (PA-CPNs) are a restricted class of Coloured Petri Nets (CPNs) developed to support automated generation of protocol software. The practical application of PA-CPNs and the supporting PetriCode software tool have been discussed and evaluated in earlier papers already. The contribution of this paper is to give a formal definition of PA-CPNs, motivate the definitions, and demonstrate how the structure of PA-CPNs can be exploited for more efficient verification.

Cite

CITATION STYLE

APA

Simonsen, K. I. F., Kristensen, L. M., & Kindler, E. (2016). Pragmatics annotated coloured petri nets for protocol software generation and verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9930 LNCS, pp. 1–27). Springer Verlag. https://doi.org/10.1007/978-3-662-53401-4_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free