Coverability Trees for Petri Nets with Unordered Data (Q2811357): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic analysis of programs with well quasi-ordered domains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Checking Coverability Graphs of Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata theory in nominal sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On selective unboundedness of VASS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389997 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forward Analysis for WSTS, Part II: Complete WSTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-structured framework for analysing Petri net extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / 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: Q3601861 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demystifying Reachability in Vector Addition Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The covering and boundedness problems for vector addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability and complexity of Petri nets with unordered data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3225720 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Hierarchies beyond Elementary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Well-Structured Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets / rank
 
Normal rank

Latest revision as of 04:03, 12 July 2024

scientific article
Language Label Description Also known as
English
Coverability Trees for Petri Nets with Unordered Data
scientific article

    Statements

    Coverability Trees for Petri Nets with Unordered Data (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    0 references
    0 references