Logan Mathesen

ORCID: 0000-0003-4880-6065
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Multi-Objective Optimization Algorithms
  • Simulation Techniques and Applications
  • Formal Methods in Verification
  • Physical Unclonable Functions (PUFs) and Hardware Security
  • Security and Verification in Computing
  • Software Reliability and Analysis Research
  • Software Testing and Debugging Techniques
  • Water Systems and Optimization
  • Advanced Malware Detection Techniques
  • Gaussian Processes and Bayesian Inference
  • Optimal Experimental Design Methods
  • Smart Grid Energy Management
  • Metaheuristic Optimization Algorithms Research
  • Scheduling and Optimization Algorithms
  • Advanced Bandit Algorithms Research
  • Water Treatment and Disinfection
  • Advanced Image and Video Retrieval Techniques
  • Model Reduction and Neural Networks
  • Advanced Queuing Theory Analysis
  • Reservoir Engineering and Simulation Methods
  • Manufacturing Process and Optimization
  • Sports Analytics and Performance
  • Smart Grid Security and Resilience

Arizona State University
2017-2021

Decision Systems (United States)
2019

This work is in the field of requirements driven search-based test case generation methods for Cyber-Physical Systems (CPS). The basic characteristic testing that search process guided by high level captured formal logic and, particular, Signal Temporal Logic (STL). Given a system trajectory, STL specifications can be equipped with quantitative semantics which evaluate closeness given trajectory from violating requirement. Hence, searching trajectories decreasing value respect to...

10.1109/coase.2019.8843005 article EN 2022 IEEE 18th International Conference on Automation Science and Engineering (CASE) 2019-08-01

This report presents the results from 2020 friendly competition in ARCH workshop for falsification of temporal logic specifications over Cyber-Physical Systems. We briefly describe settings, which have been inherited previous year, give background on participating teams and tools discuss selected benchmarks. The benchmarks are available website1, as well competition’s gitlab repository2. In comparison to 2019, we two new with novel approaches, show a clear improvement performances some

10.29007/trr1 article EN EPiC series in computing 2020-09-26

This report presents the results from 2019 friendly competition in ARCH workshop for falsification of temporal logic specifications over Cyber-Physical Systems. We describe organization and how it differs previous years. give background on participating teams tools discuss selected benchmarks results. The are available website1, as well competition’s gitlab repository2. main outcome is a common benchmark repository, an initial base-line falsification, with multiple tools, which will...

10.29007/68dk article EN EPiC series in computing 2019-06-05

This report presents the results from 2021 friendly competition in ARCH work- shop for falsification of temporal logic specifications over Cyber-Physical Systems. We briefly describe settings, which have been inherited previ- ous years, give background on participating teams and tools discuss selected benchmarks. Apart new requirements participants, major novelty this instalment is that falsifying inputs validated independently. During pro- cess, we uncovered several issues like...

10.29007/xwl1 article EN EPiC series in computing 2021-12-06

Optimization-based falsification, or search-based testing, is a method of automatic test generation for Cyber-Physical System (CPS) safety evaluation. CPS evaluation guided by high level system requirements that are expressed in Signal Temporal Logic (STL). Trajectories from executed simulations evaluated against STL using satisfaction robustness as quantitative metric. In particular, the distance metric between simulated trajectory, associated to specific input, and known unsafe set, i.e.,...

10.1109/case49439.2021.9551474 article EN 2022 IEEE 18th International Conference on Automation Science and Engineering (CASE) 2021-08-23

Real-time decision making has acquired increasing interest as a means to efficiently operating complex systems. The main challenge in achieving real-time is understand how develop next generation optimization procedures that can work using: (i) real data coming from large dynamical system, (ii) simulation models available reproduce the system dynamics. While this paper focuses on different problem with respect literature RL, methods proposed be used support sequential setting well. result of...

10.1142/s0217595919400116 article EN Asia Pacific Journal of Operational Research 2019-12-01

Water Distribution Networks are a particularly critical infrastructure for the high energy costs and frequent failures. Variable Speed Pumps have been introduced to improve regulation of water pumps, key overall performance. This paper addresses problem analyzing effect VSPs on pressure distribution WDN, which is highly correlated leakages costs. Due fact that network behavior can only be simulated, we formulate as black box feasibility determination, solve with novel stochastic partitioning...

10.1109/wsc.2018.8632513 article EN 2018 Winter Simulation Conference (WSC) 2018-12-01

Water Distribution Networks are a particularly critical infrastructure for the high energy costs and frequent failures. Variable Speed Pumps have been introduced to improve regulation of water pumps, key overall performance. This paper addresses problem analyzing effect VSPs on pressure distribution WDN, which is highly correlated leakages costs. Due fact that network behavior can only be simulated, we formulate as black box feasibility determination, solve with novel stochastic partitioning...

10.5555/3320516.3320751 article EN Winter Simulation Conference 2018-12-09

Recent advances in sensing, data analytics, and manufacturing technologies (e.g., 3-D printing, soft robotics, nanotechnologies, etc.) provide the potential to produce highly customized products by allowing flexible system design, endless device configurations, unprecedented information flows. These opportunities also increase complexity of controlling such systems optimally, which typically requires fast exploration an increasingly large number alternative operation strategies. Simulation...

