Matches in SemOpenAlex for { <https://semopenalex.org/work/W2890492027> ?p ?o ?g. }
Showing items 1 to 70 of
70
with 100 items per page.
- W2890492027 abstract "Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business processes. The central algorithmic problem for Petri nets is reachability: whether from the given initial configuration there exists a sequence of valid execution steps that reaches the given final configuration. The complexity of the problem has remained unsettled since the 1960s, and it is one of the most prominent open questions in the theory of verification. Decidability was proved by Mayr in his seminal STOC 1981 work, and the currently best published upper bound is non-primitive recursive Ackermannian of Leroux and Schmitz from LICS 2019. We establish a non-elementary lower bound, i.e. that the reachability problem needs a tower of exponentials of time and space. Until this work, the best lower bound has been exponential space, due to Lipton in 1976. The new lower bound is a major breakthrough for several reasons. Firstly, it shows that the reachability problem is much harder than the coverability (i.e., state reachability) problem, which is also ubiquitous but has been known to be complete for exponential space since the late 1970s. Secondly, it implies that a plethora of problems from formal languages, logic, concurrent systems, process calculi and other areas, that are known to admit reductions from the Petri nets reachability problem, are also not elementary. Thirdly, it makes obsolete the currently best lower bounds for the reachability problems for two key extensions of Petri nets: with branching and with a pushdown stack." @default.
- W2890492027 created "2018-09-27" @default.
- W2890492027 date "2018-09-19" @default.
- W2890492027 modified "2023-09-27" @default.
- W2890492027 title "The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)." @default.
- W2890492027 hasPublicationYear "2018" @default.
- W2890492027 type Work @default.
- W2890492027 sameAs 2890492027 @default.
- W2890492027 citedByCount "6" @default.
- W2890492027 countsByYear W28904920272018 @default.
- W2890492027 countsByYear W28904920272019 @default.
- W2890492027 countsByYear W28904920272020 @default.
- W2890492027 crossrefType "posted-content" @default.
- W2890492027 hasConcept C105795698 @default.
- W2890492027 hasConcept C11413529 @default.
- W2890492027 hasConcept C118615104 @default.
- W2890492027 hasConcept C134306372 @default.
- W2890492027 hasConcept C136643341 @default.
- W2890492027 hasConcept C153269930 @default.
- W2890492027 hasConcept C193702766 @default.
- W2890492027 hasConcept C199360897 @default.
- W2890492027 hasConcept C2777669093 @default.
- W2890492027 hasConcept C33923547 @default.
- W2890492027 hasConcept C38677869 @default.
- W2890492027 hasConcept C41008148 @default.
- W2890492027 hasConcept C72434380 @default.
- W2890492027 hasConcept C77553402 @default.
- W2890492027 hasConcept C80444323 @default.
- W2890492027 hasConceptScore W2890492027C105795698 @default.
- W2890492027 hasConceptScore W2890492027C11413529 @default.
- W2890492027 hasConceptScore W2890492027C118615104 @default.
- W2890492027 hasConceptScore W2890492027C134306372 @default.
- W2890492027 hasConceptScore W2890492027C136643341 @default.
- W2890492027 hasConceptScore W2890492027C153269930 @default.
- W2890492027 hasConceptScore W2890492027C193702766 @default.
- W2890492027 hasConceptScore W2890492027C199360897 @default.
- W2890492027 hasConceptScore W2890492027C2777669093 @default.
- W2890492027 hasConceptScore W2890492027C33923547 @default.
- W2890492027 hasConceptScore W2890492027C38677869 @default.
- W2890492027 hasConceptScore W2890492027C41008148 @default.
- W2890492027 hasConceptScore W2890492027C72434380 @default.
- W2890492027 hasConceptScore W2890492027C77553402 @default.
- W2890492027 hasConceptScore W2890492027C80444323 @default.
- W2890492027 hasLocation W28904920271 @default.
- W2890492027 hasOpenAccess W2890492027 @default.
- W2890492027 hasPrimaryLocation W28904920271 @default.
- W2890492027 hasRelatedWork W1592552608 @default.
- W2890492027 hasRelatedWork W1938261175 @default.
- W2890492027 hasRelatedWork W1967174286 @default.
- W2890492027 hasRelatedWork W2037088969 @default.
- W2890492027 hasRelatedWork W2113391671 @default.
- W2890492027 hasRelatedWork W2157209432 @default.
- W2890492027 hasRelatedWork W2161984463 @default.
- W2890492027 hasRelatedWork W2275786693 @default.
- W2890492027 hasRelatedWork W2294345396 @default.
- W2890492027 hasRelatedWork W2295746581 @default.
- W2890492027 hasRelatedWork W2506850889 @default.
- W2890492027 hasRelatedWork W2900179285 @default.
- W2890492027 hasRelatedWork W2912654482 @default.
- W2890492027 hasRelatedWork W2949572356 @default.
- W2890492027 hasRelatedWork W3001378189 @default.
- W2890492027 hasRelatedWork W3022379598 @default.
- W2890492027 hasRelatedWork W3028690307 @default.
- W2890492027 hasRelatedWork W3034977704 @default.
- W2890492027 hasRelatedWork W3150693775 @default.
- W2890492027 hasRelatedWork W567211000 @default.
- W2890492027 isParatext "false" @default.
- W2890492027 isRetracted "false" @default.
- W2890492027 magId "2890492027" @default.
- W2890492027 workType "article" @default.