Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

What makes petri nets harder to verify : stack or data?, Concurrency, security, and puzzles : Festschrift for A.W. Roscoe on the occasion of his 60th birthday

Tools
- Tools
+ Tools

Lazic, Ranko and Totzke, Patrick (2017) What makes petri nets harder to verify : stack or data?, Concurrency, security, and puzzles : Festschrift for A.W. Roscoe on the occasion of his 60th birthday. In: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, 10160 . Springer, pp. 144-161. ISBN 9783319510453

[img]
Preview
PDF
WRAP-what-makes-petri-nets-harder-verify-Lazic-2016.pdf - Accepted Version - Requires a PDF viewer.

Download (753Kb) | Preview
Official URL: http://dx.doi.org/10.1007/978-3-319-51046-0_8

Request Changes to record.

Abstract

We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.

Item Type: Book Item
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Petri nets
Series Name: Lecture Notes in Computer Science
Publisher: Springer
ISBN: 9783319510453
ISSN: 0302-9743
Book Title: Concurrency, Security, and Puzzles : Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday
Official Date: January 2017
Dates:
DateEvent
January 2017Published
18 December 2016Available
8 November 2016Accepted
Volume: 10160
Page Range: pp. 144-161
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Funder: Engineering and Physical Sciences Research Council (EPSRC), Royal Society (Great Britain)
Grant number: EP/M011801/1, EP/M027651/1 (EPSRC), IE150122 (Royal Society (Great Britain))
Is Part Of: Supported by the EPSRC, grants EP/M011801/1 and EP/M027651/1, and by the

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us