Timed recursive state machines: expressiveness and complexity

DOI10.1016/j.tcs.2016.02.021zbMath1338.68070OpenAlexW2463591852MaRDI QIDQ264999

Adriano Peron, Massimo Benerecetti

Publication date: 1 April 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.021

zbMATH Keywords

real-time systemstimed automataformal languagesformal models of computingpushdown systemsrecursive state machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Unnamed Item, Timed Basic Parallel Processes, Context-free timed formalisms: robust automata and linear temporal logics

Uses Software

• Kronos
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interrupt timed automata: verification and expressiveness
• Model-checking in dense real-time
• What's decidable about hybrid automata?
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Past pushdown timed automata and safety verification.
• Kronos: A verification tool for real-time systems
• Uppaal in a nutshell
• Updatable timed automata
• Nested Timed Automata
• Dense-Timed Pushdown Automata
• On the power of non-observable actions in timed automata
• Recursive Timed Automata
• Formal Methods for the Design of Real-Time Systems