Filters








13 Hits in 3.8 sec

Continuous Reachability for Unordered Data Petri nets is in PTime [article]

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
2019 arXiv   pre-print
Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequality of tokens.  ...  In this paper, we consider the continuous reachability problem for UDPN, which can be seen as an over-approximation of the reachability problem.  ...  Unordered data Petri Nets.  ... 
arXiv:1902.05604v1 fatcat:36lrixgenvgytdj7trlav4enlm

Continuous Reachability for Unordered Data Petri Nets is in PTime [chapter]

Utkarsh Gupta, Preey Shah, S. Akshay, Piotr Hofman
2019 Green Chemistry and Sustainable Technology  
Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequality of tokens.  ...  In this paper, we consider the continuous reachability problem for UDPN, which can be seen as an over-approximation of the reachability problem.  ...  We thank the anonymous reviewers for their careful reading and their helpful and insightful comments.  ... 
doi:10.1007/978-3-030-17127-8_15 dblp:conf/fossacs/GuptaSAH19 fatcat:xblugrhs3rczlibw62tmbyi3he

Linear Equations with Ordered Data

Piotr Hofman, Slawomir Lasota, Michael Wagner
2018 International Conference on Concurrency Theory  
These generalized equations naturally appear in the analysis of vector addition systems (or Petri nets) extended with ordered data.  ...  This high complexity is surprising, and contrasts with NP-completeness for unordered data vectors.  ...  First, we define homogeneous linear Petri nets, a variant of Petri nets generalising continuous PN [22] , and show how to solve its reachability problem using Q +solvability of a slight generalisation  ... 
doi:10.4230/lipics.concur.2018.24 dblp:conf/concur/HofmanL18 fatcat:wbbr3p5nerhw7p3hrstmyqncgu

Linear Equations with Ordered Data [article]

Piotr Hofman, Sławomir Lasota
2018 arXiv   pre-print
These generalized equations naturally appear in the analysis of vector addition systems (or Petri nets) extended with ordered data.  ...  This high complexity is surprising, and contrasts with NP-completeness for unordered data vectors.  ...  In case of ordered data, the coverability problem is still decidable while reachability is undecidable. (Petri nets with ordered data are equivalent to timed Petri nets, as shown in [5] .)  ... 
arXiv:1802.06660v1 fatcat:5cbwp4tz4zhsxnngvyexsk5ttu

Soundness in negotiations [article]

Javier Esparza and Denis Kuperberg and Anca Muscholl and Igor Walukiewicz
2018 arXiv   pre-print
In earlier work, Esparza and Desel have shown that deciding soundness of a negotiation is Pspace-complete, and in Ptime if the negotiation is deterministic.  ...  In the first part of this paper we revisit the soundness problem for deterministic negotiations, and show that it is Nlogspace-complete, improving on the earlier algorithm, which requires linear space.  ...  We thank the referees for careful reading of the paper.  ... 
arXiv:1703.05137v3 fatcat:2ntetieehzg27ogze2z76cqzza

Logics for Unordered Trees with Data Constraints

Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen
2019 Journal of computer and system sciences (Print)  
Unordered data trees are a versatile data structure that is of interest in various domains of computer science.  ...  Yet, so far, Mso for unordered trees has been studied without data, that is over finite alphabets.  ...  with data equality tests, while still decidable, is not known to be primitive recursive, and is at least as hard as reachability for Petri nets [16] .  ... 
doi:10.1016/j.jcss.2018.11.004 fatcat:za6wtphrt5dkrn3dy6m6xiqery

Practical Use of High-level Petri Nets

Kurt Jensen
2000 DAIMI Report Series  
The workshop is part of the 21st International Conference on Application and Theory of Petri Nets organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark.  ...  This booklet contains the proceedings of the Workshop on Practical Use of High-level Petri Nets, June 27, 2000.  ...  Wagenhals for his involvement in writing early versions of this paper. Finally, we also thank the CPN Group at University of Aarhus for valuable comments on this paper.  ... 
doi:10.7146/dpb.v29i547.7081 fatcat:n5axy6u5dbhmjiox45q4wanmhu

