9783030014605.Pdf
Total Page：16
File Type：pdf, Size：1020Kb
Cliff Jones Ji Wang Naijun Zhan (Eds.) Festschrift Symposium on Real-Time and Hybrid Systems LNCS 11180 Essays Dedicated to Professor Chaochen Zhou on the Occasion of His 80th Birthday 123 Lecture Notes in Computer Science 11180 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zurich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology Madras, Chennai, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Cliff Jones • Ji Wang • Naijun Zhan (Eds.) Symposium on Real-Time and Hybrid Systems Essays Dedicated to Professor Chaochen Zhou on the Occasion of His 80th Birthday 123 Editors Cliff Jones Naijun Zhan Newcastle University Institute of Software, CAS Newcastle Beijing UK China Ji Wang National University of Defense Technology Changsha China ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notes in Computer Science ISBN 978-3-030-01460-5 ISBN 978-3-030-01461-2 (eBook) https://doi.org/10.1007/978-3-030-01461-2 Library of Congress Control Number: 2018955709 LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues © Springer Nature Switzerland AG 2018 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations. Cover illustration: Z. Chaochen and M. R. Hansen (Eds.), Duration Calculus, paragraph of page 156. This Springer imprint is published by the registered company Springer Nature Switzerland AG The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland Above: Chaochen Zhou together with his wife Yuping Zhang Below: Chaochen Zhou and his wife together with Dines Bjørner and Anders Ravn. The photographs are published with permission. Preface In October 2017, friends, colleagues and former students met in honour of Professor Zhou Chaochen’s 80th birthday. The conference in Changsha heard papers on a range of topics to which Chaochen had made his own scientific contributions. This volume contains papers from most of the speakers at the memorable event. Zhou Chaochen has had a distinguished international career that has addressed the foundations of real-time and hybrid systems as well as distributed computing. To single out just one of his many scientific insights, his seminal contribution to the Duration Calculus has led to many developments and wide application. Internationally, he has worked in Oxford with Professor Tony Hoare, in Denmark with Professor Dines Bjørner and at the United Nations University International Institute for Software Technology (UNU/IIST) in Macau. At the latter, of these he was a Principal Research Fellow and then Director of the Institute from 1992–2002. Recognition for his contributions include being elected a member of the Chinese Academy of Sciences and a winner of the National Award for Natural Sciences. The warm personal praise and gratitude from his friends and colleagues reflected another dimension of Chaochen’s impact on the scientific community: his students recognised the key impact of his teaching and his colleagues such as Anders Ravn spoke warmly of his penetrating and constructive criticism. Everyone at the Changsha event had special stories of friendship and help from both Chaochen and his charming wife, Yuping Zhang. The editors and all participants at the memorable conference wish Yuping and Chaochen many more years of happiness. July 2018 Cliff Jones Ji Wang Naijun Zhan Organization Program Committee Yunwei Dong Northwestern Polytechnical University, China Wenfei Fan The University of Edinburgh, UK Martin Fränzle University of Oldenburg, Germany Cliff Jones Newcastle University, UK Xiaoshan Li University of Macau, SAR China Xuandong Li Nanjing University, China Xinxin Liu Institute of Software, Chinese Academy of Sciences, China Zhiming Liu Southwest University, China Ernst-Ruediger University of Oldenburg, Germany Olderog Anders Ravn Aalborg University, Denmark Ji Wang National University of Defense Technology, China Mingsheng Ying University of Technology Sydney, Australia Naijun Zhan Institute of Software, Chinese Academy of Sciences, China Additional Reviewers Ahmad, Ehsan Li, Yangjia Bu, Lei Liu, Wanwei Chen, Mingshuai Yin, Liangze Contents Think Sequential, Run Parallel . 1 Wenfei Fan, Muyang Liu, Ruiqi Xu, Lei Hou, Dongze Li, and Zizhong Meng Concurrency: Handling Interference Formally . 26 Cliff B. Jones Decidability of the Initial-State Opacity of Real-Time Automata . 44 Lingtai Wang and Naijun Zhan Domain Science and Engineering A Review of 10 Years Work and a Laudatio The ZCC Fest, 20 October 2017, Changsha, China . 61 Dines Bjørner HAT: Analyzing Linear Hybrid Automata as Labelled Transition System . 85 Lei Bu, Hui Jiang, Xin Chen, Enyi Tang, and Xuandong Li Overview: System Architecture Virtual Integration based on an AADL Model . 105 Yunwei Dong, Xiaomin Wei, and Mingrui Xiao Characterization and Verification of Stuttering Equivalence . 116 Xinxin Liu and Wenhui Zhang QjSIi : A Quantum Programming Environment . 133 Shusen Liu, Xin Wang, Li Zhou, Ji Guan, Yinan Li, Yang He, Runyao Duan, and Mingsheng Ying The Demon, the Gambler, and the Engineer: Reconciling Hybrid-System Theory with Metrology . 165 Martin Fränzle and Paul Kröger Linking Theories of Probabilistic Programming. 186 He Jifeng Space for Traffic Manoeuvres: An Overview . 211 Ernst-Rüdiger Olderog Cloud Robotics: A Distributed Computing View. 231 Wang Huaimin, Ding Bo, and Jie Xu XII Contents Analyzing Interrupt Handlers via Interprocedural Summaries . 246 Xueguang Wu, Liqian Chen, and Ji Wang Author Index ............................................ 263 Think Sequential, Run Parallel B B B Wenfei Fan1,2( ),MuyangLiu2, Ruiqi Xu1, Lei Hou2( ), Dongze Li2( ), B and Zizhong Meng2( ) 1 University of Edinburgh, Edinburgh, UK [email protected] 2 Beihang University, Beijing, China {houlei,lidz}@act.buaa.edu.cn, [email protected] Abstract. Parallel computation is often a must when processing large- scale graphs. However, it is nontrivial to write parallel graph algorithms with correctness guarantees. This paper presents the programming model of GRAPE,aparallelGRAPhEngine [19]. GRAPE allows users to “plug in” sequential (single-machine) graph algorithms as a whole, and it par- allelizes the algorithms across a cluster of processors. In other words, it simplifies parallel programming for graph computations, from think parallel to think sequential. Under a monotonic condition, it guarantees to converge at correct answers as long as the sequential algorithms are correct. We present the foundation underlying GRAPE, based on simulta- neous fixpoint computation. As examples, we demonstrate how GRAPE parallelizes our familiar sequential graph algorithms. Furthermore, we show that in addition to its programming simplicity, GRAPE achieves performance comparable to the state-of-the-art graph systems. 1 Introduction There has been increasing demand for graph computations, e.g., graph traversal, connectivity, pattern matching, and collaborative filtering. Indeed, graph compu- tations have found prevalent use in mobile network analysis, pattern recognition, knowledge discovery, transportation networks, social media marketing and fraud detection, among other things. In addition, real-life graphs are typically big, eas- ily having billions of nodes and trillions of edges [24]. With these comes the need for parallel graph computations. In response to the need, several parallel graph systems have been developed, e.g., Pregel [33], GraphLab [22,32], Trinity [42], GRACE [47], Blogel [50], Giraph++ [44], and GraphX [23]. However, users often find it hard to write and debug parallel graph programs using these systems. The most popular programming model for parallel graph algorithms is the vertex-centric model, pioneered by Pregel and GraphLab. For