scientific article
From MaRDI portal
Publication:2754074
zbMath0974.68085MaRDI QIDQ2754074
Tevfik Bultan, Oscar H. Ibarra, Jianwen Su, Zhe Dang, Richard A. Kemmerer
Publication date: 11 November 2001
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. ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Lossiness of communication channels modeled by transducers1 ⋮ Quantifying communication in synchronized languages ⋮ Quantifying Communication in Synchronized Languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Similarity in languages and programs ⋮ On store languages and applications ⋮ 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. ⋮ Execution information rate for some classes of automata ⋮ Past pushdown timed automata and safety verification. ⋮ Reachability relations of timed pushdown automata ⋮ Linear reachability problems and minimal solutions to linear Diophantine equation systems ⋮ Reachability in Timed Counter Systems ⋮ Grammatical characterizations of NPDAs and VPDAs with counters ⋮ On composition and lookahead delegation of \(e\)-services modeled by automata ⋮ Sampling automata and programs ⋮ Semilinearity of Families of Languages ⋮ Counter machines and verification problems. ⋮ Augmenting the discrete timed automaton with other data structures.
Uses Software
This page was built for publication:
