| dc.contributor.author | Sawa, Zdeněk | |
| dc.date.accessioned | 2006-10-24T14:07:33Z | |
| dc.date.available | 2006-10-24T14:07:33Z | |
| dc.date.issued | 2003 | |
| dc.identifier.citation | CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings. 2003, p. 237-250. | en |
| dc.identifier.isbn | 978-3-540-40753-9 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.uri | http://hdl.handle.net/10084/57359 | |
| dc.description.abstract | The equivalence checking of systems that are given as a composition of interacting finite-state systems is considered. It is shown that the problem is EXPTIME-hard for any notion of equivalence that lies between bisimulation equivalence and trace equivalence, as conjectured by Rabinovich (1997). The result is proved for parallel composition of finite-state systems where hiding of actions is allowed, and for 1-safe Petri nets. The technique of the proof allows to extend this result easily to other types of non-flat systems. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | CONCUR 2003 - Concurrency Theory : 14th International Conference, Marseille, France, September 3-5, 2003. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/b11938 | en |
| dc.subject | equivalence checking | en |
| dc.subject | finite-state systems | en |
| dc.subject | complexity | en |
| dc.title | Equivalence checking of non-flat systems is EXPTIME-hard | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/b11938 | |
| dc.identifier.wos | 000185948700016 | |