Showing 1–20 of 26 results
/ Date/ Name
Apr 15, 2013Decidability of Weak Simulation on One-counter NetsFeb 16, 2022Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is DecidableApr 21, 2014Trace Inclusion for One-Counter Nets RevisitedAug 9, 2021Linear equations for unordered data vectors in $[D]^k\to{}Z^d$Oct 3, 2023Acyclic Petri and Workflow Nets with ResetsJan 22, 2022Solvability of orbit-finite systems of linear equationsOct 5, 2016Linear Combinations of Unordered Data VectorsMar 6, 2025Soundness of reset workflow netsFeb 19, 2018Linear Equations with Ordered DataOct 23, 2013Simulation Over One-counter Nets is PSPACE-CompleteJun 25, 2015Tightening the Complexity of Equivalence Problems for Commutative GrammarsOct 25, 2016Bounding Average-energy GamesJul 2, 2019Timed Basic Parallel ProcessesFeb 14, 2019Continuous Reachability for Unordered Data Petri nets is in PTimeApr 24, 2021Parikh's theorem for infinite alphabetsMay 7, 2020Parametrized Universality Problems for One-Counter NetsFeb 10, 2016Complexity of regular abstractions of one-counter languagesNov 30, 2010Relating timed and register automataMay 3, 2014Infinite-State Energy GamesAug 19, 2013Reachability Problem for Weak Multi-Pushdown Automata