Loïc Hélouët ; Pranay Agrawal - Waiting Nets: State Classes and Taxonomy

fi:10342 - Fundamenta Informaticae, February 12, 2024, Volume 190, issues 2-4: Petri Nets 2022
Waiting Nets: State Classes and TaxonomyArticle

Authors: Loïc Hélouët ; Pranay Agrawal

    In time Petri nets (TPNs), time and control are tightly connected: time measurement for a transition starts only when all resources needed to fire it are available. Further, upper bounds on duration of enabledness can force transitions to fire (this is called urgency). For many systems, one wants to decouple control and time, i.e. start measuring time as soon as a part of the preset of a transition is filled, and fire it after some delay \underline{and} when all needed resources are available. This paper considers an extension of TPN called waiting nets that dissociates time measurement and control. Their semantics allows time measurement to start with incomplete presets, and can ignore urgency when upper bounds of intervals are reached but all resources needed to fire are not yet available. Firing of a transition is then allowed as soon as missing resources are available. It is known that extending bounded TPNs with stopwatches leads to undecidability. Our extension is weaker, and we show how to compute a finite state class graph for bounded waiting nets, yielding decidability of reachability and coverability. We then compare expressiveness of waiting nets with that of other models w.r.t. timed language equivalence, and show that they are strictly more expressive than TPNs.

    Volume: Volume 190, issues 2-4: Petri Nets 2022
    Published on: February 12, 2024
    Accepted on: December 27, 2023
    Submitted on: November 22, 2022
    Keywords: Computer Science - Formal Languages and Automata Theory

    Consultation statistics

    This page has been seen 61 times.
    This article's PDF has been downloaded 30 times.