Skip to content
Channels - Analyzing Timed Systems Using Tree Automata :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Analyzing Timed Systems Using Tree Automata
Search for more channels:
Similar Items: Analyzing Timed Systems Using Tree Automata
Channel Options
View Record
Explore related channels
Quick Look
Pushing for weighted tree automata
Quick Look
Minimisation of Multiplicity Tree Automata
Quick Look
Visibly Tree Automata with Memory and Constraints
Quick Look
Alternating register automata on finite words and trees
Quick Look
Stochastic Timed Automata
Quick Look
Bottom-up automata on data trees and vertical XPath
Quick Look
Polishness of some topologies related to word or tree automata
Quick Look
Sampled Semantics of Timed Automata
Quick Look
Weak Alternating Timed Automata
Quick Look
Determinisability of register and timed automata
Quick Look
History-deterministic Timed Automata
Quick Look
Parametric updates in parametric timed automata
Quick Look
Reachability and liveness in parametric timed automata
Quick Look
Avoiding Shared Clocks in Networks of Timed Automata
Quick Look
Language Preservation Problems in Parametric Timed Automata
Quick Look
Model Checking One-clock Priced Timed Automata
Quick Look
Analysis of Timed and Long-Run Objectives for Markov Automata
Quick Look
Timed Automata Robustness Analysis via Model Checking
Quick Look
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
Quick Look
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Quick Look
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
Quick Look
Model Checking Probabilistic Timed Automata with One or Two Clocks
Quick Look
Verification for Timed Automata extended with Unbounded Discrete Data Structures
Quick Look
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Load more items
View Record
Prev
Explore related channels
Next