A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
Recursive Petri nets
2007
Acta Informatica
Preserved Fulltext
Here we present and develop the theory of such a model, the recursive Petri nets. ...
First, we show that the mechanisms supported by recursive Petri nets enable to model patterns of discrete event systems related to the dynamic structure of processes. ...
Definition 10 (Recursive Petri nets). ...
doi:10.1007/s00236-007-0055-y
fatcat:ekrl3z2juzdijdlg26xjif2bma
Dynamic Recursive Petri Nets
[chapter]
2020
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Here we introduce Dynamic Recursive Petri nets (DRPN) which address these issues. ...
In the early two-thousands, Recursive Petri nets (RPN) have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. ...
Conclusion We introduced DRPN that extend recursive Petri nets in several directions. ...
doi:10.1007/978-3-030-51831-8_17
fatcat:y6gxs576trb3folcuoyqsuebxa
Maximality Semantic For Recursive Petri Nets
2013
ECMS 2013 Proceedings edited by: Webjorn Rekdalsbakken, Robin T. Bye, Houxiang Zhang
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
For this purpose, we propose a maximality operational semantic for recursive Petri nets. ...
As an illustration, a system of filling medical bottles is specified in terms of recursive Petri net and translated to a maximality-based labeled transition system. ...
The behavior of any thread is modeled by the recursive Petri net. ...
doi:10.7148/2013-0544
dblp:conf/ecms/SaidouniBI13
fatcat:abrvtdkic5fpflxyg526apey4q
The Reachability Problem for Petri Nets is Not Primitive Recursive
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. ...
is equivalent to the so-called reachability problem for Petri nets. ...
problem for checking programs is equivalent (i.e. inter-reducible) to the so-called reachability problem for Petri nets. ...
arXiv:2104.12695v4
fatcat:sn5wl27frveehn4tpopqnb4eqe
Coverability, Termination, and Finiteness in Recursive Petri Nets
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2021 pre-print arXiv:2109.06804v1 fatcat:ityttmhcajajnmatwtvvxiph7e
In contrast, we establish here that for Recursive Petri nets, the coverability, termination, boundedness and finiteness problems are EXPSPACE-complete as for Petri nets. ...
From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. ...
Recursive Petri nets (RPN). ...
arXiv:2109.06804v2
fatcat:2kn4hx7msbcwjfljzjc764zz34
Hierarchical System Design Using Refinable Recursive Petri Net
2018
Computing and informatics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
For this purpose we propose the model of Refinable Recursive Petri Nets (RRPN) under a maximality semantics. In this model a notion of undefined transitions is considered. ...
MAXIMALITY SEMANTICS FOR REFINABLE RECURSIVE PETRI NETS All definitions remain valid for refinable recursive Petri net. ...
REFINABLE RECURSIVE PETRI NETS A refinable recursive Petri net is a recursive Petri net on which all transitions are labeled by actions and abstract transitions may be labeled by ⊥ (the abstract transitions ...
doi:10.4149/cai_2018_3_635
fatcat:3zayqytdhfazxblymsisy2ehya
Finite Petri nets as models for recursive causal behaviour
1994
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Goltz (1988) discussed whether or not there exist finite Petri nets (with unbounded capacities) modelling the causal behaviour of certain recursive CCS terms. ...
One possibility is to consider a well-established Petri net semantics yielding an infinite net. For instance, [9] generates the net shown in Fig. 1. ...
doi:10.1016/0304-3975(94)90058-2
fatcat:gc7knuerujeorni7vksfxcv4xm
Nonprimitive recursive complexity and undecidability for Petri net equivalences
2001
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Sci. 148 (1995) 281-301] can be immediately extended for the whole range of equivalences (and preorders) on labelled Petri nets. ...
Secondly, it shows that restricting our attention to nets with ÿnite reachable space, the respective (decidable) problems are nonprimitive recursive; this approach also applies to Mayr and Meyer's result ...
Any reasonable preorder is undecidable for labelled Petri nets. Theorem 4. Any reasonable preorder is not primitive recursive for r-ÿnite labelled Petri nets. ...
doi:10.1016/s0304-3975(00)00100-6
fatcat:a3jdzuu5vba6pljcpfe65fiv3u
A RECURSIVE METHOD FOR MINIMAL SIPHON ENUMERATION IN PETRI NETS
2005
IFAC Proceedings Volumes
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The enumeration of minimal siphons in ordinary Petri nets is fundamental in the assessment of behavioral properties and a crucial step in the development of deadlock prevention algorithms. ...
A novel recursive algorithm is proposed in the paper for this purpose, based on theoretical results that extend well known properties described in the literature. ...
PETRI NETS AND SIPHONS
Basic notions on Petri nets A PN is a bipartite graph, where nodes are classified either as places or transitions, and directed arcs connect nodes of different type. ...
doi:10.3182/20050703-6-cz-1902.00293
fatcat:oxkp77f3tnf5tp6ghjnyrphode
The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
2012
2012 27th Annual IEEE Symposium on Logic in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. ...
This construction provides ordinal-recursive lower bounds on the complexity of the main decidable properties (safety, termination, regular simulation, etc.) of these models. ...
Definition 1 (Petri Data Nets). ...
doi:10.1109/lics.2012.46
dblp:conf/lics/HaddadSS12
fatcat:vyeh46lnhnen3dj3us5lrgkdmq
Checking linear temporal formulas on sequential recursive Petri nets
Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Recursive Petri nets (RPNs) have been introduced to model systems with dynamic structure. ...
In this work, we introduce a submodel of RPNs called sequential recursive Petri nets (SRPNs) and we study the model checking of the action-based linear time logic on SRPNs. ...
At last, we have studied the language family of SRPNs and proved that this family strictly includes the union of Petri nets and context-free languages. ...
doi:10.1109/time.2001.930718
dblp:conf/time/HaddadP01
fatcat:y5oldmpt7raqhis6p6jzih3e6a
A primitive recursive algorithm for the general Petri net reachability problem
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Using Net Refinement to Compute the Fixpoint of a Recursive Expression
1995
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The talk illustrates the general Petri net semantics of equations such a s X = term(X) using a basic CCS-like process algebra without restriction, synchronisation and relabelling. ...
In Petri nets, transition re nement p l a ys a similar role. More precisely, l e t a recursive equation of the form X = term(X) (1) be given, where term(X) m a y c o n tain variable X freely. ...
The construction of such a net leads to a unique result only in the case of guarded recursion. ...
doi:10.1016/s1571-0661(05)80177-x
fatcat:kveh3bh2n5hvrjwz62mrtyryn4
Page 7285 of Mathematical Reviews Vol. , Issue 2004i
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(RS-AOS-PG; Pereslavl’ Zalesskiy)
Nested Petri nets: multi-level and recursive systems. (English summary)
Special issue on concurrency specification and programming (Berlin, 2000).
Fund. ...
Summary: “Nested Petri nets (NP-nets) extend ordinary Petri nets by allowing tokens in a net marking to be represented by marked nets themselves. ...
Petri nets semantics of π-calculus
2008
Frontiers of Electrical and Electronic Engineering in China
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
concurrency, choice and recursive modules. ...
These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well as system behaviors. ...
In this paper, p-calculus is divided into basic elements, recursive, sequence, concurrency and choice modules. These modules are translated into Petri nets, and then construct a complicated system. ...
doi:10.1007/s11460-008-0050-2
fatcat:w2crgev3gzf55n6ddhkb526tce
« Previous
Showing results 1 — 15 out of 8,792 results