scientific article
From MaRDI portal
Publication:2754154
zbMath0973.68163MaRDI QIDQ2754154
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Countdown games, and simulation on (succinct) one-counter nets ⋮ DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ Reachability in Succinct and Parametric One-Counter Automata ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Model Checking FO(R) over One-Counter Processes and beyond
This page was built for publication:
