Filters








14,409 Hits in 2.5 sec

A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata

Parosh A. Abdulla, Lukáš Holík, Lisa Kaati, Tomáš Vojnar
2009 Electronical Notes in Theoretical Computer Science  
A Uniform (Bi-)Simulation Based Framework for Reducing Tree Automata -p.17/17  ...  1 ≤ i ≤ n. ... ... for each a q 1 q i q n q A Uniform (Bi-)Simulation Based Framework for Reducing Tree Automata -p.6/17 Downward (Bi-)Simulation A preorder D ⊆ Q × Q is a downward simulation if qDr implies  ... 
doi:10.1016/j.entcs.2009.08.026 fatcat:gekx27kk6zakbpbsz573hkydre

Algebras and Languages for Molecular Programming [chapter]

Luca Cardelli
2010 Lecture Notes in Computer Science  
This is a uniform population of identical automata, but heterogeneous populations of interacting automata can be similarly handled.  ...  [A,A])* | A | A | B | C A | A | B | C A | A | B | C A | A | B | o Validate our compilers and theoretical framework with experimental systems utilizing molecular programs with 10 to 100 times the number  ...  Interacting Automata Interacting Automata This is a uniform population of identical automata, but heterogeneous populations of interacting automata can be similarly handled.  ... 
doi:10.1007/978-3-642-13523-1_2 fatcat:lrm4kdniw5ef5im3ca3smk7cti

Coevolution of rules and topology in cellular automata

Christian Darabos, Craig O. Mackenzie, Marco Tomassini, Mario Giacobini, Jason H. Moore
2013 Proceeding of the fifteenth annual conference companion on Genetic and evolutionary computation conference companion - GECCO '13 Companion  
AperTO -Archivio Istituzionale Open Access dell'Università di Torino Coevolution of rules and topology in cellular automata / Darabos C. ; Mackenzie C.O.; Tomassini M.; Giacobini M.; Moore J.H.  ...  Graham at Dartmouth College for her help in editing this article. Financial support of the NIH (grants AI59694, LM010098 and LM009012) and of local research founding of the University of Torino.  ...  Cellular automata (CAs) have been used for years as a rudimentary proxy for biological organisms.  ... 
doi:10.1145/2464576.2464638 dblp:conf/gecco/DarabosMTGM13 fatcat:nua5rqfdlfeehnez5eggkr2jou

Evolutionary Synthesis of Cellular Automata

Jernej Zupanc, Bogdan Filipi�
2011 Journal of Computing and Information Technology  
Two of the typical evolutionary approaches to synthesizing cellular automata are the evolution of a single automaton and a genetic algorithm that evolves a population of automata.  ...  In this paper we address the second approach and develop a genetic algorithm that evolves a population of cellular automata.  ...  Introduction Cellular automata are a framework for modeling complex systems.  ... 
doi:10.2498/cit.1001419 fatcat:ltqqiiky3bhdrdq7jmtyvbxl54

Modeling of Magnetostriction of Soft Elastomer

