A decomposition theorem for finite persistent transition systems (Q1015394): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3504339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability in Conflict-Free Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marked directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Choice Petri Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of persistence for vector addition systems / 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: On weak persistency of Petri nets / rank
 
Normal rank

Latest revision as of 13:56, 1 July 2024

scientific article
Language Label Description Also known as
English
A decomposition theorem for finite persistent transition systems
scientific article

    Statements