On multi-enabledness in time Petri nets

Authors:
Hanifa Boucheneb;Didier Lime;Olivier H. Roux
Affiliations:
Department of Computer Engineering and Software Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada;IRCCyN, LUNAM Université, École Centrale de Nantes, Nantes, France;IRCCyN, LUNAM Université, École Centrale de Nantes, Nantes, France
Venue:
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Year:
2013

Citing 11
Cited 0

Time-based expressivity of timed Petri nets for system specification

Theoretical Computer Science
A causal semantics for time Petri nets

Theoretical Computer Science
Configuration Structures

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Multiple Enabledness of Transitions in Petri Nets with Time

PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets

Fundamenta Informaticae - PETRI NETS 2007
Weak Time Petri Nets Strike Back!

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Comparison of different semantics for time petri nets

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
POSET timing and its application to the synthesis and verification of gate-level timed circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
The expressive power of time Petri nets

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider time Petri nets with multiple-server semantics. We first prove that this setting is strictly more expressive, in terms of timed bisimulation, than its single-server counterpart. We then focus on two choices for the firing of multiple instances of the same transition: the more conservative safety-wise non deterministic choice, where all firable instances may fire in any order, and a simpler alternative, First Enabled First Fired (FEFF), where only the oldest instance may fire, obviously leading to a much more compact state-space. We prove that both semantics are not bisimilar but actually simulate each other with strong timed simulations, which in particular implies that they generate the same timed traces. FEFF is then very appropriate to deal with linear timed properties of time Petri nets.