Petri Nets with Non-blocking Arcs are Difficult to Analyze | Zendy

Jean-François Raskin | Zendy; Laurent Van Begin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Petri Nets with Non-blocking Arcs are Difficult to Analyze

Author(s) -

Jean-François Raskin,

Laurent Van Begin

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2003.10.005

Subject(s) - petri net , blocking (statistics) , decidability , computer science , java , process architecture , class (philosophy) , programming language , stochastic petri net , petri dish , distributed computing , theoretical computer science , computer network , artificial intelligence , biology , genetics

In this paper, we study the decidability of five problems on a class of extended Petri nets. The study of this class of extended Petri nets is motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous. This kind of communications occurs in abstractions of multi-threaded JAVA programs. © 2004 Elsevier B.V. All rights reserved.SCOPUS: cp.jinfo:eu-repo/semantics/publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research