You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Newcastle University » Outputs » Detail

Output details

11 - Computer Science and Informatics

Newcastle University

Return to search Previous output Next output

Output 89 of 100 in the submission

Article title

Step coverability algorithms for communicating systems

Type

D - Journal article

DOI

10.1016/j.scico.2010.11.003

Title of journal

Science of Computer Programming

Article number

Volume number

Issue number

7-8

First page of article

955

ISSN of journal

1872-7964

Year of publication

2012

URL

http://dx.doi.org/10.1016/j.scico.2010.11.003

Number of additional authors

Additional information

<10> The work reported in this article was undertaken as part of the EPSRC award "VERDAD: Verification-Driven Asynchronous Design” (EP/G037809/1). This article presents the first extension of the fundamental coverability tree technique invented in the1970s to the semantical model of maximal parallelism. The article was invited for journal publication as one of the best papers of FSEN'09, and contributed (together with another paper in this submission) to an invited “Blaise Pascal Chair” visiting professorship at Leiden University in 2011.

Interdisciplinary

Cross-referral requested

Research group

B - Concurrent Asynchronous Systems

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract