Publications
Search

Publications :: Search

What Makes Petri Nets Harder to Verify: Stack or Data?

Show publication

On this page you see the details of the selected publication.

    Publication properties
    Title: What Makes Petri Nets Harder to Verify: Stack or Data?
    Rating: (not rated yet)
    Discussion: 0 comments
    Date: 2017
    Publication type: Conference paper
    Authors:
    No. First name Last name Show
    1. Ranko Lazic
    2. Patrick Totzke
    Download (by DOI): 10.1007/978-3-319-51046-0_8
    BibTeX: conf/birthday/LazicT17
    DBLP: db/conf/birthday/roscoe2017.html#LazicT17
    Bookmark:

    The following keywords have been assigned to this publication so far. If you have logged in, you can tag this publication with additional keywords.

    Keywords
    No keywords have been assigned to this publication yet.

    If you log in you can tag this publication with additional keywords

    A publication can refer to another publication (outgoing references) or it can be referred to by other publications (incoming references).

    Incoming References
    No incoming references have been assigned to this publication yet.
    Outgoing References
    No outgoing references have been assigned to this publication yet.

    If you log in you can add references to other publications

    A publication can be assigned to a conference, a journal or a school.

    Conference
    Name: Concurrency, Security, and Puzzles - Essays Dedicated to Andrew William Roscoe on the Occasion of His 60th Birthday 2017
    URL: https://doi.org/10.1007/978-3-319-51046-0
    DBLP: db/conf/birthday/roscoe2017.html