155 Hits in 4.1 sec

SMT-based Safety Verification of Parameterised Multi-Agent Systems [article]

Paolo Felli and Alessandro Gianola and Marco Montali
2020 arXiv   pre-print
We solve this problem via infinite-state model checking based on satisfiability modulo theories (SMT), relying on the theory of array-based systems: we present parameterised MASs as particular array-based  ...  In this paper we study the verification of parameterised multi-agent systems (MASs), and in particular the task of verifying whether unwanted states, characterised as a given state formula, are reachable  ...  and the long-standing tradition of SMT-based model checking for array-based systems.  ... 
arXiv:2008.04774v2 fatcat:puoxlkgsfbgjjpgob2ie7spjv4

Proving Parameterized Systems Safe by Generalizing Clausal Proofs of Small Instances [chapter]

Michael Dooley, Fabio Somenzi
2016 Lecture Notes in Computer Science  
We describe an approach to proving safety properties of parameterized reactive systems.  ...  Clausal inductive proofs for small instances are generalized to quantified formulae, which are then checked against the whole family of systems.  ...  The authors thank Aaron Bradley, who suggested the extraction of templates from IC3 proofs and discussed parameterized verification with them.  ... 
doi:10.1007/978-3-319-41528-4_16 fatcat:sqwnvgep6zcijglcfwldoaigxu

An SMT Theory of Fixed-Point Arithmetic [chapter]

Marek Baranowski, Shaobo He, Mathias Lechner, Thanh Son Nguyen, Zvonimir Rakamarić
2020 Lecture Notes in Computer Science  
We implement the two decision procedures, and evaluate our implementations using existing mature SMT solvers on a benchmark suite we created.  ...  We also describe two decision procedures for this theory: one based on the theory of bit-vectors and the other on the theory of reals.  ...  However, this format allows for custom precision systems to be implemented efficiently in software-fixed-point arithmetic operations can be implemented in a much smaller amount of integer arithmetic operations  ... 
doi:10.1007/978-3-030-51074-9_2 fatcat:fqu6rnvytba55mwmfh4ugcp37e

Real-Time Rewriting Logic Semantics for Spatial Concurrent Constraint Programming [chapter]

Sergio Ramírez, Miguel Romero, Camilo Rocha, Frank Valencia
2018 Lecture Notes in Computer Science  
formulas on the shared variables of the system that are under the control of SMT decision procedures.  ...  In these systems, agents can run processes in different computational spaces (e.g., containers) while subject to real-time requirements (e.g., upper bounds in the execution time of a given operation),  ...  The authors would like to thank the anonymous referees for their helpful comments. The first author was partially supported by Colciencias via the project  ... 
doi:10.1007/978-3-319-99840-4_13 fatcat:ne5ti4qi6fdodl6cqwarn2ouza

Implan: Scalable Incremental Motion Planning for Multi-Robot Systems

Indranil Saha, Rattanachai Ramaithitima, Vijay Kumar, George J. Pappas, Sanjit A. Seshia
2016 2016 ACM/IEEE 7th International Conference on Cyber-Physical Systems (ICCPS)  
To cope with the complexity of the problem, we introduce an incremental algorithm based on an SMT solver, where we divide the robots into small groups based on a priority assignment algorithm.  ...  We consider the collision-free motion planning problem for a group of robots using a library of motion primitives.  ...  RELATED WORK The path planning problem for a multi-agent system traditionally takes either a centralized or a decentralized approach.  ... 
doi:10.1109/iccps.2016.7479105 dblp:conf/iccps/SahaR0PS16 fatcat:tehc2v64ejelli34i4z7ldjui4

Runtime Verification Past Experiences and Future Projections [chapter]

Klaus Havelund, Giles Reger, Grigore Roşu
2019 Lecture Notes in Computer Science  
The discipline covers such topics as specificationbased monitoring, where single executions are checked against formal specifications; predictive runtime analysis, where properties about a system are predicted  ...  The paper attempts to draw lessons learned from this work, and to project expectations for the future of the field.  ...  Vector-Clock Based Algorithms: From JMPaX to jPredictor A series of sound predictive runtime analysis algorithms and tools have been proposed for multi-threaded systems about a decade ago, based on vector  ... 
doi:10.1007/978-3-319-91908-9_25 fatcat:owudlqherneptb7smodwctj37y

Programmatically Interpretable Reinforcement Learning [article]

Abhinav Verma, Vijayaraghavan Murali, Rishabh Singh, Pushmeet Kohli, Swarat Chaudhuri
2019 arXiv   pre-print
We propose a new method, called Neurally Directed Program Search (NDPS), for solving the challenging nonsmooth optimization problem of finding a programmatic policy with maximal reward.  ...  We evaluate NDPS on the task of learning to drive a simulated car in the TORCS car-racing environment.  ...  This implementation is based on the system presented in (Geramifard et al., 2015) .  ... 
arXiv:1804.02477v3 fatcat:3hydz34zurb4xcr35v6hlkmuvi

