FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897771
DOI10.1007/11590156zbMath1172.68543OpenAlexW2484051058MaRDI QIDQ5897771
Jan Strejček, Vojtěch Řehák, Mojmír Křetínský
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)
Related Items (4)
On decidability of LTL model checking for process rewrite systems ⋮ The Decidability of the Reachability Problem for CCS! ⋮ Reachability is decidable for weakly extended process rewrite systems ⋮ On Symbolic Verification of Weakly Extended PAD
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science