scientific article; zbMATH DE number 1796157
From MaRDI portal
zbMath0991.68035MaRDI QIDQ4551181
Publication date: 4 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020506
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Presburger liveness verification of discrete timed automata., Eliminating the storage tape in reachability constructions., Coalgebraic Semantic Model for the Clock Constraint Specification Language, Verification in loosely synchronous queue-connected discrete timed automata., Generalized discrete timed automata: Decidable approximations for safety verification., Pushdown timed automata: A binary reachability characterization and safety verification., Past pushdown timed automata and safety verification., Reachability relations of timed pushdown automata, Timed Basic Parallel Processes, On store languages of language acceptors, On families of full trios containing counter machine languages, Counter machines and verification problems.
Uses Software
