Filters








533 Hits in 2.8 sec

Flat Counter Automata Almost Everywhere! [chapter]

Jérôme Leroux, Grégoire Sutre
2005 Lecture Notes in Computer Science  
This paper argues that flatness appears as a central notion in the verification of counter automata.  ...  From a theoretical view point, we prove that many known semilinear subclasses of counter automata are flat: reversal bounded counter machines, lossy vector addition systems with states, reversible Petri  ...  Counter Automata Definition 2.1.  ... 
doi:10.1007/11562948_36 fatcat:ohu77ovi7bdkdhwvq24ha47gtm

Flatness Is Not a Weakness [chapter]

Hubert Comon, Vèronique Cortier
2000 Lecture Notes in Computer Science  
We prove, in the spirit of the correspondence between automata and temporal logics, that the models of a L + p formula are recognized by a piecewise at counter machine; for each state q, at most one loop  ...  Emptiness of (piecewise) at counter machines is decidable (this follows from a result in 9]). It follows that satis ability and model-checking the negation of a formula are decidable for L + p .  ...  Flat automata are still a signi cant subclass of counter automata since, for instance, Alur and Dill's timed automata 2] can be encoded in this model 11] .  ... 
doi:10.1007/3-540-44622-2_17 fatcat:gertalxndnai7imchfxhpmfuk4

Stackless Processing of Streamed Trees

Corentin Barloy, Filip Murlak, Charles Paperman
2021 Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems  
We propose an intermediate stackless model based on register automata equipped with a single counter, used to maintain the current depth in the tree.  ...  Processing tree-structured data in the streaming model is a challenge: capturing regular properties of streamed trees by means of a stack is costly in memory, but falling back to finite-state automata  ...  L is E-flat and A-flat; d. L is almost-reversible.  ... 
doi:10.1145/3452021.3458320 fatcat:y7kerdlnu5gzhilbdxfeuam55i

FAST: acceleration from theory to practice

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
2008 International Journal on Software Tools for Technology Transfer (STTT)  
counter machines [47] and broadcast protocols [33, 34] .  ...  The class of counter systems, where variables range over integers, appears to be interesting.  ...  We are also grateful to Jonathan Billington and Lin Liu for having provided us with the CPN model of the CES service, to Jean-Michel Couvreur for giving us advice for the implementation of shared automata  ... 
doi:10.1007/s10009-008-0064-3 fatcat:3msu4gglojfpbignampzd2fz44

On the complexity of deadlock detection in families of planar nets

Bruno Durand, Anne-Cécile Fabret
1999 Theoretical Computer Science  
We are interested in some properties of massively parallel computers which we model by finite automata connected together on a 2-dimensional grid.  ...  It is almost everywhere very easy.  ...  A finite tiling is an almost everywhere blank tiling of the plane.  ... 
doi:10.1016/s0304-3975(97)00185-0 fatcat:nrwupxytjrhrjpa34fje7qpq7a

GPU Based Fluid Animation over Elastic Surface Models

Bruno Barcellos S. Coutinho, Gilson Antonio Giraldi, Antonio L. Apolinario Jr.
2009 2009 VIII Brazilian Symposium on Games and Digital Entertainment  
If an almost flat area is encountered then the water simply spreads out into the flat area, deforming it, without any extra machinery.  ...  Besides (a) Flat surface with a gaussian fluid distribution at time step t = 1400.  ... 
doi:10.1109/sbgames.2009.13 dblp:conf/sbgames/CoutinhoGA09 fatcat:t3agbtpqg5antmyvgu2wurkqk4

Becoming Automatous: Automata in The Old Curiosity Shop and Our Mutual Friend

Katherine Inglis
2008 19 : Interdisciplinary Studies in the Long Nineteenth Century  
Nell had something concrete to flee from in the shape of Quilp and the factory-town, but there is nowhere to run in Our Mutual Friend, as automatous beings seem to be everywhere.  ...  Ure attempted to counter the argument that the monotony of factory work would cause the labourer's mental stagnation, positing that artisans working within a division of labour system had to concentrate  ... 
doi:10.16995/ntn.471 fatcat:ih23t3xki5djfa7i73g365bv64

Specification Formalisms for Modern Cyber-Physical Systems (Dagstuhl Seminar 19071)

Jyotirmoy V. Deshmukh, Oded Maler, Dejan Nickovic, Michael Wagner
2019 Dagstuhl Reports  
There were arguments that logic is better for learning because it is better to understand than automata, while there were counter-arguments that automata are actually easier to understand.  ...  Spatio-temporal operators such as everywhere and somewhere can be then used.  ... 
doi:10.4230/dagrep.9.2.48 dblp:journals/dagstuhl-reports/DeshmukhMN19 fatcat:qs52xpqxbzh6vajciydqb3ujgi