Andriushchenko Petr, Afremov Leonid, Chernova Mariya
2014 Journal of Physics, Conference Series  
For purposes of studying of magnetostriction the model of movable cellular automata (MCA), in which a real heterogeneous material is an ensemble of interacting elements of finite size - automata, is used  ...  magnetic field acting on the i-th automata with some magnetic moment; and normal and tangential interaction force between a pair of i and j automata.  ...  Introduction At present time there is a necessity for new magnetic materials with properties, substantially depend on a structure (for example, distribution of particles magnetic moments, volumes, coordinates  ... 
doi:10.1088/1742-6596/490/1/012168 fatcat:rzeklmxk7vcpflrs2sxppvk45i

Approximate Learning of Limit-Average Automata

Jakub Michaliszyn, Jan Otop, Michael Wagner
2019 International Conference on Concurrency Theory  
The abovementioned results are shown for the uniform distribution on words. We briefly discuss learning over different distributions.  ...  We study approximate learning problems for limit-average automata in two settings: passive and active.  ...  However, variants of the PAC framework have been considered where the distribution on samples is uniform [24] .  ... 
doi:10.4230/lipics.concur.2019.17 dblp:conf/concur/MichaliszynO19 fatcat:2wfyl3juwnagndmiibp34qdl4q

On interactive evolutionary algorithms and stochastic mealy automata [chapter]

Günter Rudolph
1996 Lecture Notes in Computer Science  
In order to provide a theoretical framework to analyze such e v olutionary methods, the IEAs are formalized as stochastic Mealy automata. The potential impacts of such a formalization are discussed.  ...  Acknowledgment Financial support by project EVOLALG, grant 01 IB 403 A, from the German Federal Ministry of Education, Science, Research and Technology (BMBF) is gratefully acknowledged.  ...  S u c h a framework is o ered by a speci c class of stochastic automata whose theory is well{developed in several directions.  ... 
doi:10.1007/3-540-61723-x_986 fatcat:ko3musbgq5atrfvejw4v2fcjcu

The UniForM workbench a universal development environment for formal methods [chapter]

Bernd Krieg-Brückner, Jan Peleska, Ernst-Rüdiger Olderog, Alexander Baer
1999 Lecture Notes in Computer Science  
The UniForM Workbench supports combination of Formal Methods (on a solid logical foundation), provides tools for the development of hybrid, real-time or reactive systems, transformation, verification,  ...  Moreover, it comprises a universal framework for the integration of methods and tools in a common development environment. Several industrial case studies are described.  ...  This enables us to integrate PLC-Automata into a general methodology for the design of real-time systems based on DC [Old98] .  ... 
doi:10.1007/3-540-48118-4_13 fatcat:fwwpfuyds5euzmnl4mts46imqm

Page 4493 of Mathematical Reviews Vol. , Issue 87h [page]

1987 Mathematical Reviews  
Summary: “List automata allow for a uniform characterization of the Chomsky hierarchy by a single machine model.  ...  Since L is recognized by a two-way deterministic two-head finite automaton working in linear time we obtain, for two-way finite automata, that time, reading heads, and nondeterminism as resources cannot  ... 

A uniform approach to three-valued semantics for μ-calculus on abstractions of hybrid automata

K. Bauer, R. Gentilini, K. Schneider
2010 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper, we consider the definition of a three-valued semantics for μcalculus on abstractions of hybrid automata.  ...  Our approach relies on two steps: First, we develop a framework that is general in the sense that it provides a preservation result that holds for several possible semantics of the modal operators.  ...  As a result, we obtain two preservative abstraction/refinement frameworks for μ-calculus on hybrid automata.  ... 
doi:10.1007/s10009-010-0161-y fatcat:cbxtmt3wpjcpxlhhoxgwgjenia

A Uniform Approach to Three-Valued Semantics for μ-Calculus on Abstractions of Hybrid Automata [chapter]

Kerstin Bauer, Raffaella Gentilini, Klaus Schneider
2009 Lecture Notes in Computer Science  
In this paper, we consider the definition of a three-valued semantics for μcalculus on abstractions of hybrid automata.  ...  Our approach relies on two steps: First, we develop a framework that is general in the sense that it provides a preservation result that holds for several possible semantics of the modal operators.  ...  As a result, we obtain two preservative abstraction/refinement frameworks for μ-calculus on hybrid automata.  ... 
doi:10.1007/978-3-642-01702-5_9 fatcat:mxqzd6yjsrew7b4hvc6l6mqmqa

Page 816 of Mathematical Reviews Vol. 46, Issue 3 [page]

1973 Mathematical Reviews  
Decreasing the redundancy in uniform computing array automata is a vital problem. The authors propose a method for design optimization in one class of finite uniform array automata. G. M.  ...  G.; Drovjannikov, A. Ja. 4788 A method of optimization of the synthesis of finite automata in a computing system. (Russian) Vycisl. Sistemy Vyp. 41 (1971), 77-89.  ... 

Page 1218 of Mathematical Reviews Vol. , Issue 83c [page]

1983 Mathematical Reviews  
Two parameters are of 83c:68063 COMPUTER SCIENCE (including AUTOMATA) 1218 interest in the present framework, namely, the number of comparisons and the amount of record movement required for a search.  ...  From the introduction: “We show that the expected time iil to search a sorted list of m values from a uniform distribution is O(log logn) using fast search.”  ... 

Formal Verification of Real-Time Systems with Data Processing

Tamás Tóth, István Majzik
2017 Periodica Polytechnica Electrical Engineering and Computer Science  
In this paper, we describe a simple formalism that represents both aspects of such systems in a uniform and explicit way, thus enables the combination of formal analysis methods for real-time systems and  ...  Time related behavior can be efficiently modeled and analyzed in terms of timed automata.  ...  Related Work Timed automata [1] is a widely used formalism for the modeling and verification of real-time systems.  ... 
doi:10.3311/ppee.9766 fatcat:5kuh6d2y3zhbfcqkft527hvflm

Random Generation and Enumeration of Accessible Determinisitic Real-time Pushdown Automata [article]

Pierre-Cyrille Héam, Jean-Luc Joly (FEMTO-ST, CASSIS)
2015 arXiv   pre-print
This papers presents a general framework for the uniform random generation of deterministic real-time accessible pushdown automata.  ...  A polynomial time algorithm to randomly generate a pushdown automaton having a fixed stack operations total size is proposed.  ...  general framework for the uniform random generation of deterministic real-time accessible pushdown automata.  ... 
arXiv:1512.05881v1 fatcat:jdkw3ppmlzdwfa4l4o5ldkvysa
« Previous Showing results 1 — 15 out of 14,409 results