10.1109/tac.2020.3025143 article EN publisher-specific-oa IEEE Transactions on Automatic Control 2020-09-18

Analytical and simulation models are two common types of approaches used to estimate predict the performance complex production systems. Typically analytical fast run but can have reduced accuracy. On other hand achieve high accuracy, only at cost large time number replications. Traditionally, research has been focusing on development able a satisfactory trade off between accuracy computational effort. Nevertheless, such an approach implies choice single model approximate system behavior....

10.1109/coase.2017.8256071 article EN 2017-08-01

The field of simulation optimization has seen algorithms proposed for local optimization, drawing upon different locally convergent search methods. Similarly, there are numerous global with differing strategies to achieve convergence. In this paper, we look specifically into meta-model based that stochastically drive through an optimal sampling criteria evaluated over a constructed the predicted response considering uncertainty response. We propose Trust Region Based Optimization Adaptive...

10.5555/3242181.3242357 article EN Winter Simulation Conference 2017-12-03

The field of simulation optimization has seen algorithms proposed for local optimization, drawing upon different locally convergent search methods. Similarly, there are numerous global with differing strategies to achieve convergence. In this paper, we look specifically into meta-model based that stochastically drive through an optimal sampling criteria evaluated over a constructed the predicted response considering uncertainty response. We propose Trust Region Based Optimization Adaptive...

10.1109/wsc.2017.8247943 article EN 2018 Winter Simulation Conference (WSC) 2017-12-01

Global optimization techniques often suffer the curse of dimensionality. In an attempt to face this challenge, high dimensional search try identify and leverage upon effective, lower, dimensionality problem either in original or a transformed space. As result, algorithms for exploit projection create random embedding. Our approach avoids modeling spaces, assumption low effective We argue that effectively functions can be recursively optimized over sets complementary lower subspaces. light,...

10.1109/wsc40007.2019.9004851 article EN 2018 Winter Simulation Conference (WSC) 2019-12-01

Knowledge discovery and decision making through data-and model-driven computer simulation ensembles are increasingly critical in many application domains. However, these expensive to obtain. Consequently, given a relatively small budget, one needs identify sparse ensemble that includes the most informative simulations help effective exploration of space input parameters. In this paper, we propose complicacy-guided parameter sampling (CPSS) for knowledge with limited budgets, which relies on...

10.1109/icbk.2019.00015 article EN 2019-11-01
Pierre Derennes Jérôme Morio Florian Simatos Russell R. Barton Henry Lam and 95 more Eunhye Song Mingbin Feng Alvaro Maggiar Jeremy Staum Andreas Wäechter Paul Glasserman Enrique Lelo de Larrea Kemal Dinçer Dingeç Christos Alexopoulos Dave Goldsman Melike Meterelliyoz James Wilson Uro Lyi Michael Fu Pierre L’Ecuyer Zdravko I. Botev Dirk P. Kroese Yi‐Lung Chen Shev MacNamara Prashant Kumar Singh Andreas Hellander Zhiyuan Huang Ding Zhao Krzysztof Bisewski Daan Crommelin Michel Mandjes Zachary T. Kaplan Yajuan Li Marvin Metamodelling Wei Xie Bo Wang Qiong Zhang Jing Dong Mingbin Feng Barry L. Nelson Yi-Chih Dong Peter W. Glynn Marvin K. Nakayama Bruno Tuffin David Goldsman Anup C. Mokashi Thibault Duplay Xinyu Zhang Saul Toscano-Palmerin Peter I. Frazier Guangxin Jiang Prateek Jaiswal Harsha Honnappa Raghu Pasupathy Pu Zhang Ilya O. Ryzhov Ying Zhong Jeff Hong Yijie Peng Chun‐Hung Chen Edwin Chong Yi-An Tsai Riccardo Perego Giulia Pedrielli Zelda B. Zabinsky Antonio Candelieri Hao Huang Logan Mathesen David Schmaranzer Roland Braune Karl F. Doerner Mauro Ianni Romolo Marotta Davide Cingolani Alessandro Pellegrini Francesco Quaglia Matthew Plumlee Matthew Groves Michael Pearce Juergen Branke Wenjie Sun Zhaolin Hu Simon Lidberg Leif Pehrsson Amos H.C. Ng Shiwei Chen Weizhuo Lu Johannes Karder Klaus Altendorfer Andreas Beham Andreas J. Peirleitner David J. Eckman Huajie Qian David Steber Jakob Hübler Marco Pruckner Marta Cildoz Amaia Ibarra Fermin Metamodel Songhao Wang

10.1109/wsc.2018.8632552 article 2018 Winter Simulation Conference (WSC) 2018-12-01

We introduce the algorithm Bayesian Optimization (BO) with Fictitious Play (BOFiP) for optimization of high dimensional black box functions. BOFiP decomposes original, dimensional, space into several sub-spaces defined by non-overlapping sets dimensions. These are randomly generated at start algorithm, and they form a partition dimensions original space. searches alternating BO, within sub-spaces, information exchange among to update sub-space function evaluation. The basic idea is...

10.48550/arxiv.2110.03790 preprint EN cc-by arXiv (Cornell University) 2021-01-01
Coming Soon ...