scholarly journals Exact Incremental Analysis of Timed Automata with an SMT-Solver

2011 ◽  
pp. 177-192 ◽  
Author(s):  
Bahareh Badban ◽  
Martin Lange
Keyword(s):  
Timed Automata ◽  
Incremental Analysis ◽  
Smt Solver

Practical Approach in Verification of Security Systems Using Satisfiability Modulo Theories

2020 ◽  
Author(s):  
Agnieszka M Zbrzezny ◽  
Sabina Szymoniak ◽  
Miroslaw Kurkowski
Keyword(s):  
Timed Automata ◽  
Security Protocols ◽  
Satisfiability Modulo Theories ◽  
New Method ◽  
Security Systems ◽  
Smt Solver ◽  
Novel Method ◽  
Important Time ◽  
Reachability Property ◽  
Automata Network

Abstract The paper presents a novel method for the verification of security protocols’ (SPs)time properties. The new method uses a translation to satisfiability modulo theories (SMT) problem. In our approach, we model protocol users’ behaviours using networks of synchronized timed automata. Suitably specified correctness properties are defined as a reachability property of some chosen states in an automata network. Then, the network of timed automata and the property are translated to an SMT problem and checked using an SMT-solver and a BMC algorithm. We consider the most important time properties of protocol executions using specially constructed time conditions. The new method was also implemented and experimentally evaluated for six well-known SPs. We also compared our new SMT-based technique with the corresponding SAT-based approach.

Engineering Theories with Z3

10.29007/x7b4 ◽  
2018 ◽  
Author(s):  
Nikolaj Bjorner
Keyword(s):  
Satisfiability Modulo Theories ◽  
Smt Solver ◽  
Testing Tools ◽  
Software And Hardware ◽  
Design And Testing

Modern Satisfiability Modulo Theories (SMT)solvers are fundamental to many programanalysis, verification, design and testing tools. They are a goodfit for the domain of software and hardware engineering becausethey support many domains that are commonly used by the tools.The meaning of domains are captured by theories that can beaxiomatized or supported by efficient <i>theory solvers</i>.Nevertheless, not all domains are handled by all solvers andmany domains and theories will never be native to any solver.We here explore different theories that extend MicrosoftResearch's SMT solver Z3's basicsupport. Some can be directly encoded or axiomatized,others make use of user theory plug-ins.Plug-ins are a powerful way for tools to supply their custom domains.

Modeling and Verifying Services of Internet of Things Based on Timed Automata

2011 ◽  
Vol 34 (8) ◽  
pp. 1365-1377 ◽  
Author(s):  
Li-Xing LI ◽  
Zhi JIN ◽  
Ge LI
Keyword(s):  
Internet Of Things ◽  
Timed Automata

scholarly journals Priced Timed Automata Models for Control of Intelligent Product Agents in Manufacturing Systems

2020 ◽  
Vol 53 (4) ◽  
pp. 136-142
Author(s):  
Ilya Kovalenko ◽  
Dawn Tilbury ◽  
Kira Barton
Keyword(s):  
Manufacturing Systems ◽  
Timed Automata ◽  
Intelligent Product

scholarly journals Adaptive Cruise Control with Timed Automata

2020 ◽  
Vol 53 (2) ◽  
pp. 1918-1923
Author(s):  
Mustafa Yavuz Kara ◽  
Ebru Aydin Gol
Keyword(s):  
Adaptive Cruise Control ◽  
Timed Automata ◽  
Cruise Control

scholarly journals Configurable verification of timed automata with discrete variables

2020 ◽  
Author(s):  
Tamás Tóth ◽  
István Majzik
Keyword(s):  
Timed Automata ◽  
Empirical Evaluation ◽  
Real Time Systems ◽  
Discrete Variables ◽  
Reachability Problem ◽  
Abstraction Refinement ◽  
Dependent Behavior ◽  
Wide Range ◽  
Time Systems ◽  
Lazy Abstraction

AbstractAlgorithms and protocols with time dependent behavior are often specified formally using timed automata. For practical real-time systems, besides real-valued clock variables, these specifications typically contain discrete data variables with nontrivial data flow. In this paper, we propose a configurable lazy abstraction framework for the location reachability problem of timed automata that potentially contain discrete variables. Moreover, based on our previous work, we uniformly formalize in our framework several abstraction refinement strategies for both clock and discrete variables that can be freely combined, resulting in many distinct algorithm configurations. Besides the proposed refinement strategies, the configurability of the framework allows the integration of existing efficient lazy abstraction algorithms for clock variables based on $${\textit{LU}}$$ LU -bounds. We demonstrate the applicability of the framework and the proposed refinement strategies by an empirical evaluation on a wide range of timed automata models, including ones that contain discrete variables or diagonal constraints.

scholarly journals Randomised testing of a microprocessor model using SMT-solver state generation

2016 ◽  
Vol 118 ◽  
pp. 60-76 ◽  
Author(s):  
Brian Campbell ◽  
Ian Stark
Keyword(s):  
Smt Solver ◽  
State Generation
Sign in / Sign up

Export Citation Format

Share Document