Petri nets are less expressive than state-extended PA
نویسندگان
چکیده
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit.
منابع مشابه
Combining Petri Nets and PA-Processes
Petri nets and PA-processes are incomparable models of inn-nite state concurrent systems. We deene a new model PAN (= PA + PN) that subsumes both of them and is thus strictly more expressive than Petri nets. It extends Petri nets with the possibility to call subroutines. We show that the reachability problem is still decidable for PAN. It is even decidable, if there is a reachable state that sa...
متن کاملExtended Process Rewrite Systems: Expressiveness and Reachability
We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less expressive up to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Further we show our main result that the reachability problem for PRS extended with a so called weak finite state ...
متن کاملConstrained Properties, Semilinear Systems, and Petri Nets
We investigate the veriication problem of two classes of innnite state systems w.r.t. nonregular properties (i.e., nondeenable by nite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including push-down systems and PA processes. On the other hand, we consider properties ex-pressible in the logic CLTL which is an extension of the linear-time temporal logic...
متن کاملOn the ω-language Expressive Power of Extended Petri Nets
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 nonblocking 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...
متن کاملProcess Rewrite Systems
Many formal models for in nite-state concurrent systems are equivalent to special classes of rewrite systems. We classify these models by their expressiveness and de ne a hierarchy of classes of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence. The most general and most expressive class of systems in this hierarchy is called Process Rewrite Systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 394 شماره
صفحات -
تاریخ انتشار 2008