Coverability problem of asynchronous multi-process timed automata (Q3132074)
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: Coverability problem of asynchronous multi-process timed automata |
scientific article; zbMATH DE number 6831521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coverability problem of asynchronous multi-process timed automata |
scientific article; zbMATH DE number 6831521 |
Statements
29 January 2018
0 references
real-time system
0 references
timed automata
0 references
read-arc timed Petri net
0 references
coverability
0 references
0.7118735909461975
0 references