Subject index volumes 1–200

1999 Theoretical Computer Science  
nets, l-safe -, 2761 finite -, 3073 Petri nets, algebraic treatment of -., 2028 Petri nets as generators of string , 14, 17, 29, 209, 302, 315, 323, 419, 493, 5 18, 598, 607, 623, 636, 667, 674, 7  ...  , 579 firing, 2583, 2605 in a net, 872 mob problem, 1692 sequence. 53 1 firing sequences, 56,81, 872, 1202, 1336 of Petri nets, 1202 firing squad synchronization problem, 138, 287, 410, 975,  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Efficient reduction of nondeterministic automata with application to language inclusion testing [article]

Lorenzo Clemente, Richard Mayr
2018 arXiv   pre-print
This can be used to scale up applications of automata in formal verification tools and decision procedures for logical theories.  ...  (The space complexity is worst-case quadratic.)  ...  We acknowledge the anonymous reviewers for their extensive comments on earlier drafts of this article.  ... 
arXiv:1711.09946v3 fatcat:3fgofy65d5cgbnklzcstmnc2zi

LIPIcs, Volume 2, FSTTCS'08, Complete Volume [article]

Ramesh Hariharan, Madhavan Mukund, V Vinay
2013
Acknowledgments: We are grateful to Sanjeev Khanna for several discussions on the kconnectivity problem and for explaining the results and ideas in [4].  ...  This survey is based on joint research with Dietmar Berwanger and Stephan Kreutzer.  ...  Reachability and coverability problems for Petri nets with inhibitor arcs are undecidable [10] . Fortunately, they become decidable for Petri nets Petri nets with weak inhibitor arcs. THEOREM 2.  ... 
doi:10.4230/lipics.fsttcs.2008 fatcat:byk56drkgzc6dlyzfnfysbydoq

Logics on data words

Ahmet Kara, Technische Universität Dortmund, Technische Universität Dortmund
2016
A basic motivation for the study of these logics, called data logics in this work, is that data words are a suitable model to represent traces of concurrent systems with unboundedly many interacting processes  ...  In such representations data values stand for process IDs. Thus, data logics can be used to formulate requirements on such traces.  ...  The complexity of FO ∼ 2 (Suc, <) (and that of EMSO ∼ 2 (Suc, <)) was shown to be equivalent to reachability in Petri Nets [106] which is a hard problem whose precise complexity is not known yet.  ... 
doi:10.17877/de290r-17260 fatcat:iuymcqt6tfdkxkxucec2atsfsm

Improved verification methods for concurrent systems [article]

Ploeger, SCW (Bas), Groote, JF (Jan Friso), Wijk, JJ (Jarke) = (Jack) Van, Willemse, TAC (Tim)
2009
This system originated from a Petri net given by Bradfield [15] , and reappeared in [91] as a transition system. The LTS of P is depicted in figure 6.3.  ...  loop reachable from a vertex v is even.  ...  Assume that for all switch settings of G there is a loop reachable from i on which the lowest label is odd. We have to show that ( E η)(X i ) = ⊥.  ... 
doi:10.6100/ir643995 fatcat:nvslkzerojachh7mptsossxnhq

Set based failure diagnosis for concurrent constraint programming [article]

Martin Ludwig Müller, Universität Des Saarlandes, Universität Des Saarlandes
2004
This constraint system is motivated by the analysis of records, since Oz incorporates records as a central data structure through equality constraints over feature trees.  ...  data structures, cells, and records, and we highlight the restrictions of Plain with respect to Oz.  ...  Related Work Programming Languages and Models The history of models for concurrent computation reaches back into the 60's and 70's to the net theory of Petri [163] , and to work on buffered communication  ... 
doi:10.22028/d291-25722 fatcat:wuc4nibn6natrcqcbgmi7svx5a