Trace Inclusion for One-Counter Nets Revisited (Q3447702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4251918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence of deterministic one-counter automata is NL-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation Over One-counter Nets is PSPACE-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of Weak Simulation on One-Counter Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace Inclusion for One-Counter Nets Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences of Pushdown Systems Are Hard / 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: Petri nets and regular processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic one-counter automata / rank
 
Normal rank

Latest revision as of 22:58, 10 July 2024

scientific article
Language Label Description Also known as
English
Trace Inclusion for One-Counter Nets Revisited
scientific article

    Statements

    Identifiers