bibliographer a curated TCS bibliography
  • obsidian
  • tags
  • authors
  • no doi
  • no pdf
  • bad author
  • add item
  • librarian

  • Revisiting reachability in Polynomial Interrupt Timed Automata Béatrice Bérard Serge Haddad Thu 11 November 2021
  • Bounded opacity for timed systems Ikhlass Ammar Yamen El Touati Moez Yeddes John Mullins Tue 07 September 2021
  • Effective definability of the reachability relation in timed automata Martin Franzle Karin Quaas Mahsa Shirmohammadi James Worrell Mon 09 December 2019
  • Timed recursive state machines: Expressiveness and complexity Massimo Benerecetti Adriano Peron Wed 30 May 2018
  • A survey of timed automata for the development of real-time systems Md Tawhid Bin Waez Juergen Dingel Karen Rudie Tue 13 March 2018
  • Timed automata and additive clock constraints Béatrice Bérard Catherine Dufourd Fri 03 October 2014

Library Size: 13G (6 entries), Last Updated: Apr 04, 2026, 18:14:59, Build Time: N/A badge
[show logs] [hide logs]