1,479 Hits in 3.9 sec

√erics: A Tool for Verifying Timed Automata and Estelle Specifications [chapter]

Piotr Dembiński, Agata Janowska, Paweł Janowski, Wojciech Penczek, Agata Półrola, Maciej Szreter, Bożena Woźna, Andrzej Zbrzezny
2003 Lecture Notes in Computer Science  
The paper presents a new tool for automated verification of Timed Automata as well as protocols written in the specification language Estelle.  ...  The current version offers an automatic translation from Estelle specifications to timed automata, and two complementary methods of reachability analysis.  ...  The architecture of √ erics is composed of the following modules (see also that verifies reachability properties over timed automata, -Splitter that generates pseudo-bisimulating models for timed automata  ... 
doi:10.1007/3-540-36577-x_20 fatcat:h2cbpz7it5cjjffbweo6hwprlq

$$2^5$$ Years of Model Checking [chapter]

Edmund M. Clarke, Qinsi Wang
2015 Lecture Notes in Computer Science  
Model Checking is an automatic verification technique for large state transition systems. It was originally developed for reasoning about finite-state concurrent systems.  ...  Model Checking and State Explosion Problem Model Checking, as a framework consisting of powerful techniques for verifying finite-state systems, was independently developed by Clarke and Emerson [22] and  ...  Then, it encodes the behavior of the given DTMC with length k and the reachability property as an SAT formula as the case for SAT-based BMC.  ... 
doi:10.1007/978-3-662-46823-4_2 fatcat:g4tbd7fribgothf2bfgajkywfe

Page 7281 of Mathematical Reviews Vol. , Issue 2004i [page]

2004 Mathematical Reviews  
reachability properties for timed automata via SAT.  ...  Summary: “The paper deals with the problem of checking reach- ability for timed automata.  ... 

Fully symbolic TCTL model checking for complete and incomplete real-time systems

Georges Morbé, Christoph Scholl
2015 Science of Computer Programming  
In order to verify timed automata with our model checking algorithm, we present two different methods to convert timed automata to FSMTs.  ...  We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables.  ...  Verifying safety properties of timed automata can be reduced to the computation of all states reachable from the initial states and checking whether an unsafe state can be reached (forward model checking  ... 
doi:10.1016/j.scico.2015.08.002 fatcat:67wt42hdv5ef3hqntyjlrejmzi

SAT-Based Analysis of Cellular Automata [chapter]

Massimo D'Antonio, Giorgio Delzanno
2004 Lecture Notes in Computer Science  
In this paper we will investigate the applicability of modern SAT solvers to this problem. For this purpose we will define an encoding of reachability problems for Cellular Automata into SAT.  ...  Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem.  ...  =Reduction of the SAT-formula via the Cone of Influence Problem C.o.I.  ... 
doi:10.1007/978-3-540-30479-1_77 fatcat:mgztaqtjtzedrfipouothqi4p4

Verifying Industrial Hybrid Systems with MathSAT

Gilles Audemard, Marco Bozzano, Alessandro Cimatti, Roberto Sebastiani
2005 Electronical Notes in Theoretical Computer Science  
In this paper, we propose a technique for bounded reachability of linear hybrid automata, based on the reduction of a bounded reachability problem to a MathSAT problem, i.e. satisfiability of a boolean  ...  Unfortunately, continuity of the physical behaviour over time, or triangular constraints, must often be assumed, which yield an undecidable class of hybrid automata.  ...  An example of property to be checked is given by (the negation of) the following formula: This is a typical safety property expressed via the LTL until operator.  ... 
doi:10.1016/j.entcs.2004.12.022 fatcat:i2h7ofew2bhcfpu4p4uo3jnshi

Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata [chapter]

Wojciech Penczek, Agata Półrola
2004 Lecture Notes in Computer Science  
Next, SAT-based verification techniques, like bounded and unbounded model checking, are discussed. The main focus is on bounded model checking for TCTL and for reachability properties.  ...  nets (TPN's) and timed automata (TA).  ...  In this section we present a SAT-based approach to ECTL y model checking over r-discretized models for timed automata, to which we refer as to models from now on.  ... 
doi:10.1007/978-3-540-27793-4_4 fatcat:eg4rwr4oujhzfkhqd4mleowrhm

Model Checking Algorithms for Markov Automata

Hassan Hatefi, Holger Hermanns
2012 Electronic Communications of the EASST  
The main challenge lies in the computation of time-bounded reachability probabilities, for which we provide a stable approximation scheme.  ...  This paper discusses the core algorithmic ingredients of a numerical model checking procedure for Markov automata with respect to a PCTL or CSL like temporal logic.  ...  AVoCS 2012 / 15 Volume 53 (2012) Model Checking Algorithms for Markov Automata  ... 
doi:10.14279/tuj.eceasst.53.783 dblp:journals/eceasst/HatefiH12 fatcat:g76i237tyrc4xjj46okd6ldjmm

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

Johan Arcile, Étienne André
2022 ACM Computing Surveys  
In this work, we review works studying security properties for timed automata in the last two decades.  ...  Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints.  ...  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

Experimental Evaluation of Classical Automata Constructions [chapter]

Deian Tabakov, Moshe Y. Vardi
2005 Lecture Notes in Computer Science  
We propose an encoding that allows this problem to be solved symbolically via a model-checker.  ...  There are several algorithms for producing the canonical DFA from a given NFA.  ...  We are grateful to Andreas Podelski for raising the question of comparing Hopcroft's and Brzozowski's algorithms.  ... 
doi:10.1007/11591191_28 fatcat:2hhksb3w4rdrfhz5523cagkfi4

CosyVerif: An Open Source Extensible Verification Environment

Etienne Andre, Yousra Lembachar, Laure Petrucci, Francis Hulin-Hubard, Alban Linard, Lom Hillah, Fabrice Kordon
2013 2013 18th International Conference on Engineering of Complex Computer Systems  
Several tools have already been integrated for the formal verification of (extensions of) Petri nets and timed automata.  ...  via the graphical interface or via an API as a Web service, and 4) offer the possibility for a developer to integrate his/her own tool without much effort, also allowing it to interact with the other  ...  timed automata [13] augmented with variables and stopwatches.  ... 
doi:10.1109/iceccs.2013.15 dblp:conf/iceccs/AndreLPHLHK13 fatcat:v6y3yrp7yngqheiboo4elf5mzi

Minimization of Visibly Pushdown Automata Using Partial Max-SAT [chapter]

Matthias Heizmann, Christian Schilling, Daniel Tischner
2017 Lecture Notes in Computer Science  
Our definition allows to merge states that have different behavior, as long as they show the same behavior for reachable equivalent stacks.  ...  We consider the problem of state-space reduction for nondeterministic weakly-hierarchical visibly pushdown automata (VPA).  ...  Two different properties were checked: reachability of an error location and termination.  ... 
doi:10.1007/978-3-662-54577-5_27 fatcat:eu6vsqt45jhm3cunyu2vlaiooy

Regular Model Checking Revisited (Technical Report) [article]

Anthony W. Lin, Philipp Rümmer
2021 arXiv   pre-print
More precisely, in this formulation the first-order part represents the verification conditions for the desired correctness property (for which we have complete solvers), whereas the existentially quantified  ...  In this contribution we revisit regular model checking, a powerful framework that has been successfully applied for the verification of infinite-state systems, especially parameterized systems (concurrent  ...  recent successful automata synthesis algorithms [36, 34, 30, 24] for safety, liveness, reachability games, and other interesting correctness properties.  ... 
arXiv:2005.00990v2 fatcat:kvmcpfh3x5actialupmareevru

Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP [chapter]

Iulian Ober
2018 Lecture Notes in Computer Science  
While bounded model checking of timed automata has been explored in the literature based on the satisfiability of Boolean constraint formulas over linear arithmetic constraints verified using SAT Modulo  ...  We study the reduction of bounded reachability analysis of timed automata (TA) to a Mixed Integer Linear Programming (MILP) problem.  ...  This paper is dedicated to Susanne Graf on the occasion of her anniversary event, as a mark of my admiration and respect for her scientific achievements and for her human qualities.  ... 
doi:10.1007/978-3-030-00244-2_18 fatcat:aohhs265b5gathk2332z7d6k4u

Multi-Robot Systems: Modeling, Specification, and Model Checking [chapter]

Ammar Mohammed, Ulrich Furbach, Frieder Stolzenburg
2010 Robot Soccer  
In particular, one can check properties on states using reachability analysis. For this we have two basic steps.  ...  It is worth mentioning that checking reachability for hybrid automata is generally undecidable.  ... 
doi:10.5772/7349 fatcat:scvgry75fnbyta67aajoot6rda
« Previous Showing results 1 — 15 out of 1,479 results