Filters








16 Hits in 5.7 sec

Fast zone-based algorithms for reachability in pushdown timed automata [article]

S. Akshay, Paul Gastin, Karthik R Prakash
2021 arXiv   pre-print
In this paper, we show that a naive extension of the zone based reachability algorithm for the control state reachability problem of timed automata is not sound in the presence of a stack.  ...  To understand this better we give an inductive rule based view of the zone reachability algorithm for timed automata.  ...  Then we propose a new algorithm that modifies the zone-based algorithm to work for pushdown timed automata. This is done in three steps.  ... 
arXiv:2105.13683v2 fatcat:7sx2qa2asrh7fmud4fzjrpevwi

Three Case Studies on Verification of Infinite-State Systems [chapter]

Javier Esparza, Jörg Kreiker
2012 Modern Applications of Automata Theory  
In real-time systems, the current time -be it discrete or continuous -becomes part of the state.  ...  However, most software systems have an infinite number of reachable states due to unbounded data structures, timing information, or other factors (see below).  ...  The reachable part of the zone graph of the timed automaton modelling Fischer's algorithm is shown in Figure 1 .5.  ... 
doi:10.1142/9789814271059_0012 fatcat:skcscqj7h5db3fgudxcvvfqjca

Alternating two-way AC-tree automata

Kumar Neeraj Verma, Jean Goubault-Larrecq
2007 Information and Computation  
for intersections of such automata is fundamental.  ...  This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question  ...  Note that emptiness is decidable for one-way A-tree automata, even in polynomial time; see Lemma 17 below.  ... 
doi:10.1016/j.ic.2006.12.006 fatcat:7zobakjq4ber7fjqtgbviub6f4

Pebble-Depth [article]

Liam Jordon, Philippe Moser
2022 arXiv   pre-print
We also compare pebble-depth to other depth notions based on finite-state transducers, pushdown compressors and the Lempel-Ziv 78 compression algorithm.  ...  In this paper we introduce a new formulation of Bennett's logical depth based on pebble transducers.  ...  Given more time and resources, an algorithm could identify patterns in the structure to exploit them. Non-deep structures are referred to as being shallow.  ... 
arXiv:2009.12225v4 fatcat:j6lquzlehveatpodgfhowqbrsu

Automatic modular abstractions for template numerical constraints [article]

David Monniaux
2010 arXiv   pre-print
Our algorithms are based on new quantifier elimination and symbolic manipulation techniques.  ...  In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions.  ...  Acknowledgements We would like to thanks the anonymous referees for careful reading.  ... 
arXiv:0909.4013v2 fatcat:ekfxoelwwfgqlfljvclta3hb4i

Automatic Modular Abstractions for Template Numerical Constraints

David Monniaux, Nick Benton
2010 Logical Methods in Computer Science  
Our algorithms are based on quantifier elimination and symbolic manipulation techniques over linear arithmetic formulas.  ...  In addition to loop-free code, the same method also applies for obtaining least fixed points as functions of the precondition, which permits the analysis of loops and recursive functions.  ...  Acknowledgements We would like to thanks the anonymous referees for careful reading.  ... 
doi:10.2168/lmcs-6(3:4)2010 fatcat:ndqibc2gcvcxdjkqmf5s4nfb3a

Page 1458 of Mathematical Reviews Vol. 28, Issue Index [page]

Mathematical Reviews  
Pushdown automata. (English summary) 96k:68058 Hoogers, P. W. (with Kleijn, H. C. M.; Thiagarajan, P. S.) A trace semantics for Petri nets. (English summary) 96d:68052 Indyk, P.  ...  On the complexity of the approximate realization of continuous functions by schemes and formulas in polynomial and other bases.  ... 

29th International Conference on Data Engineering [book of abstracts]

2013 2013 IEEE 29th International Conference on Data Engineering Workshops (ICDEW)  
However, existing mix-zone proposals fail to provide effective mix-zone construction and placement algorithms that are resilient to timing and transition attacks.  ...  Automata (VPA).  ...  These volunteers welcome participants, give directions, help in the sessions and on the registration desk, and generally make sure the conference is running smoothly.  ... 
doi:10.1109/icdew.2013.6547409 fatcat:wadzpuh3b5htli4mgb4jreoika

