Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays. We show that coverability and termination are decidable for arbitrary data nets, and that boundedness is decidable for data nets in which whole-place operations are restricted to transfers.
By providing an encoding of lossy channel systems into data nets without whole-place operations, we establish that coverability, termination and boundedness for the latter class have non-primitive recursive complexity. The main result of the paper is that, even for unordered data domains i. Unable to display preview. Download preview PDF. Skip to main content. This service is more advanced with JavaScript available.
Advertisement Hide. Nets with Tokens Which Carry Data. Roscoe James Worrell. Conference paper. This process is experimental and the keywords may be updated as the learning algorithm improves. This is a preview of subscription content, log in to check access. Reisig, W. Girault, C. More Filters. On the coverability and reachability languages of monotonic extensions of Petri nets. View 3 excerpts, cites methods. Highly Influenced.
View 5 excerpts, cites background and methods. Well-structured Petri Nets extensions with data. Well-structured transitions systems WSTS are a general class of infinite state systems for which decidability results rely on the existence of a well-quasi-ordering that is compatible with the … Expand.
Ordinal recursive complexity of Unordered Data Nets. View 4 excerpts, cites background and methods. Model checking Petri nets with names using data-centric dynamic systems. Petri nets with semi-structured data.
Model checking of systems with many identical timed processes. View 3 excerpts, references background. A well-structured framework for analysing petri net extensions.
Highly Influential. Lecture Notes in Computer Science, Volume Heidelberg : Springer Verlag, pp. ISBN Request Changes to record. We study data nets, a generalisation of Petri nets in which tokens carry data from linearly-ordered infinite domains and in which whole-place operations such as resets and transfers are possible.
Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays. We show that coverability and termination are decidable for arbitrary data nets, and that boundedness is decidable for data nets in which whole-place operations are restricted to transfers. By providing an encoding of lossy channel systems into data nets without whole-place operations, we establish that coverability, termination and boundedness for the latter class have non-primitive recursive complexity.
0コメント