Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Messaouda Bouneb"'
Publikováno v:
COMPUTING AND INFORMATICS; Vol 37, No 3 (2018): Computing and Informatics; 635-655
This paper is in the framework of the specification and verification of concurrent dynamic systems. For this purpose we propose the model of Refinable Recursive Petri Nets (RRPN) under a maximality semantics. In this model a notion of undefined trans
Publikováno v:
Formal Aspects of Computing. 27:951-973
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
Publikováno v:
ECMS
Proc. of the 27th European Conference On Modelling and Simulation (ECMS13)
The 27th European Conference On Modelling and Simulation (ECMS13)
The 27th European Conference On Modelling and Simulation (ECMS13), May 2013, Alesund, Norway. pp.544-550, ⟨10.7148/2013-0544⟩
Proc. of the 27th European Conference On Modelling and Simulation (ECMS13)
The 27th European Conference On Modelling and Simulation (ECMS13)
The 27th European Conference On Modelling and Simulation (ECMS13), May 2013, Alesund, Norway. pp.544-550, ⟨10.7148/2013-0544⟩
This paper is in the framework of the specification and the verification of concurrent dynamic systems. We are interested by recursive Petri net specification model for which we define a maximality semantics. The underlying semantic model is a maxima
Autor:
Djamel Eddine Saïdouni, Nabil Belala, Messaouda Bouneb, Lotfi Beji, Samir Otmane, Azgal Abichou
Publikováno v:
AIP Conference Proceedings.
The goal of this work is to exploit an implementable model, namely the maximality‐based labeled transition system, which permits to express true‐concurrency in a natural way without splitting actions on their start and end events. One can do this
Publikováno v:
Electronic Workshops in Computing.
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
Publikováno v:
International Journal of Agent Technologies & Systems; Apr-Jun2015, Vol. 7 Issue 2, p105-134, 30p