TOWARDS Z SPECIFICATION OF PLACE TRANSITION NETS
DOI:
https://doi.org/10.21015/vtse.v6i2.328Abstract
Petri net formalism has dynamics and it is well suited for distributed or concurrent systems. However, it has a graphical representation in the form of a bipartite graph through which the type of data cannot be identified. This paper presents the Z specification of the net structure of place transition nets to provide the data semantics of graphical structure. This paper further addresses the Z specification of special sub classes of Petri nets, which include state machine, marked graphs and free choice nets.
Downloads
Published
2015-05-15
How to Cite
Ahmad, Z., Ahmad, F., & Naseer, M. (2015). TOWARDS Z SPECIFICATION OF PLACE TRANSITION NETS. VFAST Transactions on Software Engineering, 3(1), 13–17. https://doi.org/10.21015/vtse.v6i2.328
Issue
Section
Articles
License
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC-By) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
This work is licensed under a Creative Commons Attribution License CC BY