Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 4 of 8 found articles
 
 
  Nets with Tokens which Carry Data
 
 
Title: Nets with Tokens which Carry Data
Author: Lazić, Ranko
Newcomb, Tom
Ouaknine, Joël
Roscoe, A.W.
Worrell, James
Appeared in: Fundamenta informaticae
Paging: Volume 88 (2008) nr. 3 pages 251-274
Year: 2008-12-18
Contents: We study data nets, a generalisation of Petri nets in which tokens carry data from linearlyordered 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. The main result of the paper is that, even for unordered data domains (i.e., with only the equality predicate), each of the three verification problems for data nets without whole-place operations has non-elementary complexity.
Publisher: IOS Press
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 4 of 8 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands
Toegankelijkheidsverklaring