"Timed Automata Can Always Be Made Implementable."

Patricia Bouyer et al. (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-23217-6_6

access: closed

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/concur/BouyerLMST11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/concur/BouyerLMST11
Patricia Bouyer, Kim G. Larsen, Nicolas Markey, Ocan Sankur, Claus R. Thrane:
Timed Automata Can Always Be Made Implementable. CONCUR 2011: 76-91

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.