Decomposition Theorems for Bounded Persistent Petri Nets (Q3510855): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q198039 / rank
Normal rank
 
Property / author
 
Property / author: Philippe Darondeau / rank
 
Normal rank
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.1007/978-3-540-68746-7_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1533935241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability in Conflict-Free Petri Nets / 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: Concurrent transition systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weak persistency of Petri nets / rank
 
Normal rank

Latest revision as of 12:07, 28 June 2024

scientific article
Language Label Description Also known as
English
Decomposition Theorems for Bounded Persistent Petri Nets
scientific article

    Statements

    Identifiers