Automated reasoning for web page layout

Pavel Panchekha, Emina Torlak
2016 SIGPLAN notices  
Automated Reasoning for Web  ...  They prove this question EXP-complete, along with some hardness results for special cases, and describe an encoding in pushdown automata, which allows using existing solvers to answer such queries.  ...  The second is developing a technique, based on auxiliary uninterpreted functions, for efficiently encoding an arbitrary run of this algorithm in QF-LRA.  ... 
doi:10.1145/3022671.2984010 fatcat:6ziskezaufdmxctzcj2qwrt6tm

Automatic synthesis of distributed transition systems [article]

Alin Stefanescu, Universität Stuttgart, Universität Stuttgart
2006
From the practical perspective, we provide prototype implementations for most of the synthesis algorithms discussed in the thesis.  ...  This thesis investigates the synthesis problem for two classes of distributed transition systems: synchronous products and asynchronous automata.  ...  for asynchronous automata modulo language equivalence for deterministic specifications is decidable in polynomial time.  ... 
doi:10.18419/opus-2573 fatcat:rzsyz7etpffa3cjszcrdxw2m6m

New verification method for embedded systems

Robert A Thacker
2012
Or perhaps it is better to say it is time to embark on a new stage of the journey. In either case, many people have helped me along the way, and deserve to be recognized. Dr.  ...  Model checking algorithms have been developed for LHPNs using both explicit zone-based methods [49, 51] as well as implicit BDD and SMT-based methods [75] .  ...  In [9] x86 executables are translated into a weighted pushdown system, which is then checked for reachability.  ... 
doi:10.26053/0h-94vb-qeg0 fatcat:dzb2ka5r4nhczgnjzxpfpfv4ui

Software Visualization

Stephan Diehl, Peter Eades, Sydney, John Stasko, Atlanta
unpublished
At Dagstuhl software enginieers and re-engineers repeatedly argued that there is a strong need for software visualization in their areas.  ...  program animation for debugging.  ...  JFLAP is a tool for creating and simulating deterministic and nondeterministic automata, pushdown automata, and 1-tape and 2-tape Turing machines.  ... 
fatcat:bhorjc6devcptoyxtjzb5ldrhe

Dagstuhl Reports, Volume 9, Issue 3, March 2019, Complete Issue [article]

2019
For example, two seconds is the threshold adopted by government agencies for risky off-road glances [1], but this threshold is based on research conducted in non-automated vehicles.  ...  the agent delivers support in the right way at the right time.  ...  For instance, if G = Z d , then one obtains blind d-counter automata; if G is a free group of rank ≥ 2, G-automata are equivalent to pushdown automata.  ... 
doi:10.4230/dagrep.9.3 fatcat:2tpapmq2rfdsjpygzyvhw2l6ei

Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142)

Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, Albert Cohen, Alastair Donaldson, Marieke Huisman, Joost-Pieter Katoen, Stephen Kobourov, Martin Nöllenburg, Monique, Sergiu Hart (+2 others)
2013 unpublished
In the last part I also mention an algorithm of Drysdale, Rote, and Sturm [1] for smooth (tangent-continuous) approximation by biarcs.  ...  This is a survey of algorithms for approximating a curve by a simpler curve, mostly by a polygon with few edges.  ...  First, the dynamic reaches Nash approximate equilibria fast (in at most cn log(n) steps for some constant c > 0).  ... 
fatcat:m7452gw4cvecbd2vi6w3uha5ai

Describing data patterns [article]

Jakob Voß, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
2017
The results can help to better understand data and its actual forms, both for consumption and creation of data. Particular domains of application include data archaeology and data literacy.  ...  These presumed concepts have been deconstructed in this thesis from a semiotic point of view. This was done by analysing data as signs, communicated in form of digital documents.  ...  application scenarios: EL has polynomial time reasoning complexity, QL supports fast query answering, and RL can be implemented using rule-based reasoning systems.  ... 
doi:10.18452/16794 fatcat:hudvzg576jggjdipfyd44o5y3m
« Previous Showing results 1 — 15 out of 16 results