Output details
11 - Computer Science and Informatics
Newcastle University
Return to search
Output 0 of 0 in the submission
Article title
Step coverability algorithms for communicating systems
Type
D - Journal article
Title of journal
Science of Computer Programming
Article number
-
Volume number
77
Issue number
7-8
First page of article
955
ISSN of journal
1872-7964
Year of publication
2012
Number of additional authors
1
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
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-