uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
Uppsala University.
Uppsala University.
1994 (English)In: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, ISSN 0302-9743, Vol. 880, 243-255 p.Article in journal (Other scientific) Published
Abstract [en]

An important verification problem for concurrent systems in general is that of establishing whether one system is a correct implementation, or refinement, of another system. For untimed systems, trace inclusion (or variants such as failure inclusion) is o

Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 1994. Vol. 880, 243-255 p.
URN: urn:nbn:se:uu:diva-27258OAI: oai:DiVA.org:uu-27258DiVA: diva2:55152
Addresses: Yi W, UNIV UPPSALA, DEPT COMP SYST, BOX 325, S-75105 UPPSALA, SWEDEN.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-16

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 175 hits
ReferencesLink to record
Permanent link

Direct link