ARCH@ADHS最新文献

{"title":"ARCH-COMP18 Category Report: Hybrid Systems with Piecewise Constant Dynamics","authors":"Goran Frehse, A. Abate, D. Adzkiya, Lei Bu, Mirco Giacobbe","doi":"10.29007/p11g","DOIUrl":"https://doi.org/10.29007/p11g","url":null,"abstract":"","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124089359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ARCH-COMP18 Category Report: Stochastic Modelling","authors":"Alessandro Abate, Henk A. P. Blom, Nathalie Cauchi, S. Haesaert, A. Hartmanns, Kendra Lesser, Meeko Oishi, Vignesh Sivaramakrishnan, S. Soudjani, Cristian Ioan Vasile, Abraham P. Vinod","doi":"10.29007/7ks7","DOIUrl":"https://doi.org/10.29007/7ks7","url":null,"abstract":"This report presents the results of a friendly competition for formal verification and policy synthesis of stochastic models. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2018. In this first edition, we present five benchmarks with different levels of complexities and stochastic favours. We make use of six different tools and frameworks (in alphabetical order): Barrier Certificates, FAUST2, FIRM-GDTL, Modest, SDCPN modelling & MC simulation and SReachTools; and attempt to solve instances of the five different benchmark problems. Through these benchmarks, we capture a snapshot on the current state-of the art tools and frameworks within the stochastic modelling domain. We also present the challenges encountered within this domain and highlight future plans which will push forward the development of more tools and methodologies for performing formal verification and optimal policy synthesis of stochastic processes.","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125539449","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Linear Differential-Algebraic Equations (Benchmark Proposal)","authors":"Patrick Musau, Diego Manzanas Lopez, Hoang-Dung Tran, Taylor T. Johnson","doi":"10.29007/4gj7","DOIUrl":"https://doi.org/10.29007/4gj7","url":null,"abstract":"","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121142152","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Verification Challenges in F-16 Ground Collision Avoidance and Other Automated Maneuvers","authors":"Peter Heidlauf, Alexander Collins, M. Bolender, Stanley Bak","doi":"10.29007/91x9","DOIUrl":"https://doi.org/10.29007/91x9","url":null,"abstract":"Benchmark Proposal: The F-16 Fighting Falcon is a highly-maneuverable aircraft in production since the 1970s. Since then, several studies and books have investigated the aircraft’s performance and created simulation models. In this paper, we present some of these models as a verification challenge, providing MATLAB and Python code to simulate an F-16 performing ground collision avoidance as well as other autonomous maneuvers. The aircraft model and inner-loop controller has 16 continuous variables with piecewise nonlinear differential equations. Autonomous maneuvers are performed by an outer-loop controller using finite-state machines with guards involving the continuous variables. Passfail specifications are provided based on the aircraft flight limits and boundaries of the model. This model aims to be a starting point for analyzing detailed behaviors of aerospace systems.","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122323233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Lane change maneuver for autonomous vehicles (Benchmark Proposal)","authors":"Nikolaos Kekatos, Daniel Hess, Goran Frehse","doi":"10.29007/5hxt","DOIUrl":"https://doi.org/10.29007/5hxt","url":null,"abstract":"Lane changes are known to be risky maneuvers both for autonomous vehicles and human drivers since they require changes in longitudinal and lateral velocities in the presence of other moving vehicles. In this paper, we propose a benchmark modeling a cooperative lane change maneuver that involves four fully autonomous vehicles; three in the left lane and one in the right. The vehicle driving in the right lane aims to move to the left lane while avoiding a collision with the other vehicles. Each vehicle is equipped with sensors and can also communicate with its neighboring vehicles. The vehicle dynamics are described by a dynamic bicycle model and each vehicle is equipped with a linear low-level controller that regulates its own longitudinal and lateral behavior. To guarantee that the maneuver is safe and the traffic rules are enforced, we employ a cooperative driving control scheme (in the spirit of supervisory logic) that decides the actions of each vehicle.","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131444043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ARCH-COMP18 Category Report: Hybrid Systems Theorem Proving","authors":"Stefan Mitsch, A. Sogokon, Yong Kiam Tan, André Platzer, Hengjun Zhao, Xiangyu Jin, Shuling Wang, N. Zhan","doi":"10.29007/vjh3","DOIUrl":"https://doi.org/10.29007/vjh3","url":null,"abstract":"","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114614546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ARCH-COMP18 Category Report: Bounded Model Checking of Hybrid Systems with Piecewise Constant Dynamics","authors":"Lei Bu, Rajarshi Ray, Stefan Schupp","doi":"10.29007/q5tq","DOIUrl":"https://doi.org/10.29007/q5tq","url":null,"abstract":"","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129755589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Discrete-Space Analysis of Partial Differential Equations","authors":"Hoang-Dung Tran, Tianshu Bao, Taylor T. Johnson","doi":"10.29007/fvpp","DOIUrl":"https://doi.org/10.29007/fvpp","url":null,"abstract":"There are numerous examples that arise and benefit from the reachability analysis problem. In cyber-physical systems (CPS), most dynamic phenomena are described as systems of ordinary differential equations (ODEs). Previous work has been done using zonotopes, support functions, and other geometric data structures to represent subsets of the reachable set and have been shown to be efficient. Meanwhile, a wide range of important control problems are more precisely modeled by partial differential equations (PDEs), even though not much attention has been paid to their reachability analyses. This reason motivates us to investigate the properties of these equations, especially from the reachability analysis and verification perspectives. In contrast to ODEs, PDEs have other space variables that also affect their behaviors and are more complex. In this paper, we study the discrete-space analysis of PDEs. Our ultimate goal is to propose a set of PDE reachability analysis benchmarks, and present preliminary analysis of different dimensional heat equations and wave equations. Finite difference methods (FDMs) are utilized to approximate the derivative at each mesh point with explicit order of errors. FDM will convert the PDE to a system of ODEs depending on the type of boundary conditions and discretization scheme chosen. After that, the problem can be treated as a common reachability problem and relevant conceptions and approaches can be applied and evaluated directly. We used SpaceEx to generate the plots and reachable regions for these equations given inputs and the series of results are shown and analyzed.","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123769711","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Verification of Continuous Time Recurrent Neural Networks (Benchmark Proposal)","authors":"Patrick Musau, Taylor T. Johnson","doi":"10.29007/6czp","DOIUrl":"https://doi.org/10.29007/6czp","url":null,"abstract":"This manuscript presents a description and implementation of two benchmark problems for continuous-time recurrent neural network (RNN) verification. The first problem deals with the approximation of a vector field for a fixed point attractor located at the origin, whereas the second problem deals with the system identification of a forced damped pendulum. While the verification of neural networks is complicated and often impenetrable to the majority of verification techniques, continuous-time RNNs represent a class of networks that may be accessible to reachability methods for nonlinear ordinary differential equations (ODEs) derived originally in biology and neuroscience. Thus, an understanding of the behavior of a RNN may be gained by simulating the nonlinear equations from a diverse set of initial conditions and inputs, or considering reachability analysis from a set of initial conditions. The verification of continuous-time RNNs is a research area that has received little attention and if the research community can achieve meaningful results in this domain, then this class of neural networks may prove to be a superior approach in solving complex problems compared to other network architectures. Category: Academic Difficulty: High 1 Context and Origins Artificial Neural Networks have demonstrated an effective and powerful ability to achieve success in numerous contexts, such as adaptive control [43], autonomous vehicles, evolutionary robotics, pattern recognition, image classification, and nonlinear system identification and control [38] [18]. Despite this success, there have been reservations about incorporating them into safety critical systems [23] due to their susceptibility to unexpected and errant behavior from a slight perturbation in their inputs and initial conditions [42] [37]. Typically, neural networks are viewed as \"black boxes\" since the underlying operation of the neuron activations is often indiscernible to the creators of the network [10]. In light of these challenges, there has been significant work towards obtaining formal guarantees about the behavior of neural networks [25]. However, the majority of verification schemes have only been able to deal with neural networks that make use of piecewise-linear activation functions [7]. This is due to the great difficulty exhibited in obtaining formal guarantees for even simple properties of neural networks. In fact, neural network verification has been demonstrated to be an NP-complete problem, and while G. Frehse (ed.), ARCH18 (EPiC Series in Computing, vol. 54), pp. 196–207 Verification of Continuous Time Recurrent Neural Networks (Benchmark Proposal) Musau and Johnson techniques that make use of satisfiability modulo theories [35], mixed integer programming [41], robustness testing [4], and linear programming [13] [37] have been able to deal with small networks, they are incapable of dealing with the complexity and scale of the majority of networks present in real-life applicatio","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125940119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ARCH-COMP18 Category Report: Results on the Falsification Benchmarks","authors":"Adel Dokhanchi, Shakiba Yaghoubi, Bardh Hoxha, Georgios Fainekos, G. Ernst, Zhenya Zhang, Paolo Arcaini, I. Hasuo, Sean Sedwards","doi":"10.29007/t85q","DOIUrl":"https://doi.org/10.29007/t85q","url":null,"abstract":"This report presents the outcomes of the 2018 friendly competition in the ARCH workshop for the category of falsification of temporal logic specifications over Cyber-Physical Systems.","PeriodicalId":236469,"journal":{"name":"ARCH@ADHS","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128255875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}