On the ω-language Expressive Power of Extended Petri Nets | Zendy

Alain Finkel | Zendy; Gilles Geeraerts | Zendy; Jean-François Raskin | Zendy; Laurent Van Begin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the ω-language Expressive Power of Extended Petri Nets

Author(s) -

Alain Finkel,

Gilles Geeraerts,

Jean-François Raskin,

Laurent Van Begin

Publication year - 2005

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.2004.11.030

Subject(s) - petri net , expressive power , computer science , hierarchy , stochastic petri net , monotonic function , process architecture , blocking (statistics) , programming language , theoretical computer science , petri dish , mathematics , mathematical analysis , computer network , biology , economics , market economy , genetics

In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with non-blocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well-quasi orderings and monotonicity properties

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