FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897779
DOI10.1007/11590156zbMath1172.68537OpenAlexW2484051058MaRDI QIDQ5897779
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
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
A survey of timed automata for the development of real-time systems ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ R-Automata ⋮ Timed Basic Parallel Processes ⋮ Universality of R-automata with Value Copying ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Timed Automata Can Always Be Made Implementable ⋮ Effective definability of the reachability relation in timed automata
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science