Minimal Cost Reachability/Coverability in Priced Timed Petri Nets (Q3617740): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4535172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the optimal reachability problem of weighted timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of a temporal logic problem for Petri nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4551180 / 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: Recoverability of Communication Protocols--Implications of a Theoretical Study / 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: The residue of vector sets with applications to decidability problems in Petri nets / rank
 
Normal rank

Latest revision as of 05:44, 29 June 2024

scientific article
Language Label Description Also known as
English
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
scientific article

    Statements