"When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?"

Béatrice Bérard et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11590156_22

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/fsttcs/BerardCHLR05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/BerardCHLR05
Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux:
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets? FSTTCS 2005: 273-284

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.