Soundness of Timed-Arc Workflow Nets

Mateo, José Antonio; Srba, Jǐŕı; Sørensen, Mathias Grund

doi:10.1007/978-3-319-07734-5_4

Cited by 4 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We obtain decidability for systems with (restricted) urgency and unbounded places. As far as we know, in all earlier results and in particular in [19,21,24,4,8], decidability is ensured only when urgency is completely disallowed, or places are all bounded. Further, our framework is powerful enough to capture systems of timed finite state machines communicating through bag channels [12,13], with urgency, throughput and latency characteristics of channels, and still yields decidability results.…”

Section: Introductionmentioning

confidence: 83%

See 1 more Smart Citation

Decidable Classes of Unbounded Petri Nets with Time and Urgency

Akshay¹,

Genest²,

Hélouët³

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

Abstract. Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability problems at the cost of disallowing urgency (the ability to enforce actions within a time delay). Our goal is to investigate decidable classes of Petri nets with time that capture some urgency and still allow unbounded behaviors, which go beyond finite state systems. We present, up to our knowledge, the first decidability results on reachability and boundedness for Petri net variants that combine unbounded places, time, and urgency. For this, we introduce the class of Timed-Arc Petri nets with restricted Urgency, where urgency can be used only on transitions consuming tokens from bounded places. We show that control-state reachability and boundedness are decidable for this new class, by extending results from Timed-Arc Petri nets (without urgency) [2]. Our main result concerns (marking) reachability, which is undecidable for both TPNs (because of unrestricted urgency) [20] and Timed-Arc Petri Nets (because of infinite number of "clocks") [25]. We obtain decidability of reachability for unbounded TPNs with restricted urgency under a new, yet natural, timed-arc semantics presenting them as Timed-Arc Petri Nets with restricted urgency. Decidability of reachability under the intermediate marking semantics is also obtained for a restricted subclass.

show abstract

Section: Introductionmentioning

confidence: 83%

“…In earlier works, decidability results have been obtained by either imposing a bound on the number of tokens (e.g., [15,7]) or removing urgency completely (e.g., [21,24]). Here, we consider classes of Timed-Arc Petri Nets and of TPNs with restricted Urgency to obtain decidability.…”

Section: Introductionmentioning

confidence: 99%

Decidable Classes of Unbounded Petri Nets with Time and Urgency

Akshay¹,

Genest²,

Hélouët³

2016

Application and Theory of Petri Nets and Concurrency

View full text Add to dashboard Cite

show abstract

“…A work process based that concentrates on the foundational issues of soundness is strongly based on timedconstrained soundness. Through subclass of bounded nets, we can efficiently verify the design [22]. For the effective processing, agents search for more agents by using KQML.…”

Section: Introductionmentioning

confidence: 99%

Timed-Arc Petri-Nets based Agent Communication for Real-Time Multi-Agent Systems

Qasim¹,

Kanwal²,

Khalid³

et al. 2019

IJACSA

View full text Add to dashboard Cite

This research focuses on Timed-Arc Petri-netsbased agent communication in real-time multi-agent systems. The Agent Communication Language is a standard language for the agents to communicate. The objective is to combine Timed-Arc Petri-nets and FIPA Performatives in real-time multi-agent systems. FIPA standards provide a richer framework for the interaction of agents and makes it easier to develop a well-defined system. It also ensures the management by precisely specifying the agent's interaction. Though FIPA protocol has already been described with the help of Petri-nets but this specification lacks the timing aspect that is a dire need for real-time multi-agent systems. The main objective of this research is to provide a method of modeling existing FIPA performatives by combining Timed-Arc Petri-nets in real-time multi-agent systems. We have used properties, such as liveness, deadlock and reachability for the formal verification of the proposed modeling technique.

show abstract

Time-Soundness of Time Petri Nets Modelling Time-Critical Systems

Liu

Jiang

Zhou

2018

ACM Trans. Cyber-Phys. Syst.

View full text Add to dashboard Cite

The correctness of a time-critical system is closely related to the time of responding and performing every event. Our motivation example, alternating bit protocol , and application example, multi-track level crossing with sensors , both demonstrate that some nondeterministic behaviours can take place if the time associated with events is configured inappropriately or some concurrent events are controlled imperfectly in an overlapping period. These nondeterministic behaviours decrease the reliability and/or safety of a time-critical system. Therefore, it is valuable to formalise and check (non)determinacy. Time Petri Nets (TPN) in which the firing of every event is limited to a fix time interval are used to model time-critical systems in this article. We proposes a novel notion for TPN named time-soundness . It guarantees that the system always owns deterministic behaviours after any event is performed no matter when the event is performed. We utilise the notion of bisimulation to prove that the time-soundness can guarantee the behavioural determinacy. We propose an algorithm to check time-soundness, develop the related tool, and do experiments to show the usefulness and effectiveness of our notion and method.

show abstract

Soundness of Timed-Arc Workflow Nets

Cited by 4 publications

References 16 publications

Decidable Classes of Unbounded Petri Nets with Time and Urgency

Decidable Classes of Unbounded Petri Nets with Time and Urgency

Timed-Arc Petri-Nets based Agent Communication for Real-Time Multi-Agent Systems

Time-Soundness of Time Petri Nets Modelling Time-Critical Systems

Contact Info

Product

Resources

About