Can Model Checking Assure, Distributed Autonomous Systems Agree? An Urban Air Mobility Case Study

Anubhav Gupta, Siddhartha Bhattacharyya, S. Vadivel
2020 International Journal of Advanced Computer Science and Applications  
Advancement in artificial intelligence, internet of things and information technology have enabled the delegation of execution of autonomous services to autonomous systems for civil applications.  ...  . decisions with mutual consent without the interference of any central server or agent.  ...  Model checking is a method for checking whether a model of a system meets a given specification (correctness).  ... 
doi:10.14569/ijacsa.2020.0111208 fatcat:2l27u2gzlba2rjsgawhitj6cli

Verifying temporal specifications of Java programs

Francesco Spegni, Luca Spalazzi, Giovanni Liva, Martin Pinzger, Andreas Bollin
2020 Software quality journal  
In this work, we show how to exploit modern SMT solvers together with static analysis in order to produce a network of timed automata approximating the temporal behavior of a set of Java threads.  ...  Many Java programs encode temporal behaviors in their source code, typically mixing three features provided by the Java language: (1) pausing the execution for a limited amount of time, (2) waiting for  ...  His present research areas include formal methods and model checking applied to software engineering, cybersecurity and privacy, and multi-agent systems.  ... 
doi:10.1007/s11219-019-09488-9 fatcat:p5wc5hgfenb5fbtur2ik4qu3h4

Timed automata as a formalism for expressing security: A survey on theory and practice

Johan Arcile, Étienne André
2022 ACM Computing Surveys  
Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints.  ...  While timed automata were originally designed for safety (in the wide sense of correctness w.r.t. a formal property), they were progressively used in a number of works to guarantee security properties.  ...  We would like to thank anonymous reviewers for their useful comments, as well as Jaime Arias and Laure Petrucci for a feedback on their recent works.  ... 
doi:10.1145/3534967 fatcat:bq3focapvzh77lf5qvdx4oskcm

Answer Set Planning: A Survey [article]

Tran Cao Son and Enrico Pontelli and Marcello Balduccini and Torsten Schaub
2022 arXiv   pre-print
The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems.  ...  The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.  ...  Tran Son's and Marcello Balduccini's contribution was made possible in part through the help and support of NIST via cooperative agreement 70NANB21H167.  ... 
arXiv:2202.05793v1 fatcat:ccygquzaazfljduncfjykduwne

A case study of planning for smart factories

Stefan Edelkamp, Christoph Greulich
2018 International Journal on Software Tools for Technology Transfer (STTT)  
We compare the results with a randomized exploration based on recent advances in Monte Carlo search.  ...  In this work, we propose the application of the SPIN software model checker to a multiagent system that controls the industrial production of goods.  ...  For the standard setting of trace optimization for safety checking (option SAFETY), we compiled the model as follows. ./spin -a; gcc -O2 -DREACH -DSAFETY -o pan pan.c; .  ... 
doi:10.1007/s10009-018-0498-1 fatcat:xsktxjkbbfhjnlihpabimvsfh4

Formal Certification Methods for Automated Vehicle Safety Assessment [article]

Tong Zhao, Ekim Yurtsever, Joel Paulson, Giorgio Rizzoni
2022 arXiv   pre-print
We also propose a unified scenario coverage framework that can provide either a formal or sample-based estimate of safety verification for full AVs.  ...  evolution of the system to provide guarantees.  ...  (s) [86] maxFRS of each agent communicated through real-time collision-free guarantee for a group of autonomous agents a decentralized network [87  ... 
arXiv:2202.02818v2 fatcat:spgyrglbwjhshl2n43kyx722fa

Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System [chapter]

Christoph Greulich, Stefan Edelkamp
2017 Lecture Notes in Computer Science  
In this paper we introduce a novel application of model checking to find optimal planning solutions for a flow production system.  ...  Originally controlled by a multiagent system, the production system consists of autonomous products and asynchronous production stations with limited space for waiting products.  ...  This research was partly funded by the International Graduate School for Dynamics in Logistics (IGS), University of Bremen, Germany.  ... 
doi:10.1007/978-3-319-53354-4_2 fatcat:e5znhbysyfbobiauzf23tbep4i

Higher-Order Quantifier Elimination, Counter Simulations and Fault-Tolerant Systems

Silvio Ghilardi, Elena Pagani
2020 Journal of automated reasoning  
We implemented our procedure for a simplified (but still expressive) subfragment and we showed that our method is able to successfully handle verification benchmarks from various sources with interesting  ...  We develop quantifier elimination procedures for fragments of higher order logic arising from the formalization of distributed systems (especially of fault-tolerant ones).  ...  artificial intelligence and software engineering to agent-based systems and the semantic web.  ... 
doi:10.1007/s10817-020-09578-5 fatcat:zl6wjtp74jalxaweaw4p4uk23m
« Previous Showing results 1 — 15 out of 155 results