Name
Abstract | ||
|---|---|---|
We show here how to contract the ITCPN state space. We distinguish three levels of contraction that translate the ITCPN state space into one well timed and coherent timed automation. We consider here only equivalence based on delays. To achieve more contractions, the equivalence based on delays can be completed with equivalence based on colours as shown in [4]. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S1571-0661(04)80466-3 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
state space | Discrete mathematics,Computer science,Automation,Equivalence (measure theory),State space | Journal |
Volume | Issue | ISSN |
65 | 6 | 1571-0661 |
Citations | PageRank | References |
5 | 0.51 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. Boucheneb | 1 | 17 | 3.46 |
| G. Berthelot | 2 | 5 | 0.51 |