Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets

In this paper, we propose an operational semantics to build maximality-based labeled transition systems (MLTS) from Place/Transition Petri nets while performing aggregation of equivalent derivations of transitions according to maximality bisimulation relation. We show that generated MLTS are equivalent to MLTS generated without aggregation. As illustration, we apply results on a ticket reservation system.

Content

Author and article information

Contributors

Djamel Eddine Saïdouni

Nabil Belala

Messaouda Bouneb

Conference

Publication date: July 2008

Publication date (Print): July 2008

Pages: 1-11

Affiliations

[0001]Computer Science Dept., University of Mentouri, 25000 Constantine, Algeria

Article

DOI: 10.14236/ewic/VECOS2008.1

SO-VID: ab05bd31-58a0-43c2-a681-de7cc97c96de

Copyright © © Djamel Eddine Saïdouni et al. Published by BCS Learning and Development Ltd. Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008)

License:

This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

Conference name: Second International Workshop on Verification and Evaluation of Computer and Communication Systems (VECoS 2008)

Conference acronym: VECoS

Conference number:

Conference location: Leeds, UK

Conference date: 2 - 3 July 2008

Conference sponsor: Electronic Workshops in Computing (eWiC)

Conference theme: Verification and Evaluation of Computer and Communication Systems

History

Product

1477-9358 BCS Learning & Development

Self URI (article page): https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/VECOS2008.1

Self URI (journal page): https://ewic.bcs.org/

Studying business & IT? Drive your professional career forwards with BCS books - for a 20% discount click here: shop.bcs.org

Aggregation of Transitions in Marking Graph Generation Based on Maximality Semantics for Petri Nets

Abstract