On the Computational FARON MOLLER SICS, Box 1263, S-164 28 Kwta, Complexity of 13isimulation Sweden, ( fm@s~cs.se) SCOTT SUNY A. SMOLKA Brook, Stony Brook, New York, ( sas@cs.sunysb.edu). Stony In his Turing Award lecture, Juris Hartmanis eloquently discusses, among other things, the fundamental role of computational complexity theory in computer science. He goes on, in the context of describing joint work with Phil Lewis and Richard Stearns, to highlight some of the results obtained on the computational complexity of problems in formal language theory; for example, all contextfree languages are contained in TIME[ n3 ] and SPACE[log2 n]. We argue here that the computational complexity of generative devices such as grammars or automata takes on a new and interesting light when such devices are interpreted as generating (concurrent) processes rather than formal languages and the traditional notion of language equivalence is replaced by bisimulation equivalence. Bisimulation is the cornerstone of a number of theories of concurrent and distributed computing, most notably Robin Milner s Calculus of Communicating Systems (C!CS). Given that Milner received the 1991 Turing Award and that bisimulation figured prominently in his Turing Award lecture, we believe it is particularly apropos to re-examine the field of
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/on-the-computational-complexity-of-bisimulation-fmbIZXQu1c
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
On the computational complexity of bisimulation
Moller, Faron; Smolka, Scott A.
Follow ACM Computing Surveys (CSUR)
, Volume 27 (2)
Association for Computing Machinery – Jun 1, 1995
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
