A reduced maximality labeled transition system generation for recursive Petri nets-Reference-Cited by-同舟云学术

A reduced maximality labeled transition system generation for recursive Petri nets

Published:2015-11 Issue:5-6 Volume:27 Page:951-973
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Bouneb Messaouda¹²,Saidouni Djamel Eddine²,Ilie Jean Michel³

Affiliation:

1. Department of Mathematics and Computer Sciences, El Arbi ben Mhidi University, Oum el bouaghi, Algeria

2. MISC Laboratory, Department of Fundamental Informatics and its Applications, University Constantine 2, Abdelhamid Mehri, Constantine, Algeria

3. Department of Computer Sciences, Pierre and Marie Curie University, Paris, France

Abstract

Abstract In Saidouni et al. (Maximality semantic for recursive Petri net. Europeen conference on modelling and simulation (ECMS’13) pp 544–550, 2013 ) a maximality operational semantics has been defined for the recursive Petri net model. This operational semantics generates a true concurrency structure named maximality-based labeled transition systems (MLTS). This paper proposes an approach that generates an on-the-fly reduced MLTS modulo a maximality bisimulation relation. The interest of the approach is shown using an example concerning the woodshop cutting system.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-015-0341-3.pdf

Reference33 articles.

1. Aceto L Hennessy M (1991) Adding action refinement to finite process algebra. In: Albert JL Monien B Artalejo MR (eds) ICALP91 LNCS vol 510. Springer pp 506–519

2. Andrews D Groote J Middelburg C (eds) (1993) Workshop on Semantics of Specification Languages (SoSL93) Workshops in Computing Springer-Verlag Utrecht pp 289-303

3. Arnold A (1992) Systme de transition finis et smantique des processus communicants. Masson Paris

4. Benamira A Saidouni DE (2013) Maximality-based labeled transition systems normal form modeling approaches and algorithms for advanced computer applications studies in computational intelligence. 488:337–346

5. Concurrent bisimulations in Petri nets

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Reducing the number of migrated instances during business process change: A graph rewriting approach;Journal of King Saud University - Computer and Information Sciences;2022-10

2. A symbolic model checking approach in formal verification of distributed systems;Human-centric Computing and Information Sciences;2019-01-28

3. A Locally Sequential Globally Asynchronous Net from Maximality-Based Labelled Transition System;Modelling and Implementation of Complex Systems;2016