Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.
Record link: 
http://hdl.handle.net/20.500.12708/55315
-
Title: 
On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability
-
Citation: 
Konnov, I., Veith, H., & Widder, J. (2014). On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability. In CONCUR 2014 – Concurrency Theory (pp. 125–140). https://doi.org/10.1007/978-3-662-44584-6_10
-
Publisher DOI: 
10.1007/978-3-662-44584-6_10
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Konnov, Igor 
Veith, Helmut 
Widder, Josef 
-
Organisational Unit: 
E192-04 - Forschungsbereich Formal Methods in Systems Engineering 
E192 - Institut für Logic and Computation 
-
Published in: 
CONCUR 2014 – Concurrency Theory 
-
Date (published): 
2014
-
Event name: 
International Conference on Concurrency Theory (CONCUR) 
-
Event date: 
3-Sep-2012 - 8-Sep-2012
-
Event place: 
Newcaslte upon Tyne, UK, EU
-
Number of Pages: 
16
-
Peer reviewed: 
Yes
-
Research Areas: 
Logic and Computation: 70%
Computer Engineering and Software-Intensive Systems: 20%
Distributed and Parallel Systems: 10%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

217
checked on Nov 23, 2023

Google ScholarTM

Check