Multiple Enabledness of Transitions in Petri Nets with Time

Authors:
Marc Boyer;Michel Diaz
Affiliations:
-;-
Venue:
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
Year:
2001

Citing 0
Cited 6

An Integrated Approach to Modeling and Analysis of Embedded Real-Time Systems Based on Timed Petri Nets

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets

Fundamenta Informaticae - PETRI NETS 2007
Comparison of the expressiveness of arc, place and transition time Petri nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets

Fundamenta Informaticae - PETRI NETS 2007
On multi-enabledness in time Petri nets

PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: This paper discusses and formalises the benefits of using multiple enabled transitions for extensions of Petri nets having quantitative notions of time. It also points out that what could be thought as a straightforward extension actually implies some subtle underlying semantic choices. As an example, a complete semantics for Merlin's time Petri nets is defined, based on the threshold notion.