Linear time analysis of properties of conflict-free and general Petri nets (Q620942): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.09.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981296835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Algorithms for Functional Dependency Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partially dynamic maintenance of minimum weight hyperpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for polynomially solvable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic maintenance of directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Persistent Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed recursive labelnode hypergraphs: A new representation-language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for 1-safe nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidability theorem for a class of vector-addition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to decide liveness of bounded free choice nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed hypergraphs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems concerning fairness and temporal logic for conflict-free Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^{1.5})\) algorithm to decide boundedness for conflict-free vector replacement systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of fairness and temporal logic problems for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems in Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Conflict-Free and Persistent Petri Nets / 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: Q4133144 / 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: Q3219122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully dynamic reachability algorithm for directed graphs with an almost linear update time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear connectivity problems in directed hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach for deciding the existence of certain petri net paths / rank
 
Normal rank

Latest revision as of 17:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Linear time analysis of properties of conflict-free and general Petri nets
scientific article

    Statements

    Linear time analysis of properties of conflict-free and general Petri nets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    0 references
    Petri nets
    0 references
    conflict-free Petri nets
    0 references
    marked graphs
    0 references
    coverability
    0 references
    liveness
    0 references
    boundedness
    0 references
    directed hypergraphs
    0 references
    incremental algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references