A reduced maximality labeled transition system generation for recursive Petri nets
| dc.contributor.author | Bouneb, Messaouda | |
| dc.contributor.author | Saidouni, Djamel Eddine | |
| dc.contributor.author | Ilie, Jean Michel | |
| dc.date.accessioned | 2022-04-27T03:33:49Z | |
| dc.date.available | 2022-04-27T03:33:49Z | |
| dc.date.issued | 2015 | |
| dc.description.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 reducedMLTS modulo a maximality bisimulation relation. The interest of the approach is shown using an example concerning the woodshop cutting system | ar |
| dc.identifier.uri | http://hdl.handle.net/123456789/12959 | |
| dc.language.iso | en | ar |
| dc.publisher | Elsevier | ar |
| dc.subject | Maximality labeled transition systems | ar |
| dc.subject | Maximality bisimulation | ar |
| dc.subject | Recursive Petri nets | ar |
| dc.title | A reduced maximality labeled transition system generation for recursive Petri nets | ar |
| dc.type | Article | ar |
Files
Original bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- A-reduced-maximality-labeled-transition-system.pdf
- Size:
- 1.33 MB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: