We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence c...
Wesley Calvert, Douglas Cenzer, Valentina S. Hariz...
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...