Undecidability of performance equivalence of Petri nets (Q507373): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4508291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reachability Problem for Vector Addition System with One Zero-Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On performance congruences for process algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance preorder and competitive equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of processes with durational actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability of bisimilarity for Petri nets and some related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of performance equivalence for basic parallel processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nets with Tokens Which Carry Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3907077 / 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: Q4736869 / rank
 
Normal rank

Revision as of 08:54, 13 July 2024

scientific article
Language Label Description Also known as
English
Undecidability of performance equivalence of Petri nets
scientific article

    Statements

    Identifiers