| dc.contributor.author | Ying Mingsheng | en_US |
| dc.contributor.editor | en_US | |
| dc.date.accessioned | 2010-05-28T09:36:40Z | |
| dc.date.available | 2010-05-28T09:36:40Z | |
| dc.date.issued | 2001 | en_US |
| dc.identifier | 2008004715 | en_US |
| dc.identifier.citation | Ying Mingsheng 2001, 'Topology in process calculus : approximate correctness and infinite evolution of concurrent programs',Springer, New York | en_US |
| dc.identifier.issn | 9780387950921 | en_US |
| dc.identifier.other | A1 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10453/7767 | |
| dc.description.abstract | en_US | |
| dc.language | en_US | |
| dc.publisher | Springer | en_US |
| dc.relation.isbasedon | en_US | |
| dc.title | Topology in process calculus : approximate correctness and infinite evolution of concurrent programs | en_US |
| dc.parent | en_US | |
| dc.journal.volume | en_US | |
| dc.journal.number | en_US | |
| dc.publocation | New York | en_US |
| dc.identifier.startpage | en_US | |
| dc.identifier.endpage | en_US | |
| dc.cauo.name | FEIT.School of Systems, Management and Leadership | en_US |
| dc.conference | Verified OK | en_US |
| dc.for | 080203 | en_US |
| dc.personcode | 103396 | en_US |
| dc.percentage | 000050 | en_US |
| dc.classification.name | Computational Logic and Formal Languages | en_US |
| dc.classification.type | FOR-08 | en_US |
| dc.edition | en_US | |
| dc.custom | en_US | |
| dc.date.activity | en_US | |
| dc.location.activity | en_US | |
| dc.description.keywords | en_US | |
| dc.staffid | Tsinghua University | en_US |