Applying Step Coverability Trees to Communicating Component-Based Systems (Q3400920)
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: Applying Step Coverability Trees to Communicating Component-Based Systems |
scientific article; zbMATH DE number 5663812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Applying Step Coverability Trees to Communicating Component-Based Systems |
scientific article; zbMATH DE number 5663812 |
Statements
Applying Step Coverability Trees to Communicating Component-Based Systems (English)
0 references
28 January 2010
0 references
Petri nets
0 references
step semantics
0 references
step coverability tree
0 references
boundedness
0 references
decidability
0 references
maximal concurrency
0 references
marked graphs
0 references
components
0 references
localities
0 references
0.90867406
0 references
0.82839435
0 references
0.8190081
0 references
0.8140607
0 references
0.8121813
0 references
0.80991316
0 references
0.8088317
0 references
