Reachability results for timed automata with unbounded data structures
From MaRDI portal
Publication:707597
DOI10.1007/S00236-010-0121-8zbMATH Open1214.68199OpenAlexW2048551412MaRDI QIDQ707597FDOQ707597
Authors: Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina
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
Recommendations
Cites Work
- Kronos: A verification tool for real-time systems
- Formal Methods for the Design of Real-Time Systems
- A theory of timed automata
- Pushdown timed automata: A binary reachability characterization and safety verification.
- A logic of authentication
- A calculus of durations
- Communicating Timed Automata: The More Synchronous, the More Difficult to Verify
- On the security of public key protocols
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmenting the discrete timed automaton with other data structures.
- Automatic analysis of a non-repudiation protocol
- Expressive power of hybrid systems with real variables, integer variables and arrays
- Title not available (Why is that?)
Cited In (4)
Uses Software
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)