scientific article; zbMATH DE number 1304996
From MaRDI portal
Publication:4251918
zbMath0940.68055MaRDI QIDQ4251918
Kārlis Čerāns, Parosh Aziz Abdulla
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
Countdown games, and simulation on (succinct) one-counter nets ⋮ Trace Inclusion for One-Counter Nets Revisited ⋮ DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource ⋮ Trace inclusion for one-counter nets revisited ⋮ Reachability in Succinct and Parametric One-Counter Automata ⋮ A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Unnamed Item ⋮ Nonprimitive recursive complexity and undecidability for Petri net equivalences ⋮ Decidability of bisimilarity for one-counter processes.
This page was built for publication:
