scientific article; zbMATH DE number 7559503

DOI10.4230/LIPIcs.CONCUR.2020.47MaRDI QIDQ5089314

Shaull Almagor, Patrick Totzke, Piotr Hofman, Udi Boker

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2005.03435

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

universalityunambiguous automatacounter netVASS

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Countdown games, and simulation on (succinct) one-counter nets ⋮ Coverability in 2-VASS with one unary counter is in NP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On selective unboundedness of VASS
• The covering and boundedness problems for vector addition systems
• On path equivalence of nondeterministic finite automata
• Petri nets and regular processes
• Trace inclusion for one-counter nets revisited
• Simulation Problems Over One-Counter Nets
• What’s Decidable about Weighted Automata?
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Bisimilarity of One-Counter Processes Is PSPACE-Complete
• Energy and Mean-Payoff Games with Imperfect Information
• Infinite-state energy games
• Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete
• Universal safety for timed Petri nets is PSPACE-complete
• Universality Problem for Unambiguous VASS
• CONCUR 2004 - Concurrency Theory

This page was built for publication: