A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
EPiC Series in Computing Seminator: A Tool for Semi-Determinization of Omega-Automata

2017
*
21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
*
unpublished

The

fatcat:whh4mi7nljb7fpy754ybahe6cu
*tool**Seminator*accepts transition-based generalized Büchi*automata*(TGBA) as an input and produces*automata*with two kinds*of**semi*-*determinism*. ... We present*a**tool*that transforms nondeterministic ω-*automata*to*semi*-deterministic ω-*automata*. ... Acknowledgments The authors would like to thank Salomon Sickert*for*pointing out that not every cut-deterministic automaton is suitable*for*quantitative model checking*of*MDPs. ...##
###
Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
[chapter]

2008
*
Lecture Notes in Computer Science
*

The model-checking problem

doi:10.1007/978-3-540-78800-3_6
fatcat:p63uoirflfandowrffppssmtka
*for*LTL asks, given an*omega*-regular language L (e.g. the set*of*all computations*of**a*reactive system) and*a*LTL formula The link between LTL and*omega*-regular languages is ... Introduction*A*model*for*an LTL formula over*a*set P*of*propositions is an infinite word w over the alphabet Σ = 2 P . An LTL formula φ defines*a*set*of*words is empty. ... Similarly*for*the model-checking, we check the emptiness*of*L(K) ∩ L b (*A*¬φ ). These*automata*are defined over*a*symbolic alphabet*of*propositional formulas. ...##
###
Quantum circuit design for universal distribution using a superposition of classical automata
[article]

2022
*
arXiv
*
pre-print

*A*classical exhaustive enumeration

*of*all possible programs on the

*automata*is shown

*for*

*a*couple

*of*example cases. ... In this research, we present

*a*quantum circuit design and implementation

*for*

*a*parallel universal linear bounded

*automata*. ... The new field

*of*quantum machine learning [64] also employs these

*tools*

*for*its development. ...

##
###
Discrete Event Systems: Modeling, Observation, and Control

2019
*
Annual Review of Control Robotics and Autonomous Systems
*

This article begins with an introduction to the modeling

doi:10.1146/annurev-control-053018-023659
fatcat:xlx7jqoubbaqdd7yhm5ryzbml4
*of*discrete event systems,*a*class*of*dynamical systems with discrete states and event-driven dynamics. ... The emphasis is on presenting fundamental results first, followed by*a*discussion*of*current research directions. ... ACKNOWLEDGMENTS The research*of*the author is supported primarily by grants from the US National Science Foundation. LITERATURE CITED ...##
###
Self-Organized Criticality and Pattern Emergence through the lens of Tropical Geometry
[article]

2018
*
arXiv
*
pre-print

Our model is continuous, in contrast to all known models

arXiv:1806.09153v1
fatcat:pbnxbdf23nefhalzhgngx6krra
*of*SOC, and is*a*certain scaling limit*of*the sandpile model, the first and archetypical model*of*SOC. ... In this paper, we report on our discovery*of**a*tropical model with self-organized criticality (SOC) behavior. ... The paradigm*for*the first is broken symmetry;*for*the second, self-organized criticality" (3). 2 The Sandpile Model The concept*of*SOC was introduced in the*seminal*papers*of*Per Bak, Chao Tang, ...##
###
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines

2014
*
PLoS ONE
*

We provide

doi:10.1371/journal.pone.0096223
pmid:24809449
pmcid:PMC4014489
fatcat:eqzykdfg2bgl7lmr7l5txnfsmu
*a*thorough analysis*for*all 11 n=1 2 n binary strings*of*length n < 12 and*for*most strings*of*length 12 ≤ n ≤ 16 by running all ∼ 2.5 × 10 13 Turing machines with 5 states and 2 symbols (8 ... As with compression algorithms, this work promises to deliver*a*range*of*applications, and to provide insight into the question*of*complexity calculation*of*finite (and short) strings. ... The authors known*of*only two similar attempts to compute the uncomputable, one related to the estimation*of**a*Chaitin*Omega*number [4] , and*of*another*seminal*related measure*of*complexity, Bennett's ...##
###
Calculating Kolmogorov Complexity from the Output Frequency Distributions of Small Turing Machines
[article]

2014
*
arXiv
*
pre-print

We provide

arXiv:1211.1302v2
fatcat:gufuwjoiibaghnyzsefjj6ouwy
*a*thorough analysis*for*all ∑_n=1^11 2^n binary strings*of*length n<12 and*for*most strings*of*length 12≤ n ≤16 by running all ∼ 2.5 × 10^13 Turing machines with 5 states and 2 symbols (8× 22 ... As with compression algorithms, this work promises to deliver*a*range*of*applications, and to provide insight into the question*of*complexity calculation*of*finite (and short) strings. ... The authors known*of*only two similar attempts to compute the uncomputable, one related to the estimation*of**a*Chaitin*Omega*number [4] , and*of*another*seminal*related measure*of*complexity, Bennett's ...##
###
Towards a UTP Semantics for Modelica
[chapter]

2017
*
Lecture Notes in Computer Science
*

This is

doi:10.1007/978-3-319-52228-9_3
fatcat:qdchoo2yo5h5rhjk5briyywqau
*a*language*for*modelling*a*system's continuous behaviour using*a*combination*of*differentialalgebraic equations and an event-handling system. ... When combined with the wealth*of*existing UTP theories*for*discrete system modelling, our work enables*a*sound approach to heterogeneous semantics*for*Cyber-Physical systems by leveraging the theory linking ... This work supports the goals*of**a*large EU project called INTO-CPS 10 , which aims at building an integrated*tool*-chain*for*model based development*of*Cyber-Physical Systems. ...##
###
On Computability of Data Word Functions Defined by Transducers
[article]

2020
*
arXiv
*
pre-print

Such transducers may not define functions but more generally relations

arXiv:2002.08203v1
fatcat:l2722xmyhbdizoc4xebyvbl4u4
*of*data*omega*-words, and we show that it is PSpace-complete to test whether*a*given transducer defines*a*function. ... In this paper, we investigate the problem*of*synthesizing computable functions*of*infinite words over an infinite alphabet (data*omega*-words). ... Technical Properties*of*Register*Automata*Although*automata*are simpler machines than transducers, we only use them as*tools*in our proofs, which is why we define them from transducers, and not the other ...##
###
Reducibility of pointlike problems

2015
*
Semigroup Forum
*

Allowing only trivial groups, we obtain

doi:10.1007/s00233-015-9769-2
fatcat:tzeixxtrinbube46k2nca2qrte
*omega*-reducibility*of*the pointlike and idempotent pointlike problems, respectively*for*the pseudovarieties*of*all finite aperiodic semigroups (*A*) and*of*all finite ... every subgroup is*a*product*of*elements*of**a*fixed set*of*primes; the pseudovariety*of*all finite semigroups in which every regular J-class is the product*of**a*rectangular band by*a*group from*a*fixed ... Acknowledgments Work partly supported by the Pessoa French-Portuguese project "Separation in*automata*theory: algebraic, logical, and combinatorial aspects". ...##
###
Integral biomathics: A post-Newtonian view into the logos of bios

2010
*
Progress in Biophysics and Molecular Biology
*

This work is an attempt

doi:10.1016/j.pbiomolbio.2010.01.005
pmid:20146929
fatcat:ukagr4ftyjaqvknyjorvewxavm
*for**a*state-*of*-the-art survey*of*natural and life sciences with the goal to define the scope and address the central questions*of*an original research program. ... It is focused on the phenomena*of*emergence, adaptive dynamics and evolution*of*self-assembling, self-organizing, self-maintaining and self-replicating biosynthetic systems viewed from*a*newly-arranged ... Acknowledgements: The author deeply appreciates the valuable help*of*Prof. Tatsuya Nomura from ...##
###
Parallelism and evolutionary algorithms

2002
*
IEEE Transactions on Evolutionary Computation
*

This paper contains

doi:10.1109/tevc.2002.800880
fatcat:msvixooqjzbofjynegsxjc6gmy
*a*modern vision*of*the parallelization techniques used*for*evolutionary algorithms (EAs). ... , there is*a*large number*of*improvements in these algorithms and in their parallelization that raise the need*for**a*comprehensive survey. ... ACKNOWLEDGMENT The authors gratefully acknowledge the comments*of*the reviewers that helped in improving the contents*of*this work notably. ...##
###
Report from Dagstuhl Seminar 14041

unpublished

Later the more expressive formalism

fatcat:gurlflekkfbpnlsfy3yhg2k4si
*of*hybrid*automata*was introduced and popularized by Henzinger et al and the introduction*of*the*tool*HyTech provided*a**semi*-decision algorithm*for*analyzing so-called ... The notion*of*zone has led to*a*number*of**tools*-e.g. BIP, Kronos, UPPAAL -which support efficient analysis (reachability and model checking)*of*timed*automata*. ...##
###
Rewriting the Matrix of Life. Biomedia Between Ecological Crisis and Playful Actions

2014

As

doi:10.7275/r50v89rs
fatcat:vxwkcllcwzhwpcjlbwrw45oalm
*a*second turning point*of*the rewriting*of*the matrix,*of*life we will discuss the advance*of*'games' since the early 1970ies, with the example*of*'Game*of*life' ('Life') as*a*significant landmark. ... Life') and belonging to distinctive disciplines (economic and ecological research vs. mathematical theory*of**automata*and artificial life studies), they share some common ground in being "algorithmic media ...*automata*as preferred research*tool*. 64 The 'lifelike' behavior*of*Conway's 'Life' is*a*much used 'visual' argument*for*this approach. 65 It seems plausible that much*of*the game's continuous attraction ...##
###
Connecting Performance Analysis and Visualization to Advance Extreme Scale Computing (Dagstuhl Seminar 14022) Randomized Timed and Hybrid Models for Critical Infrastructures (Dagstuhl Seminar 14031) Planning with Epistemic Goals (Dagstuhl Seminar 14032)

2014
unpublished

Later the more expressive formalism

fatcat:iqk466everfcdhf5guvz5ph2ee
*of*hybrid*automata*was introduced and popularized by Henzinger et al and the introduction*of*the*tool*HyTech provided*a**semi*-decision algorithm*for*analyzing so-called ... Weighted*automata*on finite words were already investigated in*seminal*work*of*Schützenberger (1961) and Chomsky and Schützenberger (1963). ... To date, such data is collected in*a*variety*of*ways (e.g. passively or aggressively), by*a*variety*of*researchers (e.g. academic, industry, governmental)*for**a*variety*of*purposes (e.g. detecting fraudulent ...
« Previous

*Showing results 1 — 15 out of 38 results*