scientific article; zbMATH DE number 1361127
From MaRDI portal
Publication:4270062
zbMath0940.68092MaRDI QIDQ4270062
Publication date: 10 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) First-order arithmetic and fragments (03F30)
Related Items (24)
Presburger liveness verification of discrete timed automata. ⋮ Thin and Thick Timed Regular Languages ⋮ A survey of timed automata for the development of real-time systems ⋮ 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. ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Unnamed Item ⋮ Past pushdown timed automata and safety verification. ⋮ Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Structural transformations for data-enriched real-time systems ⋮ An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems ⋮ On decidability and complexity of low-dimensional robot games ⋮ Linear reachability problems and minimal solutions to linear Diophantine equation systems ⋮ Reachability in Timed Counter Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Removing All Silent Transitions from Timed Automata ⋮ Effective definability of the reachability relation in timed automata ⋮ Decidable first-order transition logics for PA-processes ⋮ Augmenting the discrete timed automaton with other data structures. ⋮ Entropy of regular timed languages
This page was built for publication:
