A lazy query scheme for reachability analysis in Petri nets (Q2117184)

From MaRDI portal
Revision as of 10:06, 28 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A lazy query scheme for reachability analysis in Petri nets
scientific article

    Statements

    title
    A lazy query scheme for reachability analysis in Petri nets (English)
    0 references
    author
    Loïg Jezequel
    0 references
    Bastien Sérée
    0 references
    Didier Lime
    0 references
    publication date
    21 March 2022
    0 references
    Mathematics Subject Classification ID
    68Q85
    0 references
    68Q60
    0 references
    68W05
    0 references
    zbMATH DE Number
    7493585
    0 references
    zbMATH Keywords
    reachability analysis
    0 references
    unbounded Petri nets
    0 references
    inhibitor arcs
    0 references
    lazy algorithms
    0 references
    describes a project that uses
    Uppaal
    0 references
    LoLA
    0 references
    Meddly
    0 references
    OpenAlex ID
    W3169664372
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2117184&oldid=36780550"
    Powered by MediaWiki