Reachability results for timed automata with unbounded data structures

DOI10.1007/s00236-010-0121-8zbMath1214.68199OpenAlexW2048551412MaRDI QIDQ707597

Andrea Maggiolo-Schettini, Angelo Troina, Ruggero Lanotte

Publication date: 8 October 2010

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-010-0121-8

zbMATH Keywords

systems of data management timed automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Weak bisimulation for probabilistic timed automata, A rewriting framework and logic for activities subject to regulations

Uses Software

• Kronos
• Uppaal

Cites Work

• A calculus of durations
• A theory of timed automata
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Augmenting the discrete timed automaton with other data structures.
• Kronos: A verification tool for real-time systems
• On the security of public key protocols
• A logic of authentication
• Formal Methods for the Design of Real-Time Systems
• Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item