Complexity of regular abstractions of one-counter languages [article]

Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K Narayan Kumar, Prakash Saivasan, Georg Zetzsche
2016 arXiv   pre-print
We study the computational and descriptional complexity of the following transformation: Given a one-counter automaton (OCA) A, construct a nondeterministic finite automaton (NFA) B that recognizes an  ...  Convention on OCA To simplify the presentation, everywhere below we focus our attention on a sublcass of OCA that we call simple onecounter automata (simple OCA).  ...  We are almost there, as j+N.k+m.d = j+N .k .  ... 
arXiv:1602.03419v1 fatcat:piatzusl5vbyfn2zii6fdt2x4m

Model Checking the Quantitative μ-Calculus on Linear Hybrid Systems

Diana Fischer, Lukasz Kaiser, Colin Stirling
2012 Logical Methods in Computer Science  
To this end, we develop new techniques for the discretisation of continuous state spaces based on a special class of strategies in model-checking games and present a reduction to a class of counter parity  ...  K, ϕ model-checking game G flat G counter-reset G value.  ...  Discrete Strategies Our goal in this section is to show that it suffices to use a simple kind of (almost) discrete strategies to approximate the value of flat interval parity games over Z ∞ .  ... 
doi:10.2168/lmcs-8(3:21)2012 fatcat:z5iyyqt2j5dr3azdx7zxfxt6xy

Abstract acceleration in linear relation analysis

Laure Gonnord, Peter Schrammel
2014 Science of Computer Programming  
., "flat counter automata", i.e., without nested loops). Moreover, the exact computation with integer variables has a very high complexity (2EXP).  ...  This example shows that the analysis can give much better results on a hybrid automata than on the corresponding discrete counter automata.  ... 
doi:10.1016/j.scico.2013.09.016 fatcat:tuu7xaqwzvgnfhfzhfj7jt3c7q

Cell Population Dynamics Modulate the Rates of Tissue Growth Processes

Gang Cheng, Belgacem B. Youssef, Pauline Markenscoff, Kyriacos Zygourakis
2006 Biophysical Journal  
The separation distance between neighboring cells is the same everywhere and decreases as the cell density increases.  ...  Division counter k d,i : The time that must elapse before the cell divides is equal to t d;i ¼ k d;i 3Dt: This counter is decremented by one at each time step, and the cell divides when k d;i ¼ 0: The  ... 
doi:10.1529/biophysj.105.063701 pmid:16299082 pmcid:PMC1367098 fatcat:5yiy5ub22vdkfpp2uyjed7sh5a

Discrete Lorentz covariance for quantum walks and quantum cellular automata

Pablo Arrighi, Stefano Facchini, Marcelo Forets
2014 New Journal of Physics  
We formalize a notion of discrete Lorentz transforms for Quantum Walks (QW) and Quantum Cellular Automata (QCA), in (1 + 1)-dimensional discrete spacetime.  ...  When h > 0, the walker moves without interaction and the counter is decreased. When the counter reaches 0, the effective coin operator is applied and the counter is reset.  ...  Over Quantum Cellular Automata General form of Quantum Cellular Automata Intuitively speaking, a Quantum Cellular Automata (QCA) is a multiple walkers QW.  ... 
doi:10.1088/1367-2630/16/9/093007 fatcat:rrcapy2byzhdxfalkdqgav6hri

On sofic groups, Kaplansky's conjectures, and endomorphisms of pro-algebraic groups [article]

Xuan Kien Phung
2019 arXiv   pre-print
We study a class of endomorphisms of pro-algebraic groups, namely algebraic group cellular automata over (G,X,K).  ...  They are cellular automata τ A^G → A^G whose local defining map is induced by a homomorphism of algebraic groups X^M → X where M⊂ G is a finite memory set of τ.  ...  , or equivalently, surjective and flat.  ... 
arXiv:1804.06631v3 fatcat:7idipeut55cvni3q2mc7c6a6ze

A theory of sampling for continuous-time metric temporal logic

Carlo A. Furia, Matteo Rossi
2010 ACM Transactions on Computational Logic  
The main results apply to "flat" formulas that do not nest temporal operators and can be applied to the problem of reducing the verification problem for MTL over continuous-time models to the same problem  ...  In Figure 2 (e), the formula holds everywhere over discrete time.  ...  Several authors considered digitization for automata-based real-time formalisms, especially timed automata [Bouajjani et al. 1994; Bošnački 1999; Maler and Pnueli 1995; Bozga et al. 1999; Beyer et al.  ... 
doi:10.1145/1838552.1838560 fatcat:rnnut4qu3vbnjnxed42fn3lzwa
« Previous Showing results 1 — 15 out of 533 results