"Reachability Analysis for Timed Automata Using Partitioning Algorithms."

Agata Pólrola, Wojciech Penczek, Maciej Szreter (2003)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-09-18

- view
  - electronic edition @ iospress.com
- export record
  dblp key:
  - journals/fuin/PolrolaPS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/fuin/PolrolaPS03
Agata Pólrola, Wojciech Penczek, Maciej Szreter:
Reachability Analysis for Timed Automata Using Partitioning Algorithms. Fundam. Informaticae 55(2): 203-221 (2003)

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.