Zobrazeno 1 - 10
of 117
pro vyhledávání: '"Dutle, A."'
Autor:
Slagel, J. Tanner, Moscato, Mariano, White, Lauren, Muñoz, César A., Balachandran, Swee, Dutle, Aaron
Publikováno v:
EPTCS 402, 2024, pp. 43-62
Differential dynamic logic (dL) is a formal framework for specifying and reasoning about hybrid systems, i.e., dynamical systems that exhibit both continuous and discrete behaviors. These kinds of systems arise in many safety- and mission-critical ap
Externí odkaz:
http://arxiv.org/abs/2404.15214
Structured natural languages provide a trade space between ambiguous natural languages that make up most written requirements and mathematical formal specifications such as Linear Temporal Logic. FRETish is a structured natural language for the elici
Externí odkaz:
http://arxiv.org/abs/2201.03641
Autor:
Dutle, Aaron, Muñoz, César, Conrad, Esther, Goodloe, Alwyn, Titolo, Laura, Perez, Ivan, Balachandran, Swee, Giannakopoulou, Dimitra, Mavridou, Anastasia, Pressburger, Thomas
Publikováno v:
EPTCS 329, 2020, pp. 23-30
The Independent Configurable Architecture for Reliable Operations of Unmanned Systems (ICAROUS) is a software architecture incorporating a set of algorithms to enable autonomous operations of unmanned aircraft applications. This paper provides an ove
Externí odkaz:
http://arxiv.org/abs/2012.03745
There is much recent interest in excluded subposets. Given a fixed poset $P$, how many subsets of $[n]$ can found without a copy of $P$ realized by the subset relation? The hardest and most intensely investigated problem of this kind is when $P$ is a
Externí odkaz:
http://arxiv.org/abs/1309.5638
Publikováno v:
Disc. Appl. Math 181 (2015), 283-288
The joint degree matrix of a graph gives the number of edges between vertices of degree i and degree j for every pair (i,j). One can perform restricted swap operations to transform a graph into another with the same joint degree matrix. We prove that
Externí odkaz:
http://arxiv.org/abs/1302.3548
Autor:
Cooper, Joshua, Dutle, Aaron
We compute the spectrum of the "all ones" hypermatrix using the Poisson product formula. This computation includes a complete description of the eigenvalues' multiplicities, a seemingly elusive aspect of the spectral theory of tensors. We also give a
Externí odkaz:
http://arxiv.org/abs/1301.4590
Autor:
Dutle, Aaron, Kay, Bill
We address problem of determining edge weights on a graph using non-backtracking closed walks from a vertex. We show that the weights of all of the edges can be determined from any starting vertex exactly when the graph has minimum degree at least th
Externí odkaz:
http://arxiv.org/abs/1211.2151
Autor:
Cooper, Joshua N., Dutle, Aaron M.
We show that two duelers with similar, lousy shooting skills (a.k.a. Galois duelers) will choose to take turns firing in accordance with the famous Thue-Morse sequence if they greedily demand their chances to fire as soon as the other's a priori prob
Externí odkaz:
http://arxiv.org/abs/1110.1137
Autor:
Cooper, Joshua, Dutle, Aaron
We present a spectral theory of hypergraphs that closely parallels Spectral Graph Theory. A number of recent developments building upon classical work has led to a rich understanding of "hyperdeterminants" of hypermatrices, a.k.a. multidimensional ar
Externí odkaz:
http://arxiv.org/abs/1106.4856
Publikováno v:
Journal of Formalized Reasoning, Vol 11, Iss 1, Pp 19-41 (2018)
This paper presents a formally verified decision procedure for determinining the satisfiability of a system of univariate polynomial relations over the real line. The procedure combines a root counting function, based on Sturm’s theorem, with an in
Externí odkaz:
https://doaj.org/article/bcbf412e899646639ad423271e64b5bf
