A new strategy for proving $omega$-completeness applied to process algebra

Additional Metadata
MSC	Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (msc 68Q10), Semantics (msc 68Q55), Specification and verification (program logics, model checking, etc.) (msc 68Q60), Abstract data types; algebraic specification (msc 68Q65)
Publisher	Springer
Series	Lecture Notes in Computer Science
Conference	International Conference on Concurrency Theory
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Groote, J. F. (1990). A new strategy for proving $omega$-completeness applied to process algebra. CONCUR \\\, 314–331.

Publication