Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata (Q4603564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata |
scientific article; zbMATH DE number 6839695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata |
scientific article; zbMATH DE number 6839695 |
Statements
Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata (English)
0 references
16 February 2018
0 references
timed automata
0 references
state space explosion
0 references
duration
0 references
approximation
0 references
0.87568796
0 references
0.87056947
0 references
0.86929387
0 references
0 references
0.8640229
0 references
0.8627885
0 references
0.86165684
0 references
