A lazy query scheme for reachability analysis in Petri nets (Q2117184): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On Petri Nets with Hierarchical Special Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods for the Design of Real-Time Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Unfolding of Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques for Networked and Distributed Systems - FORTE 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Reachability Analysis in Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Let's be lazy, we have time -- or, lazy reachability analysis for timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure to decide reachability in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stubborn Sets for Simple Linear Time Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the General Petri Net Reachability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability in Petri Nets with Inhibitor Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Program Slicing / rank
 
Normal rank

Latest revision as of 10:06, 28 July 2024

scientific article
Language Label Description Also known as
English
A lazy query scheme for reachability analysis in Petri nets
scientific article

    Statements

    A lazy query scheme for reachability analysis in Petri nets (English)
    0 references
    0 references
    0 references
    0 references
    21 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    reachability analysis
    0 references
    unbounded Petri nets
    0 references
    inhibitor arcs
    0 references
    lazy algorithms
    0 references
    0 references
    0 references
    0 references
    0 references