Reachability relations of timed pushdown automata.
Lorenzo ClementeSlawomir LasotaPublished in: J. Comput. Syst. Sci. (2021)
Keyphrases
- timed automata
- model checking
- finite state machines
- petri net
- cellular automata
- state space
- finite state
- multi agent
- temporal logic
- semantic relations
- finite automata
- transitive closure
- regular expressions
- expressive power
- preference relations
- spatial relations
- information retrieval
- background knowledge
- data structure
- multiscale
- bayesian networks