Reachability results for timed automata with unbounded data structures
From MaRDI portal
Publication:707597
Recommendations
Cites work
- scientific article; zbMATH DE number 1670837 (Why is no real title available?)
- scientific article; zbMATH DE number 1228291 (Why is no real title available?)
- scientific article; zbMATH DE number 2143088 (Why is no real title available?)
- A calculus of durations
- A logic of authentication
- A theory of timed automata
- Augmenting the discrete timed automaton with other data structures.
- Automatic analysis of a non-repudiation protocol
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- Expressive power of hybrid systems with real variables, integer variables and arrays
- Formal Methods for the Design of Real-Time Systems
- Kronos: A verification tool for real-time systems
- On the security of public key protocols
- Pushdown timed automata: A binary reachability characterization and safety verification.
Cited in
(5)- Verification for Timed Automata extended with Unbounded Discrete Data Structures
- Perfect timed communication is hard
- A rewriting framework and logic for activities subject to regulations
- Weak bisimulation for probabilistic timed automata
- Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable
This page was built for publication: Reachability results for timed automata with unbounded data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707597)
