danesabo/Obsidian
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Obsidian/.archive/201 Metadata/My Library.bib

8570 lines
718 KiB
BibTeX
Raw Permalink Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

@misc{20222023CriteriaAccrediting,
title = {2022-2023 {{Criteria}} for {{Accrediting Engineering Programs}}},
organization = {ABET Eningeering Accreditation Commission},
file = {/home/danesabo/Zotero/storage/GJ6JTCN3/2022-23-EAC-Criteria.pdf}
}
@online{2023NationalCybersecurity,
title = {2023 {{National Cybersecurity Education Colloquium}} | {{CAE Community}}},
url = {https://www.caecommunity.org/about-us/cae-cybersecurity-community/event-programs/2023-national-cybersecurity-education},
urldate = {2023-11-07},
file = {/home/danesabo/Zotero/storage/NKDJMYQZ/2023-national-cybersecurity-education.html}
}
@book{abelsonStructureInterpretationComputer2022,
title = {Structure and Interpretation of Computer Programs},
author = {Abelson, Harold and Sussman, Gerald Jay and Sussman, Julie and Henz, Martin and Wrigstad, Tobias},
date = {2022},
series = {{{MIT}} Electrical Engineering and Computer Science Series},
edition = {JavaScript edition},
publisher = {The MIT Press},
location = {Cambridge, Massachusetts},
abstract = {"This classic text teaches fundamental principles of computer programming, including recursion, abstraction, modularity, and programming language design and implementation. The approach focuses on discovering general patterns for solving specific problems, and building software systems that make use of those patterns. This version uses JavaScript as the language of instruction"--},
isbn = {978-0-262-54323-1},
langid = {english},
pagetotal = {608},
file = {/home/danesabo/Zotero/storage/KZSJSUKD/Abelson et al. - 2022 - Structure and interpretation of computer programs.pdf}
}
@online{AbstractJulia,
title = {{{AbstractJulia}}},
url = {https://www.algebraicjulia.org/}
}
@online{adamsTypeTheoryProbabilistic2015,
title = {A {{Type Theory}} for {{Probabilistic}} and {{Bayesian Reasoning}}},
author = {Adams, Robin and Jacobs, Bart},
date = {2015-11-30},
eprint = {1511.09230},
eprinttype = {arXiv},
eprintclass = {cs, math},
doi = {10.48550/arXiv.1511.09230},
url = {http://arxiv.org/abs/1511.09230},
urldate = {2024-02-06},
abstract = {This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes our probabilistic type theory from quantum type theory, namely the bijective correspondence between predicates and side-effect free actions (called instrument, or assert, maps). The paper shows how suitable computation rules can be derived from this predicate-action correspondence, and uses these rules for calculating conditional probabilities in two well-known examples of Bayesian reasoning in (graphical) models. Our type theory may thus form the basis for a mechanisation of Bayesian inference.},
pubstate = {prepublished},
keywords = {Computer Science - Logic in Computer Science,F.3.1,F.4.1,G.3,Mathematics - Logic,Mathematics - Probability},
file = {/home/danesabo/Zotero/storage/UN44SM33/Adams and Jacobs - 2015 - A Type Theory for Probabilistic and Bayesian Reasoning.pdf}
}
@article{adiegoBringingAutomatedModel2014,
title = {Bringing {{Automated Model Checking}} to {{PLC Program Development}} — {{A CERN Case Study}} —},
author = {Adiego, Borja Fernández and Darvas, Dániel and Tournier, Jean-Charles and Viñuela, Enrique Blanco and Suárez, Víctor M. González},
date = {2014},
journaltitle = {IFAC Proceedings Volumes},
shortjournal = {IFAC Proceedings Volumes},
volume = {47},
number = {2},
pages = {394--399},
issn = {14746670},
doi = {10.3182/20140514-3-FR-4046.00051},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1474667015374334},
urldate = {2023-10-10},
abstract = {Verification of critical software is a high priority but a challenging task for industrial control systems. Model checking appears to be an appropriate approach for this purpose. However, this technique is not widely used in industry yet, due to some obstacles. The main obstacles encountered when trying to apply formal verification techniques at industrial installations are the difficulty of creating models out of PLC programs and defining formally the specification requirements. In addition, models produced out of real-life programs have a huge state space, thus preventing the verification due to performance issues. Our work at CERN (European Organization for Nuclear Research) focuses on developing efficient automatic verification methods for industrial critical installations based on PLC (Programmable Logic Controller) control systems.},
langid = {english},
file = {/home/danesabo/Zotero/storage/6T7S8SNG/Adiego et al. - 2014 - Bringing Automated Model Checking to PLC Program D.pdf}
}
@article{agarwalSystematicClassificationNeuralnetworkbased1997,
title = {A Systematic Classification of Neural-Network-Based Control},
author = {Agarwal, M.},
date = {1997-04},
journaltitle = {IEEE Control Systems Magazine},
volume = {17},
number = {2},
pages = {75--93},
issn = {1941-000X},
doi = {10.1109/37.581297},
url = {https://ieeexplore.ieee.org/document/581297},
urldate = {2025-04-07},
abstract = {Successful industrial applications and favorable comparisons with conventional alternatives have motivated the development of a large number of schemes for neural-network-based control. Each scheme is usually composed of several independent functional features, which makes it difficult to identify precisely what is new in the scheme. Help from available overviews is therefore often inadequate, since they usually discuss only the most important overall schemes. This work breaks the available schemes down to their essential functional features and organizes the latter into a multi-level classification. The classification reveals that similar schemes often get placed in different categories, fundamentally different features often get lumped into a single category, and proposed new schemes are often merely permutations and combinations of the well-established fundamental features. The classification has two main sections: neural network only as an aid; and neural network as controller.},
keywords = {Computer networks,Concurrent computing,Control systems,Convergence of numerical methods,Electrical equipment industry,Industrial control,Neural networks,Proposals,Stability analysis,Taxonomy},
file = {/home/danesabo/Zotero/storage/XFTP8R8H/581297.html}
}
@report{agencyAssessmentManagementAgeing2007,
type = {Text},
title = {Assessment and {{Management}} of {{Ageing}} of {{Major Nuclear Power Plant Components Important}} to {{Safety}}: {{PWR Vessel Internals}}},
shorttitle = {Assessment and {{Management}} of {{Ageing}} of {{Major Nuclear Power Plant Components Important}} to {{Safety}}},
author = {Agency, International Atomic Energy},
date = {2007},
pages = {1--74},
institution = {International Atomic Energy Agency},
url = {https://www.iaea.org/publications/7740/assessment-and-management-of-ageing-of-major-nuclear-power-plant-components-important-to-safety-pwr-vessel-internals},
urldate = {2023-10-11},
isbn = {9789201051073},
langid = {english},
file = {/home/danesabo/Zotero/storage/YGI9A6US/Agency - 2007 - Assessment and Management of Ageing of Major Nucle.pdf}
}
@article{ahmadi-javidPortfolioOptimizationEntropic2019,
title = {Portfolio Optimization with Entropic Value-at-Risk},
author = {Ahmadi-Javid, Amir and Fallah-Tafti, Malihe},
date = {2019-11},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {279},
number = {1},
pages = {225--241},
issn = {03772217},
doi = {10.1016/j.ejor.2019.02.007},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221719301183},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/RVPIQV5I/Ahmadi-Javid and Fallah-Tafti - 2019 - Portfolio optimization with entropic value-at-risk.pdf}
}
@article{ahmedTravelTimePrediction2021,
title = {Travel {{Time Prediction}} and {{Explanation}} with {{Spatio-Temporal Features}}: {{A Comparative Study}}},
shorttitle = {Travel {{Time Prediction}} and {{Explanation}} with {{Spatio-Temporal Features}}},
author = {Ahmed, Irfan and Kumara, Indika and Reshadat, Vahideh and Kayes, A. S. M. and Van Den Heuvel, Willem-Jan and Tamburri, Damian A.},
date = {2021-12-29},
journaltitle = {Electronics},
shortjournal = {Electronics},
volume = {11},
number = {1},
pages = {106},
issn = {2079-9292},
doi = {10.3390/electronics11010106},
url = {https://www.mdpi.com/2079-9292/11/1/106},
urldate = {2023-10-11},
abstract = {Travel time information is used as input or auxiliary data for tasks such as dynamic navigation, infrastructure planning, congestion control, and accident detection. Various data-driven Travel Time Prediction (TTP) methods have been proposed in recent years. One of the most challenging tasks in TTP is developing and selecting the most appropriate prediction algorithm. The existing studies that empirically compare different TTP models only use a few models with specific features. Moreover, there is a lack of research on explaining TTPs made by black-box models. Such explanations can help to tune and apply TTP methods successfully. To fill these gaps in the current TTP literature, using three data sets, we compare three types of TTP methods (ensemble tree-based learning, deep neural networks, and hybrid models) and ten different prediction algorithms overall. Furthermore, we apply XAI (Explainable Artificial Intelligence) methods (SHAP and LIME) to understand and interpret models’ predictions. The prediction accuracy and reliability for all models are evaluated and compared. We observed that the ensemble learning methods, i.e., XGBoost and LightGBM, are the best performing models over the three data sets, and XAI methods can adequately explain how various spatial and temporal features influence travel time.},
langid = {english},
file = {/home/danesabo/Zotero/storage/HJUMUC2Z/Ahmed et al. - 2021 - Travel Time Prediction and Explanation with Spatio.pdf}
}
@article{alguliyevCyberphysicalSystemsTheir2018,
title = {Cyber-Physical Systems and Their Security Issues},
author = {Alguliyev, Rasim and Imamverdiyev, Yadigar and Sukhostat, Lyudmila},
date = {2018-09},
journaltitle = {Computers in Industry},
shortjournal = {Computers in Industry},
volume = {100},
pages = {212--223},
issn = {01663615},
doi = {10.1016/j.compind.2018.04.017},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0166361517304244},
urldate = {2023-10-11},
abstract = {The creation of cyber-physical systems posed new challenges for people. Ensuring the information security of cyber-physical systems is one of the most complex problems in a wide range of defenses against cyber-attacks. The aim of this paper is to analyse and classify existing research papers on the security of cyber-physical systems. Philosophical issues of cyber-physical systems are raised. Their influence on the aspects of people's lives is investigated. The principle of cyber-physical system operation is described. The main difficulties and solutions in the estimation of the consequences of cyber-attacks, attacks modeling and detection and the development of security architecture are noted. The main types of attacks and threats against cyber-physical systems are analysed. A tree of attacks on cyber-physical systems is proposed. The future research directions are shown.},
langid = {english},
file = {/home/danesabo/Zotero/storage/H46P7GAA/Alguliyev et al. - 2018 - Cyber-physical systems and their security issues.pdf}
}
@online{AllLeanBooks,
title = {All {{Lean Books And Where To Find Them}}},
url = {https://lakesare.brick.do/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ},
urldate = {2024-03-20},
abstract = {Respecting traditions of the city I\&\#39;m currently in This could have been a classic \"Awesome Lean\" repo (like this), however I\&\#39;d much prefer reading subjective o...},
langid = {english},
file = {/home/danesabo/Zotero/storage/7SKQYER4/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ.html}
}
@online{AllLeanBooksa,
title = {All {{Lean Books And Where To Find Them}}},
url = {https://lakesare.brick.do/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ},
urldate = {2024-03-20},
abstract = {Respecting traditions of the city I\&\#39;m currently in This could have been a classic \"Awesome Lean\" repo (like this), however I\&\#39;d much prefer reading subjective o...},
langid = {english},
file = {/home/danesabo/Zotero/storage/AAJTKRQW/all-lean-books-and-where-to-find-them-x2nYwjM3AwBQ.html}
}
@misc{altenkirchWhyDependentTypes2005,
title = {Why {{Dependent Types Matter}}},
author = {Altenkirch, Thorsten and McBride, Conor and McKinna, James},
date = {2005},
abstract = {We exhibit the rationale behind the design of Epigram, a dependently typed programming language and interactive program development system, using refinements of a well known program—merge sort—as a running example. We discuss its relationship with other proposals to introduce aspects of dependent types into functional programming languages and sketch some topics for further work in this area.},
langid = {english},
file = {/home/danesabo/Zotero/storage/7XZGH5HR/Altenkirch et al. - Why Dependent Types Matter.pdf}
}
@article{althoffARCHCOMP17CategoryReport,
title = {{{ARCH-COMP17 Category Report}}: {{Continuous}} and {{Hybrid Systems}} with {{Linear Continuous Dynamics}}},
author = {Althoff, Matthias and Bak, Stanley and Cattaruzza, Dario and Chen, Xin and Frehse, Goran and Ray, Rajarshi and Schupp, Stefan},
abstract = {This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2017. In its first edition, seven tools have been applied to solve three different benchmark problems in the category for linear continuous dynamics (in alphabetical order): Axelerator, CORA, Flow*, HyDRA, Hylaa, SpaceEx, and XSpeed. The result is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results probably provide the most complete assessment of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
langid = {english},
file = {/home/danesabo/Zotero/storage/W4V5JYRK/Althoff et al. - ARCH-COMP17 Category Report Continuous and Hybrid.pdf}
}
@article{althoffARCHCOMP19CategoryReport,
title = {{{ARCH-COMP19 Category Report}}: {{Continuous}} and {{Hybrid Systems}} with {{Linear Continuous Dynamics}}},
author = {Althoff, Matthias and Bak, Stanley and Forets, Marcelo and Frehse, Goran and Ray, Rajarshi and Schilling, Christian and Schupp, Stefan},
abstract = {This report presents the results of a friendly competition for formal verification of continuous and hybrid systems with linear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In its third edition, seven tools have been applied to solve six different benchmark problems in the category for linear continuous dynamics (in alphabetical order): CORA, CORA/SX, HyDRA, Hylaa, JuliaReach, SpaceEx, and XSpeed. This report is a snapshot of the current landscape of tools and the types of benchmarks they are particularly suited for. Due to the diversity of problems, we are not ranking tools, yet the presented results provide one of the most complete assessments of tools for the safety verification of continuous and hybrid systems with linear continuous dynamics up to this date.},
langid = {english},
file = {/home/danesabo/Zotero/storage/MPCEW5TU/Althoff et al. - ARCH-COMP19 Category Report Continuous and Hybrid.pdf}
}
@inproceedings{althoffIntroductionCORA2015,
title = {An {{Introduction}} to {{CORA}} 2015},
author = {Althoff, Matthias},
pages = {120--87},
doi = {10.29007/zbkv},
url = {https://easychair.org/publications/paper/xMm},
urldate = {2023-10-30},
abstract = {The philosophy, architecture, and capabilities of the COntinuous Reachability Analyzer (CORA) are presented. CORA is a toolbox that integrates various vector and matrix set representations and operations on them as well as reachability algorithms of various dynamic system classes. The software is designed such that set representations can be exchanged without having to modify the code for reachability analysis. CORA has a modular design, making it possible to use the capabilities of the various set representations for other purposes besides reachability analysis. The toolbox is designed using the object oriented paradigm, such that users can safely use methods without concerning themselves with detailed information hidden inside the object. Since the toolbox is written in MATLAB, the installation and use is platform independent.},
eventtitle = {{{ARCH14-15}}. 1st and 2nd {{International Workshop}} on {{Applied veRification}} for {{Continuous}} and {{Hybrid Systems}}},
langid = {english},
file = {/home/danesabo/Zotero/storage/WHU9AQL8/Althoff - An Introduction to CORA 2015.pdf}
}
@inproceedings{althoffReachabilityAnalysisNonlinear2013,
title = {Reachability Analysis of Nonlinear Systems Using Conservative Polynomialization and Non-Convex Sets},
booktitle = {Proceedings of the 16th International Conference on {{Hybrid}} Systems: Computation and Control},
author = {Althoff, Matthias},
date = {2013-04-08},
series = {{{HSCC}} '13},
pages = {173--182},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/2461328.2461358},
url = {https://dl.acm.org/doi/10.1145/2461328.2461358},
urldate = {2023-11-01},
abstract = {A new technique for computing the reachable set of hybrid systems with nonlinear continuous dynamics is presented. Previous work showed that abstracting the nonlinear continuous dynamics to linear differential inclusions results in a scalable approach for reachability analysis. However, when the abstraction becomes inaccurate, linearization techniques require splitting of reachable sets, resulting in an exponential growth of required linearizations. In this work, the nonlinearity of the dynamics is more accurately abstracted to polynomial difference inclusions. As a consequence, it is no longer guaranteed that reachable sets of consecutive time steps are mapped to convex sets as typically used in previous works. Thus, a non-convex set representation is developed in order to better capture the nonlinear dynamics, requiring no or much less splitting. The new approach has polynomial complexity with respect to the number of continuous state variables when splitting can be avoided and is thus promising when a linearization technique requires splitting for the same problem. The benefits are presented by numerical examples.},
isbn = {978-1-4503-1567-8},
file = {/home/danesabo/Zotero/storage/5YDEK8AF/Althoff - 2013 - Reachability analysis of nonlinear systems using c.pdf}
}
@article{althoffSetPropagationTechniques2021,
title = {Set {{Propagation Techniques}} for {{Reachability Analysis}}},
author = {Althoff, Matthias and Frehse, Goran and Girard, Antoine},
date = {2021},
journaltitle = {Annual Review of Control, Robotics, and Autonomous Systems},
volume = {4},
number = {1},
pages = {369--395},
doi = {10.1146/annurev-control-071420-081941},
url = {https://doi.org/10.1146/annurev-control-071420-081941},
urldate = {2023-11-03},
abstract = {Reachability analysis consists in computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This article focuses on a class of methods for computing a guaranteed overapproximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation; starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review of set representation and computation, the article presents the state of the art of set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. It ends with a discussion of successful applications of reachability analysis to real-world problems.},
file = {/home/danesabo/Zotero/storage/2JEKRTF9/Althoff et al. - 2021 - Set Propagation Techniques for Reachability Analys.pdf}
}
@book{alwanTheoryHybridSystems2018,
title = {Theory of {{Hybrid Systems}}: {{Deterministic}} and {{Stochastic}}},
shorttitle = {Theory of {{Hybrid Systems}}},
author = {Alwan, Mohamad S. and Liu, Xinzhi},
date = {2018},
series = {Nonlinear {{Physical Science}}},
edition = {1st ed. 2018},
publisher = {Springer Singapore : Imprint: Springer},
location = {Singapore},
doi = {10.1007/978-981-10-8046-3},
abstract = {This book is the first to present the application of the hybrid system theory to systems with EPCA (equations with piecewise continuous arguments). The hybrid system paradigm is a valuable modeling tool for describing a wide range of real-world applications. Moreover, although new technology has produced, and continues to produce highly hierarchical sophisticated machinery that cannot be analyzed as a whole system, hybrid system representation can be used to reduce the structural complexity of these systems. That is to say, hybrid systems have become a modeling priority, which in turn has led to the creation of a promising research field with several application areas. As such, the book explores recent developments in the area of deterministic and stochastic hybrid systems using the Lyapunov and Razumikhin-Lyapunov methods to investigate the systems' properties. It also describes properties such as stability, stabilization, reliable control, H-infinity optimal control, input-to-state stability (ISS)/stabilization, state estimation, and large-scale singularly perturbed systems},
isbn = {978-981-10-8046-3},
pagetotal = {1},
keywords = {Applications of Nonlinear Dynamics and Chaos Theory,Control and Systems Theory,Control engineering,Mathematical Methods in Physics,Mathematical physics,Mathematical Physics,Physics,Statistical physics,Statistical Physics and Dynamical Systems,System theory,Systems Theory Control},
file = {/home/danesabo/Zotero/storage/EKCD8BZX/Alwan and Liu - 2018 - Theory of Hybrid Systems Deterministic and Stocha.pdf}
}
@article{aminiLearningRobustControl2020,
title = {Learning {{Robust Control Policies}} for {{End-to-End Autonomous Driving From Data-Driven Simulation}}},
author = {Amini, Alexander and Gilitschenski, Igor and Phillips, Jacob and Moseyko, Julia and Banerjee, Rohan and Karaman, Sertac and Rus, Daniela},
date = {2020-04},
journaltitle = {IEEE Robotics and Automation Letters},
volume = {5},
number = {2},
pages = {1143--1150},
issn = {2377-3766},
doi = {10.1109/LRA.2020.2966414},
url = {https://ieeexplore.ieee.org/abstract/document/8957584},
urldate = {2024-07-10},
abstract = {In this work, we present a data-driven simulation and training engine capable of learning end-to-end autonomous vehicle control policies using only sparse rewards. By leveraging real, human-collected trajectories through an environment, we render novel training data that allows virtual agents to drive along a continuum of new local trajectories consistent with the road appearance and semantics, each with a different view of the scene. We demonstrate the ability of policies learned within our simulator to generalize to and navigate in previously unseen real-world roads, without access to any human control labels during training. Our results validate the learned policy onboard a full-scale autonomous vehicle, including in previously un-encountered scenarios, such as new roads and novel, complex, near-crash situations. Our methods are scalable, leverage reinforcement learning, and apply broadly to situations requiring effective perception and robust operation in the physical world.},
eventtitle = {{{IEEE Robotics}} and {{Automation Letters}}},
keywords = {autonomous agents,Autonomous vehicles,data-driven simulation,Deep learning in robotics and automation,Engines,real world reinforcement learning,Roads,Semantics,Training,Training data,Trajectory},
file = {/home/danesabo/Zotero/storage/IN9RTZC2/Amini et al. - 2020 - Learning Robust Control Policies for End-to-End Au.pdf}
}
@article{amoahFormalModellingAnalysis2016,
title = {Formal Modelling and Analysis of {{DNP3}} Secure Authentication},
author = {Amoah, Raphael and Camtepe, Seyit and Foo, Ernest},
date = {2016-01},
journaltitle = {Journal of Network and Computer Applications},
shortjournal = {Journal of Network and Computer Applications},
volume = {59},
pages = {345--360},
issn = {10848045},
doi = {10.1016/j.jnca.2015.05.015},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1084804515001228},
urldate = {2023-10-10},
abstract = {Supervisory Control and Data Acquisition (SCADA) systems are one of the key foundations of smart grids. The Distributed Network Protocol version 3 (DNP3) is a standard SCADA protocol designed to facilitate communications in substations and smart grid nodes. The protocol is embedded with a security mechanism called Secure Authentication (DNP3-SA). This mechanism ensures that end-to-end communication security is provided in substations. This paper presents a formal model for the behavioural analysis of DNP3-SA using Coloured Petri Nets (CPN). Our DNP3-SA CPN model is capable of testing and verifying various attack scenarios: modification, replay and spoofing, combined complex attack and mitigation strategies. Using the model has revealed a previously unidentified flaw in the DNP3-SA protocol that can be exploited by an attacker that has access to the network interconnecting DNP3 devices. An attacker can launch a successful attack on an outstation without possessing the pre-shared keys by replaying a previously authenticated command with arbitrary parameters. We propose an update to the DNP3-SA protocol that removes the flaw and prevents such attacks. The update is validated and verified using our CPN model proving the effectiveness of the model and importance of the formal protocol analysis.},
langid = {english},
file = {/home/danesabo/Zotero/storage/LDFHS85J/Amoah et al. - 2016 - Formal modelling and analysis of DNP3 secure authe.pdf}
}
@article{amoahSecuringDNP3Broadcast2016,
title = {Securing {{DNP3 Broadcast Communications}} in {{SCADA Systems}}},
author = {Amoah, Raphael and Camtepe, Seyit and Foo, Ernest},
date = {2016-08},
journaltitle = {IEEE Transactions on Industrial Informatics},
shortjournal = {IEEE Trans. Ind. Inf.},
volume = {12},
number = {4},
pages = {1474--1485},
issn = {1551-3203, 1941-0050},
doi = {10.1109/TII.2016.2587883},
url = {http://ieeexplore.ieee.org/document/7506334/},
urldate = {2023-10-10},
abstract = {The Distributed Network Protocol version 3 (DNP3) provides Secure Authentication (DNP3-SA) as the mechanism to authenticate unicast messages from a master station to its outstations in supervisory control and data acquisition systems. In large-scale systems, it may be necessary to broadcast a critical request from a master station to multiple outstations at once. The DNP3 protocol standard describes the use of broadcast communication; however, it does not specify its security. This paper is the first to present DNP3 Secure Authentication for Broadcast (DNP3-SAB), a new lightweight security scheme for broadcast mode communication. This scheme is based on hash chain and only makes use of the existing cryptographic primitives specified in DNP3-SA. The scheme integrates itself into the DNP3-SA key update process. The proposed scheme is modeled, validated, and verified using colored Petri Nets against the most common protocol attacks such as modification, injection, and replay. Performance analysis on our scheme and the existing DNP3-SA modes (NACR and AGM) shows that DNP3-SAB reduces the communication overhead significantly at the cost of an increase with a constant term in processing and storage overhead. This benefit is maintained even when DNP3-SAB is under attack.},
langid = {english},
file = {/home/danesabo/Zotero/storage/4L7BACFU/Amoah et al. - 2016 - Securing DNP3 Broadcast Communications in SCADA Sy.pdf}
}
@inproceedings{amoahSecurityAnalysisNonaggressive2014,
title = {Security Analysis of the Non-Aggressive Challenge Response of the {{DNP3}} Protocol Using a {{CPN}} Model},
booktitle = {2014 {{IEEE International Conference}} on {{Communications}} ({{ICC}})},
author = {Amoah, Raphael and Suriadi, Suriadi and Camtepe, Seyit and Foo, Ernest},
date = {2014-06},
pages = {827--833},
publisher = {IEEE},
location = {Sydney, NSW},
doi = {10.1109/ICC.2014.6883422},
url = {http://ieeexplore.ieee.org/document/6883422/},
urldate = {2023-10-10},
abstract = {Distributed Network Protocol Version 3 (DNP3) is the de-facto communication protocol for power grids. Standardbased interoperability among devices has made the protocol useful to other infrastructures such as water, sewage, oil and gas. DNP3 is designed to facilitate interaction between master stations and outstations. In this paper, we apply a formal modelling methodology called Coloured Petri Nets (CPN) to create an executable model representation of DNP3 protocol. The model facilitates the analysis of the protocol to ensure that the protocol will behave as expected. Also, we illustrate how to verify and validate the behaviour of the protocol, using the CPN model and the corresponding state space tool to determine if there are insecure states. With this approach, we were able to identify a Denial of Service (DoS) attack against the DNP3 protocol.},
eventtitle = {{{ICC}} 2014 - 2014 {{IEEE International Conference}} on {{Communications}}},
isbn = {978-1-4799-2003-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/2XWVX68Q/Amoah et al. - 2014 - Security analysis of the non-aggressive challenge .pdf}
}
@inproceedings{anandROSCoqRobotsPowered2015,
title = {{{ROSCoq}}: {{Robots Powered}} by {{Constructive Reals}}},
shorttitle = {{{ROSCoq}}},
booktitle = {Interactive {{Theorem Proving}}},
author = {Anand, Abhishek and Knepper, Ross},
editor = {Urban, Christian and Zhang, Xingyuan},
date = {2015},
pages = {34--50},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-22102-1_3},
abstract = {We present ROSCoq, a framework for developing certified Coq programs for robots. ROSCoq subsystems communicate using messages, as they do in the Robot Operating System (ROS). We extend the logic of events to enable holistic reasoning about the cyber-physical behavior of robotic systems. The behavior of the physical world (e.g. Newton’s laws) and associated devices (e.g. sensors, actuators) are specified axiomatically. For reasoning about physics we use and extend CoRN’s theory of constructive real analysis. Instead of floating points, our Coq programs use CoRN’s exact, yet fast computations on reals, thus enabling accurate reasoning about such computations.},
isbn = {978-3-319-22102-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/QL3ZHIDZ/Anand and Knepper - 2015 - ROSCoq Robots Powered by Constructive Reals.pdf}
}
@inproceedings{annpureddySTaLiRoToolTemporal2011,
title = {S-{{TaLiRo}}: {{A Tool}} for {{Temporal Logic Falsification}} for {{Hybrid Systems}}},
shorttitle = {S-{{TaLiRo}}},
booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
author = {Annpureddy, Yashwanth and Liu, Che and Fainekos, Georgios and Sankaranarayanan, Sriram},
editor = {Abdulla, Parosh Aziz and Leino, K. Rustan M.},
date = {2011},
series = {Lecture {{Notes}} in {{Computer Science}}},
pages = {254--257},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-19835-9_21},
abstract = {S-TaLiRo is a Matlab (TM) toolbox that searches for trajectories of minimal robustness in Simulink/Stateflow diagrams. It can analyze arbitrary Simulink models or user defined functions that model the system. At the heart of the tool, we use randomized testing based on stochastic optimization techniques including Monte-Carlo methods and Ant-Colony Optimization. Among the advantages of the toolbox is the seamless integration inside the Matlab environment, which is widely used in the industry for model-based development of control software. We present the architecture of S-TaLiRo and its working on an application example.},
isbn = {978-3-642-19835-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/IEZS7RP5/Annpureddy et al. - 2011 - S-TaLiRo A Tool for Temporal Logic Falsification .pdf}
}
@article{annunziatoConnectionHamiltonJacobiBellmanFokkerPlanck2014,
title = {On the {{Connection}} between the {{Hamilton-Jacobi-Bellman}} and the {{Fokker-Planck Control Frameworks}}},
author = {Annunziato, Mario and Borzì, Alfio and Nobile, Fabio and Tempone, Raul},
date = {2014-08-29},
journaltitle = {Applied Mathematics},
volume = {5},
number = {16},
pages = {2476--2484},
publisher = {Scientific Research Publishing},
doi = {10.4236/am.2014.516239},
url = {https://www.scirp.org/journal/paperinformation.aspx?paperid=49428},
urldate = {2023-10-27},
abstract = {In the framework of stochastic processes, the connection between the dynamic programming scheme given by the Hamilton-Jacobi-Bellman equation and a recently proposed control approach based on the Fokker-Planck equation is discussed. Under appropriate assumptions it is shown that the two strategies are equivalent in the case of expected cost functionals, while the Fokker-Planck formalism allows considering a larger classof objectives. To illustratethe connection between the two control strategies, the cases of an Itō stochastic process and of a piecewise-deterministic process are considered.},
issue = {16},
langid = {english},
file = {/home/danesabo/Zotero/storage/TR2PK9NQ/Annunziato et al. - 2014 - On the Connection between the Hamilton-Jacobi-Bell.pdf}
}
@article{antoNovelFrameworkDesign2023,
title = {A {{Novel Framework}} for the {{Design}} of {{Resilient Cyber-Physical Systems Using Control Theory}} and {{Formal Methods}}},
author = {Anto, Kelvin and Swain, Akshya Kumar and Roop, Partha},
date = {2023},
journaltitle = {IEEE Access},
shortjournal = {IEEE Access},
volume = {11},
pages = {73556--73567},
issn = {2169-3536},
doi = {10.1109/ACCESS.2023.3295421},
url = {https://ieeexplore.ieee.org/document/10184000/},
urldate = {2023-11-03},
file = {/home/danesabo/Zotero/storage/PYHR6JE8/Anto et al. - 2023 - A Novel Framework for the Design of Resilient Cybe.pdf}
}
@online{aranhaHELIOPOLISVerifiableComputation2023,
title = {{{HELIOPOLIS}}: {{Verifiable Computation}} over {{Homomorphically Encrypted Data}} from {{Interactive Oracle Proofs}} Is {{Practical}}},
shorttitle = {{{HELIOPOLIS}}},
author = {Aranha, Diego F. and Costache, Anamaria and Guimarães, Antonio and Soria-Vazquez, Eduardo},
date = {2023},
number = {2023/1949},
url = {https://eprint.iacr.org/2023/1949},
urldate = {2024-03-28},
abstract = {Homomorphic encryption (HE) enables computation on encrypted data, which in turn facilitates the outsourcing of computation on private data. However, HE offers no guarantee that the returned result was honestly computed by the cloud. In order to have such guarantee, it is necessary to add verifiable computation (VC) into the system. The most efficient recent works in VC over HE focus on verifying operations on the ciphertext space of the HE scheme, which usually lacks the algebraic structure that would make it compatible with existing VC systems. For example, multiplication of ciphertexts in the current most efficient HE schemes requires non-algebraic operations such as real division and rounding. Therefore, existing works for VC over HE have to either give up on those efficient HE schemes, or incur a large overhead (an amount of constraints proportional to the ciphertext ring's size) in order to emulate these non-algebraic operations. In this work, we move away from that paradigm by placing the verification checks in the plaintext space of HE, all while the prover remains computing on ciphertexts. We achieve this by introducing a general transformation for Interactive Oracle Proofs (IOPs) to work over HE, whose result we denote as HE-IOPs. We apply this same transformation to the FRI [Ben-Sasson et al., ICALP 2018] IOP of proximity and we show how to compile HE-Reed Solomon-encoded IOPs and HE-\$\textbackslash delta\$-correlated-IOPs with HE-FRI into HE-IOPs. Furthermore, our construction is compatible with a prover that provides input in zero-knowledge, and only relies on building blocks that are plausibly quantum-safe. Aligning the security parameters of HE and FRI is a difficult task for which we introduce several optimizations. We demonstrate their efficiency with a proof-of-concept implementation in Python and show that, for an encrypted Reed Solomon codeword with degree bound \$2\textasciicircum\{11\}\$ and rate \$1/16\$ in a (plaintext) field of size \$2\textasciicircum\{256\}\$, we can run FRI's commit phase in just 43 minutes on a single thread on a c6i.metal instance (which could be reduced to less than a minute in a multi-threaded implementation in a large server). Verification takes less than 0.2 seconds, and, based on micro-benchmarks of the employed techniques, we show it could be up to 100 times faster in a fully optimized implementation.},
pubstate = {prepublished},
annotation = {Publication info: Preprint.},
file = {/home/danesabo/Zotero/storage/DZQWEJY8/Aranha et al. - 2023 - HELIOPOLIS Verifiable Computation over Homomorphi.pdf}
}
@article{arkadovVirtualDigitalNuclear2014,
title = {The Virtual Digital Nuclear Power Plant: {{A}} Modern Tool for Supporting the Lifecycle of {{VVER-based}} Nuclear Power Units},
shorttitle = {The Virtual Digital Nuclear Power Plant},
author = {Arkadov, G. V. and Zhukavin, A. P. and Kroshilin, A. E. and Parshikov, I. A. and Solov’ev, S. L. and Shishov, A. V.},
date = {2014-10},
journaltitle = {Thermal Engineering},
shortjournal = {Therm. Eng.},
volume = {61},
number = {10},
pages = {697--705},
issn = {0040-6015, 1555-6301},
doi = {10.1134/S0040601514100012},
url = {http://link.springer.com/10.1134/S0040601514100012},
urldate = {2023-10-11},
abstract = {The article describes the “Virtual Digital VVER–Based Nuclear Power Plant” computerized sys tem comprising a totality of verified initial data (sets of input data for a model intended for describing the behavior of nuclear power plant (NPP) systems in design and emergency modes of their operation) and a uni fied system of new generation computation codes intended for carrying out coordinated computation of the variety of physical processes in the reactor core and NPP equipment. Experiments with the demonstration version of the “Virtual Digital VVER Based NPP” computerized system has shown that it is in principle pos sible to set up a unified system of computation codes in a common software environment for carrying out interconnected calculations of various physical phenomena at NPPs constructed according to the standard AES 2006 project. With the full scale version of the “Virtual Digital VVER Based NPP” computerized sys tem put in operation, the concerned engineering, design, construction, and operating organizations will have access to all necessary information relating to the NPP power unit project throughout its entire lifecycle. The domestically developed commercial grade software product set to operate as an independently operating application to the project will bring about additional competitive advantages in the modern market of nuclear power technologies.},
langid = {english},
file = {/home/danesabo/Zotero/storage/WVXG2HAU/Arkadov et al. - 2014 - The virtual digital nuclear power plant A modern .pdf}
}
@article{arrietaExplainableArtificialIntelligence2020,
title = {Explainable {{Artificial Intelligence}} ({{XAI}}): {{Concepts}}, Taxonomies, Opportunities and Challenges toward Responsible {{AI}}},
author = {Arrieta, Alejandro Barredo and Díaz-Rodríguez, Natalia and Del Ser, Javier and Bennetot, Adrien and Tabik, Siham and Barbado, Alberto and García, Salvador and Gil-López, Sergio and Molina, Daniel and Benjamins, Richard},
date = {2020},
journaltitle = {Information fusion},
volume = {58},
pages = {82--115},
publisher = {Elsevier},
isbn = {1566-2535},
file = {/home/danesabo/Zotero/storage/AANMSF9S/storage:storage:storage:Explainable Artificial Intelligence (XAI): Concepts, Taxonomies,
Opportunities and Challenges toward Responsible AI.pdf}
}
@book{arthoFormalTechniquesSafetyCritical2015,
title = {Formal {{Techniques}} for {{Safety-Critical Systems}}},
author = {Artho, Cyrille and Ölveczky, Peter Csaba},
date = {2015},
publisher = {Springer},
file = {/home/danesabo/Zotero/storage/BH4V4E7U/Formal Techniques for Safety Critical Systems.pdf}
}
@incollection{asarinReachabilityAnalysisNonlinear2003,
title = {Reachability {{Analysis}} of {{Nonlinear Systems Using Conservative Approximation}}},
booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
author = {Asarin, Eugene and Dang, Thao and Girard, Antoine},
editor = {Maler, Oded and Pnueli, Amir},
editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
editoratype = {redactor},
date = {2003},
volume = {2623},
pages = {20--35},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/3-540-36580-X_5},
url = {http://link.springer.com/10.1007/3-540-36580-X_5},
urldate = {2023-11-22},
isbn = {978-3-540-00913-9 978-3-540-36580-8}
}
@inproceedings{asarinRecentProgressContinuous2006,
title = {Recent Progress in Continuous and Hybrid Reachability Analysis},
booktitle = {2006 {{IEEE Conference}} on {{Computer Aided Control System Design}}, 2006 {{IEEE International Conference}} on {{Control Applications}}, 2006 {{IEEE International Symposium}} on {{Intelligent Control}}},
author = {Asarin, Eugene and Dang, Thao and Frehse, Goran and Girard, Antoine and Le Guernic, Colas and Maler, Oded},
date = {2006-10},
pages = {1582--1587},
publisher = {IEEE},
location = {Munich, Germany},
doi = {10.1109/CACSD-CCA-ISIC.2006.4776877},
url = {http://ieeexplore.ieee.org/document/4776877/},
urldate = {2023-11-22},
eventtitle = {2006 {{IEEE Conference}} on {{Computer Aided Control System Design}}, 2006 {{IEEE International Conference}} on {{Control Applications}}, 2006 {{IEEE International Symposium}} on {{Intelligent Control}}}
}
@incollection{askarpourFormalMethodsDesigning2019,
title = {Formal {{Methods}} in {{Designing Critical Cyber-Physical Systems}}},
booktitle = {From {{Software Engineering}} to {{Formal Methods}} and {{Tools}}, and {{Back}}},
author = {Askarpour, Mehrnoosh and Ghezzi, Carlo and Mandrioli, Dino and Rossi, Matteo and Tsigkanos, Christos},
editor = {Ter Beek, Maurice H. and Fantechi, Alessandro and Semini, Laura},
date = {2019},
volume = {11865},
pages = {110--130},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-30985-5_8},
url = {http://link.springer.com/10.1007/978-3-030-30985-5_8},
urldate = {2023-11-03},
isbn = {978-3-030-30984-8 978-3-030-30985-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/2TB596AF/Askarpour et al. - 2019 - Formal Methods in Designing Critical Cyber-Physica.pdf}
}
@incollection{askarpourFormalMethodsDesigning2019a,
title = {Formal {{Methods}} in {{Designing Critical Cyber-Physical Systems}}},
booktitle = {From {{Software Engineering}} to {{Formal Methods}} and {{Tools}}, and {{Back}}},
author = {Askarpour, Mehrnoosh and Ghezzi, Carlo and Mandrioli, Dino and Rossi, Matteo and Tsigkanos, Christos},
editor = {Ter Beek, Maurice H. and Fantechi, Alessandro and Semini, Laura},
date = {2019},
volume = {11865},
pages = {110--130},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-30985-5_8},
url = {http://link.springer.com/10.1007/978-3-030-30985-5_8},
urldate = {2023-10-10},
abstract = {Cyber-Physical Systems (CPS) are increasingly applied in critical contexts, where they have to support safe and secure operations, often subject to stringent timing requirements. Typical examples are scenarios involving automated living or working spaces in which humans operate, or human-robot collaborations (HRC) in modern manufacturing. Formal methods have been traditionally investigated to support modeling and verification of critical systems. In this paper, we review some of the main new challenges arising in the application of formal methods to modeling and verification of CPS. We do that by presenting two case studies (emergency response in a smart city and a smart manufacturing system), reflecting past work of the authors, from which some general lessons are distilled.},
isbn = {978-3-030-30984-8 978-3-030-30985-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/TCAKWGJ8/Askarpour et al. - 2019 - Formal Methods in Designing Critical Cyber-Physica.pdf}
}
@article{askarpourFormalModelHuman2019,
title = {Formal Model of Human Erroneous Behavior for Safety Analysis in Collaborative Robotics},
author = {Askarpour, Mehrnoosh and Mandrioli, Dino and Rossi, Matteo and Vicentini, Federico},
date = {2019-06},
journaltitle = {Robotics and Computer-Integrated Manufacturing},
shortjournal = {Robotics and Computer-Integrated Manufacturing},
volume = {57},
pages = {465--476},
issn = {07365845},
doi = {10.1016/j.rcim.2019.01.001},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0736584518303247},
urldate = {2023-10-13},
abstract = {Recent developments in manufacturing technologies, also known as Industry 4.0, seek to build Smart Factories where supply chains and production lines are equipped with a higher level of automation. However, this significant innovation does not entirely eliminate the need for the presence of human operators; on the contrary, it requires them to collaborate with robots and execute hybrid tasks. Thus, creating safe workspaces for human operators is crucial for the future of factories where humans and robots collaborate closely in common workspaces. The uncertainty of human behavior and, consequently, of the actual execution of workflows, pose significant challenges to the safety of collaborative applications. This paper extends our earlier work, a formal verification methodology to analyze the safety of collaborative robotics applications (Askarpour et al. 2017) [1], with a rich non-deterministic formal model of operator behaviors that captures the hazardous situations resulting from human errors. The model allows safety engineers to refine their designs until all plausible erroneous behaviors are considered and mitigated. The solidity of the proposed approach is evaluated on a pair of real-life case studies.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JACEQ3NC/Askarpour et al. - 2019 - Formal model of human erroneous behavior for safet.pdf}
}
@online{AutoGuild,
title = {Auto {{Guild}}},
url = {https://auto-guild.com/a/downloads/-/7d1fe75e4feb7a90/4e78bd1364fcff9d},
urldate = {2025-04-07},
abstract = {We help classic car enthusiasts build their ultimate car by offering expert information and advice. Engine swaps and performance mods, and everything in-between. Let's build great cars.},
langid = {english},
organization = {Auto Guild},
file = {/home/danesabo/Zotero/storage/JXWY9GKM/Auto Guild.pdf;/home/danesabo/Zotero/storage/I7WW8VJP/4e78bd1364fcff9d.html}
}
@article{avigadFORMALSYSTEMEUCLIDS2009,
title = {A {{FORMAL SYSTEM FOR EUCLID}}’{{S}} {{{\mkbibemph{ELEMENTS}}}}},
author = {Avigad, Jeremy and Dean, Edward and Mumma, John},
date = {2009-12},
journaltitle = {The Review of Symbolic Logic},
shortjournal = {The Review of Symbolic Logic},
volume = {2},
number = {4},
pages = {700--768},
issn = {1755-0203, 1755-0211},
doi = {10.1017/S1755020309990098},
url = {https://www.cambridge.org/core/product/identifier/S1755020309990098/type/journal_article},
urldate = {2024-05-16},
abstract = {We present a formal system, E, which provides a faithful model of the proofs in Euclid’s Elements, including the use of diagrammatic reasoning.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DBTC2JCM/Avigad et al. - 2009 - A FORMAL SYSTEM FOR EUCLID’S ELEMENTS.pdf}
}
@inproceedings{ayo-imoruEnhancedFaultDiagnosis2021,
title = {An Enhanced Fault Diagnosis in Nuclear Power Plants for a Digital Twin Framework},
booktitle = {2021 {{International Conference}} on {{Electrical}}, {{Computer}} and {{Energy Technologies}} ({{ICECET}})},
author = {Ayo-Imoru, Ronke M. and Ali, Ahmed A. and Bokoro, Pitshou N.},
date = {2021-12-09},
pages = {1--6},
publisher = {IEEE},
location = {Cape Town, South Africa},
doi = {10.1109/ICECET52533.2021.9698715},
url = {https://ieeexplore.ieee.org/document/9698715/},
urldate = {2023-10-11},
abstract = {Nuclear power plants can provide a huge amount of clean energy, which can help most countries to meet their greenhouse gas emission requirements according to the Paris agreement on climate change. To meet this energy need, the nuclear plant must be operated safely and economically, which makes the digital twin concept viable for achieving this aim. The digital twin can be used to monitor plant condition, fault diagnosis, prediction, and plant maintenance support systems. In this work, the framework for digital twin in a nuclear plant is proposed. This framework combines the application of the nuclear plant simulator and machine learning tools. The machine learning aspect of this digital twin concept is the focus of this paper. Data was generated by using a personal computer-based nuclear plant simulator. Principal component analysis was used in reducing the data dimension. Artificial neural networks and adaptive neuro-fuzzy inference systems were trained with the reduced data and used to diagnose the faults. Four faults in the plant were diagnosed with minimal error. The fault diagnosis is a significant aspect of the digital twin framework.},
eventtitle = {2021 {{International Conference}} on {{Electrical}}, {{Computer}} and {{Energy Technologies}} ({{ICECET}})},
isbn = {978-1-66544-231-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/XXPXKD3S/Ayo-Imoru et al. - 2021 - An enhanced fault diagnosis in nuclear power plant.pdf}
}
@article{ayo-imoruHybridNuclearPlant2017,
title = {Hybrid Nuclear Plant Simulator Design Requirements to Enable Dynamic Diagnostics of Plant Operations},
author = {Ayo-Imoru, R.M. and Cilliers, A.C.},
date = {2017-03},
journaltitle = {Annals of Nuclear Energy},
shortjournal = {Annals of Nuclear Energy},
volume = {101},
pages = {447--453},
issn = {03064549},
doi = {10.1016/j.anucene.2016.11.034},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0306454916308283},
urldate = {2023-10-11},
abstract = {With nuclear plant full scope simulator technology reaching maturity, the possibility of using its capabilities in expert systems such as online plant diagnostics has become a reality. The effectiveness of plant diagnostics using real-time simulated measurements as a plant reference has been shown in previous papers. However, in order to implement these systems, the full scope plant simulator needs to be designed specifically with this application in mind. This will help in maximising the effectiveness and scope of use of the system. This paper investigates the various simulator technologies available as well as the development strategies and focus areas to establish the design requirements of a single, full scope engineering and training nuclear plant simulator. This can be implemented to provide a real-time dynamic reference to the plant diagnostic system.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DACDBKXR/Ayo-Imoru and Cilliers - 2017 - Hybrid nuclear plant simulator design requirements.pdf}
}
@article{baanenHitchhikersGuideLogical,
title = {The {{Hitchhiker}}'s {{Guide}} to {{Logical Verification}}},
author = {Baanen, Anne and Bentkamp, Alexander and Blanchette, Jasmin and Hölzl, Johannes and Limperg, Jannis},
langid = {english},
file = {/home/danesabo/Zotero/storage/R625RBEG/Baanen et al. - The Hitchhiker's Guide to Logical Verification.pdf}
}
@report{BackBuildingBlocks,
title = {Back to the {{Building Blocks}}: {{A Path}} toward {{Secure}} and {{Measurable Software}}},
url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
urldate = {2024-04-30},
file = {/home/danesabo/Zotero/storage/E6Q6DUPX/Final-ONCD-Technical-Report.pdf}
}
@article{baezOpenPetriNets2020,
title = {Open {{Petri Nets}}},
author = {Baez, John C. and Master, Jade},
date = {2020-03},
journaltitle = {Mathematical Structures in Computer Science},
shortjournal = {Math. Struct. Comp. Sci.},
volume = {30},
number = {3},
eprint = {1808.05415},
eprinttype = {arXiv},
eprintclass = {cs, math},
pages = {314--341},
issn = {0960-1295, 1469-8072},
doi = {10.1017/S0960129520000043},
url = {http://arxiv.org/abs/1808.05415},
urldate = {2023-12-12},
abstract = {The reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category \$\textbackslash mathsf\{Open\}(\textbackslash mathsf\{Petri\})\$, which becomes symmetric monoidal under disjoint union. However, since the composite of open Petri nets is defined only up to isomorphism, it is better to treat them as morphisms of a symmetric monoidal double category \$\textbackslash mathbb\{O\}\textbackslash mathbf\{pen\}(\textbackslash mathsf\{Petri\})\$. We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of \$\textbackslash mathbb\{O\}\textbackslash mathbf\{pen\}(\textbackslash mathsf\{Petri\})\$. The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out. This is done in a compositional way, so that these categories can be computed on smaller subnets and then glued together. The second, a reachability semantics, simply says which markings of the outputs can be reached from a given marking of the inputs.},
file = {/home/danesabo/Zotero/storage/A7YADSNG/Baez and Master - 2020 - Open Petri Nets.pdf;/home/danesabo/Zotero/storage/4RYR2R52/1808.html}
}
@article{bakirtzisCompositionalCyberPhysicalSystems2021,
title = {Compositional {{Cyber-Physical Systems Modeling}}},
author = {Bakirtzis, Georgios and Vasilakopoulou, Christina and Fleming, Cody H.},
date = {2021-02-08},
journaltitle = {Electronic Proceedings in Theoretical Computer Science},
shortjournal = {Electron. Proc. Theor. Comput. Sci.},
volume = {333},
pages = {125--138},
issn = {2075-2180},
doi = {10.4204/EPTCS.333.9},
url = {http://arxiv.org/abs/2101.10484v1},
urldate = {2023-11-08},
langid = {english},
file = {/home/danesabo/Zotero/storage/4X7RSJTM/Bakirtzis et al. - 2021 - Compositional Cyber-Physical Systems Modeling.pdf}
}
@article{bakVerifyingCyberphysicalSystems2016,
title = {Verifying Cyber-Physical Systems by Combining Software Model Checking with Hybrid Systems Reachability},
author = {Bak, Stanley and Chaki, Sagar},
date = {2016},
journaltitle = {2016 International Conference on Embedded Software (EMSOFT)},
pages = {1--10},
doi = {10.1145/2968478.2968490},
file = {/home/danesabo/Zotero/storage/YGTE3H28/_.pdf}
}
@article{bansalIntroductionReachability,
title = {Introduction to {{Reachability}}},
author = {Bansal, Somil},
langid = {english},
file = {/home/danesabo/Zotero/storage/EA5YJSPF/Bansal - Introduction to Reachability.pdf}
}
@article{barnettRouthsAlgorithmCentennial1977,
title = {Routh’s {{Algorithm}}: {{A Centennial Survey}}},
shorttitle = {Routh’s {{Algorithm}}},
author = {Barnett, S. and {šiljak}, D. D.},
date = {1977-07},
journaltitle = {SIAM Review},
shortjournal = {SIAM Rev.},
volume = {19},
number = {3},
pages = {472--489},
publisher = {{Society for Industrial and Applied Mathematics}},
issn = {0036-1445},
doi = {10.1137/1019070},
url = {https://epubs.siam.org/doi/abs/10.1137/1019070},
urldate = {2024-03-04},
abstract = {To decide whether a prescribed complex polynomial has all its zeros with negative real parts, there are available many tests involving the checking of rational or polynomial inequalities in the coefficients. It is shown that the generalized Routh–Hurwitz conditions are from a certain point of view not replaceable by simpler conditions.},
file = {/home/danesabo/Zotero/storage/2B77KUQZ/Barnett and šiljak - 1977 - Routh’s Algorithm A Centennial Survey.pdf}
}
@incollection{barrettSatisfiabilityModuloTheories2018,
title = {Satisfiability {{Modulo Theories}}},
booktitle = {Handbook of {{Model Checking}}},
author = {Barrett, Clark and Tinelli, Cesare},
editor = {Clarke, Edmund M. and Henzinger, Thomas A. and Veith, Helmut and Bloem, Roderick},
date = {2018},
pages = {305--343},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-10575-8_11},
url = {http://link.springer.com/10.1007/978-3-319-10575-8_11},
urldate = {2023-11-02},
abstract = {Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT are used as back-end engines in model-checking applications such as bounded, interpolation-based, and predicate-abstraction-based model checking. After a brief illustration of these uses, we survey the predominant techniques for solving SMT problems with an emphasis on the lazy approach, in which a propositional satisfiability (SAT) solver is combined with one or more theory solvers. We discuss the architecture of a lazy SMT solver, give examples of theory solvers, show how to combine such solvers modularly, and mention several extensions of the lazy approach. We also briefly describe the eager approach in which the SMT problem is reduced to a SAT problem. Finally, we discuss how the basic framework for determining satisfiability can be extended with additional functionality such as producing models, proofs, unsatisfiable cores, and interpolants.},
isbn = {978-3-319-10574-1 978-3-319-10575-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/5KEQZZKH/Barrett and Tinelli - 2018 - Satisfiability Modulo Theories.pdf}
}
@article{bartosiewiczLocalPositiveReachability2016,
title = {Local {{Positive Reachability}} of {{Nonlinear Continuous-Time Systems}}},
author = {Bartosiewicz, Zbigniew},
date = {2016-12},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {61},
number = {12},
pages = {4217--4221},
issn = {0018-9286, 1558-2523},
doi = {10.1109/TAC.2015.2511921},
url = {http://ieeexplore.ieee.org/document/7365428/},
urldate = {2023-11-22}
}
@article{basnightFirmwareModificationAttacks2013,
title = {Firmware Modification Attacks on Programmable Logic Controllers},
author = {Basnight, Zachry and Butts, Jonathan and Lopez, Juan and Dube, Thomas},
date = {2013-06-01},
journaltitle = {International Journal of Critical Infrastructure Protection},
shortjournal = {International Journal of Critical Infrastructure Protection},
volume = {6},
number = {2},
pages = {76--84},
issn = {1874-5482},
doi = {10.1016/j.ijcip.2013.04.004},
url = {https://www.sciencedirect.com/science/article/pii/S1874548213000231},
urldate = {2024-08-14},
abstract = {Recent attacks on industrial control systems, such as the highly publicized Stuxnet malware, have intensified a “race to the bottom” where lower-level attacks have a tactical advantage. Programmable logic controller (PLC) firmware, which provides a software-driven interface between system inputs and physical outputs, can be easily modified at the user level. Efforts directed at protecting against firmware modification are hindered by the lack of foundational research about attack development and implementation. This paper examines the vulnerability of PLCs to intentional firmware modifications in order to obtain a better understanding of the threats posed by PLC firmware modification attacks and the feasibility of these attacks. A general firmware analysis methodology is presented, and a proof-of-concept experiment is used to demonstrate how legitimate firmware can be updated and uploaded to an Allen-Bradley ControlLogix L61 PLC.},
keywords = {Firmware,Industrial control systems,Modification attacks,Programmable logic controllers,Reverse engineering},
file = {/home/danesabo/Zotero/storage/Q79V2USH/S1874548213000231.html}
}
@article{beltaFormalMethodsControl2019,
title = {Formal {{Methods}} for {{Control Synthesis}}: {{An Optimization Perspective}}},
shorttitle = {Formal {{Methods}} for {{Control Synthesis}}},
author = {Belta, Calin and Sadraddini, Sadra},
date = {2019-05-03},
journaltitle = {Annual Review of Control, Robotics, and Autonomous Systems},
volume = {2},
pages = {115--140},
publisher = {Annual Reviews},
issn = {2573-5144},
doi = {10.1146/annurev-control-053018-023717},
url = {https://www.annualreviews.org/content/journals/10.1146/annurev-control-053018-023717},
urldate = {2025-03-31},
abstract = {In control theory, complicated dynamics such as systems of (nonlinear) differential equations are controlled mostly to achieve stability. This fundamental property, which can be with respect to a desired operating point or a prescribed trajectory, is often linked with optimality, which requires minimizing a certain cost along the trajectories of a stable system. In formal verification (model checking), simple systems, such as finite-state transition graphs that model computer programs or digital circuits, are checked against rich specifications given as formulas of temporal logics. The formal synthesis problem, in which the goal is to synthesize or control a finite system from a temporal logic specification, has recently received increased interest. In this article, we review some recent results on the connection between optimal control and formal synthesis. Specifically, we focus on the following problem: Given a cost and a correctness temporal logic specification for a dynamical system, generate an optimal control strategy that satisfies the specification. We first provide a short overview of automata-based methods, in which the dynamics of the system are mapped to a finite abstraction that is then controlled using an automaton corresponding to the specification. We then provide a detailed overview of a class of methods that rely on mapping the specification and the dynamics to constraints of an optimization problem. We discuss advantages and limitations of these two types of approaches and suggest directions for future research.},
issue = {Volume 2, 2019},
langid = {english},
file = {/home/danesabo/Zotero/storage/9GDXVFRV/Belta and Sadraddini - 2019 - Formal Methods for Control Synthesis An Optimization Perspective.pdf}
}
@book{beltaFormalMethodsDiscretetime2017a,
title = {Formal Methods for Discrete-Time Dynamical Systems},
author = {Belta, Calin and Yordanov, Boyan and Gol, Ebru Aydin},
date = {2017},
volume = {89},
publisher = {Springer},
isbn = {3-319-50763-X}
}
@inproceedings{beltaFormalMethodsDynamical2014,
title = {Formal {{Methods}} for {{Dynamical Systems}}},
booktitle = {2014 21st {{International Symposium}} on {{Temporal Representation}} and {{Reasoning}}},
author = {Belta, Calin},
date = {2014-09},
pages = {3--3},
issn = {2332-6468},
doi = {10.1109/TIME.2014.16},
url = {https://ieeexplore.ieee.org/document/6940367},
urldate = {2023-10-30},
abstract = {In control theory, "complex" models of physical processes, such as systems of differential equations, are usually checked against "simple" specifications, such as stability and set invariance. In formal methods, "rich" specifications, such as languages and formulae of temporal logics, are checked against "simple" models of software programs and digital circuits, such as finite transition graphs. With the development and integration of cyber physical and safety critical systems, there is an increasing need for computational tools for verification and control of complex systems from rich, temporal logic specifications. The formal verification and synthesis problems have been shown to be undecidable even for very simple classes of infinitespace continuous and hybrid systems. However, provably correct but conservative approaches, in which the satisfaction of a property by a dynamical system is implied by the satisfaction of the property by a finite over-approximation (abstraction) of the system, have received a lot of attention in recent years. Some classes of systems allowing for computationally efficient verification and control from temporal logic specifications are reviewed. For continuous and discrete-time linear systems and continuous-time multi-linear systems, it is shown that finite abstractions can be constructed through polyhedral operations only. By using techniques from model checking and automata games, this allows for verification and control from specifications given as Linear Temporal Logic (LTL) formulae over linear predicates in the state variables. A connection between the existence of Lyapunov functions and finite bisimulations is established for discrete-time linear and switched linear systems. Finally, optimality and correctness requirements are combined in a model predictive approach to generate control strategies for discrete-time linear systems. The usefulness of these computational tools is illustrated with various examples such as verification and synthesis of biological circuits in synthetic biology and motion planning and control in robotics.},
eventtitle = {2014 21st {{International Symposium}} on {{Temporal Representation}} and {{Reasoning}}},
file = {/home/danesabo/Zotero/storage/GRSZBL4X/Belta - 2014 - Formal Methods for Dynamical Systems.pdf;/home/danesabo/Zotero/storage/2SSRE3WT/6940367.html}
}
@article{benidirExtendedTableEliminating1990,
title = {Extended Table for Eliminating the Singularities in {{Routh}}'s Array},
author = {Benidir, M. and Picinbono, B.},
date = {1990-02},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {35},
number = {2},
pages = {218--222},
issn = {00189286},
doi = {10.1109/9.45185},
url = {http://ieeexplore.ieee.org/document/45185/},
urldate = {2024-03-04},
langid = {english},
file = {/home/danesabo/Zotero/storage/GAFM9PG4/Benidir and Picinbono - 1990 - Extended table for eliminating the singularities i.pdf}
}
@article{bernardiSecurityModellingFormal2021,
title = {Security Modelling and Formal Verification of Survivability Properties: {{Application}} to Cyber–Physical Systems},
shorttitle = {Security Modelling and Formal Verification of Survivability Properties},
author = {Bernardi, S. and Gentile, U. and Marrone, S. and Merseguer, J. and Nardone, R.},
date = {2021-01},
journaltitle = {Journal of Systems and Software},
shortjournal = {Journal of Systems and Software},
volume = {171},
pages = {110746},
issn = {01641212},
doi = {10.1016/j.jss.2020.110746},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0164121220301710},
urldate = {2023-10-10},
abstract = {The modelling and verification of systems security is an open research topic whose complexity and importance needs, in our view, the use of formal and non-formal methods. This paper addresses the modelling of security using misuse cases and the automatic verification of survivability properties using model checking. The survivability of a system characterises its capacity to fulfil its mission (promptly) in the presence of attacks, failures, or accidents, as defined by Ellison. The original contributions of this paper are a methodology and its tool support, through a framework called surreal. The methodology starts from a misuse case specification enriched with UML profile annotations and obtains, as a byproduct, a survivability assessment model (SAM). Using predefined queries the survivability properties are proved in the SAM. A total of fourteen properties have been formulated and also implemented in surreal, which encompasses tools to model the security specification, to create the SAM and to prove the properties. Finally, the paper validates the methodology and the framework using a cyber–physical system (CPS) case study, in the automotive field.},
langid = {english},
file = {/home/danesabo/Zotero/storage/QST35ZQT/Bernardi et al. - 2021 - Security modelling and formal verification of surv.pdf}
}
@article{bertotCoqHurry2016,
title = {Coq in a {{Hurry}}},
author = {Bertot, Yves},
date = {2016-06-29},
pages = {49},
url = {https://cel.hal.science/inria-00001173},
urldate = {2024-01-22},
abstract = {These notes provide a quick introduction to the Coq system and show how it can be used to define logical concepts and functions and reason about them. It is designed as a tutorial, so that readers can quickly start their own experiments, learning only a few of the capabilities of the system. A much more comprehensive study is provided in [1], which also provides an extensive collection of exercises to train on.},
langid = {english},
file = {/home/danesabo/Zotero/storage/IU2M3ZIJ/Bertot - 2016 - Coq in a Hurry.pdf}
}
@article{berzComputationApplicationTaylor1998,
title = {Computation and {{Application}} of {{Taylor Polynomials}} with {{Interval Remainder Bounds}}},
author = {Berz, Martin and Hoffstätter, Georg},
date = {1998-02-01},
journaltitle = {Reliable Computing},
shortjournal = {Reliable Computing},
volume = {4},
number = {1},
pages = {83--97},
issn = {1573-1340},
doi = {10.1023/A:1009958918582},
url = {https://doi.org/10.1023/A:1009958918582},
urldate = {2023-10-30},
abstract = {The expansion of complicated functions of many variables in Taylor polynomials is an important problem for many applications, and in practice can be performed rather conveniently (even to high orders) using polynomial algebras. An important application of these methods is the field of beam physics, where often expansions in about six variables to orders between five and ten are used.},
langid = {english},
file = {/home/danesabo/Zotero/storage/SUMEMWNH/Berz and Hoffstätter - 1998 - Computation and Application of Taylor Polynomials .pdf}
}
@article{berztissFormalVerificationPrograms,
title = {Formal {{Verification}} of {{Programs}}},
author = {Berztiss, Alfs T and Ardis, Mark A},
langid = {english},
file = {/home/danesabo/Zotero/storage/YZRTPDGC/Berztiss and Ardis - Formal Verification of Programs.pdf}
}
@article{berzVerifiedIntegrationODEs1998,
title = {Verified {{Integration}} of {{ODEs}} and {{Flows Using Differential Algebraic Methods}} on {{High-Order Taylor Models}}},
author = {Berz, Martin and Makino, Kyoko},
date = {1998-11-01},
journaltitle = {Reliable Computing},
shortjournal = {Reliable Computing},
volume = {4},
number = {4},
pages = {361--369},
issn = {1573-1340},
doi = {10.1023/A:1024467732637},
url = {https://doi.org/10.1023/A:1024467732637},
urldate = {2023-10-30},
abstract = {A method is developed that allows the verified integration of ODEs based on local modeling with high-order Taylor polynomials with remainder bound. The use of such Taylor models of order n allows convenient automated verified inclusion of functional dependencies with an accuracy that scales with the (n + 1)-st order of the domain and substantially reduces blow-up.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DTAN4RVW/Berz and Makino - 1998 - Verified Integration of ODEs and Flows Using Diffe.pdf}
}
@article{besterfield-sacreDefiningOutcomesFramework2000,
title = {Defining the Outcomes: A Framework for {{EC-2000}}},
shorttitle = {Defining the Outcomes},
author = {Besterfield-Sacre, M. and Shuman, L.J. and Wolfe, H. and Atman, C.J. and McGourty, J. and Miller, R.L. and Olds, B.M. and Rogers, G.M.},
date = {2000-05},
journaltitle = {IEEE Transactions on Education},
volume = {43},
number = {2},
pages = {100--110},
issn = {1557-9638},
doi = {10.1109/13.848060},
url = {https://ieeexplore.ieee.org/abstract/document/848060?casa_token=Jpsiv1cWF_wAAAAA:3RukMC2EM9ZIIUhvq6gPSxj8Pp5mDlbUh-pZRVxsEjWgqeain-pbOt7RRo86x2io8DK-yflg8g},
urldate = {2024-01-30},
abstract = {The "new" Accreditation Board for Engineering and Technology criteria, EC-2000, has caused engineering educators to focus on 11 intentionally undefined outcomes as a necessary step in the accreditation process. As part of a large study sponsored by the National Science Foundation, a framework, based on Bloom's taxonomy, has been developed for better specifying these outcomes. Using this framework, each outcome has been expanded into a set of attributes that can then be used by engineering faculty in adapting the outcomes to their own program. Also discussed are two ways in which this characterization of outcomes can be used as part of an assessment and feedback process. These outcome definitions are considered to be in a dynamic state; i.e., they will continue to be modified and updated as more is learned about their specificity and use.},
eventtitle = {{{IEEE Transactions}} on {{Education}}},
file = {/home/danesabo/Zotero/storage/CUT9LFQ5/Besterfield-Sacre et al. - 2000 - Defining the outcomes a framework for EC-2000.pdf;/home/danesabo/Zotero/storage/834CICMU/848060.html}
}
@inproceedings{bhurkeMethodsFormalAnalysis2021,
title = {Methods of {{Formal Analysis}} for {{ICS Protocols}} and {{HART}} - {{IP CPN}} Modelling},
booktitle = {2021 {{Asian Conference}} on {{Innovation}} in {{Technology}} ({{ASIANCON}})},
author = {Bhurke, Anish Uday and Kazi, Faruk},
date = {2021-08-27},
pages = {1--7},
publisher = {IEEE},
location = {PUNE, India},
doi = {10.1109/ASIANCON51346.2021.9544603},
url = {https://ieeexplore.ieee.org/document/9544603/},
urldate = {2023-10-10},
abstract = {Industrial Control System (ICS) used in critical infrastructure like energy sector, oil and natural gas, chemical processing, waste water treatment etc. are of great importance since it serves to a larger population and hence termed as National Critical Infrastructure (NCI). Security of such infrastructures is essential from physical as well as from cyber point of view. Traditional approach for the security was only physical consisting of creating SOP, access control, physical verification, etc. But due past cyber disturbing events like Stuxnet, Blackenergy-3, Turkey pipeline explosion, Havex, New York dam attack, etc. it is realized that the network security of the connected devices within the infrastructure is also of same importance. Various researches in this field have helped to make the NCI immune to a certain extent as well as resilient against cyber-attacks. One such approach is using Formal Analysis for performing security analysis of the communication protocols used in ICS domain. In this paper a compressive review of all available methods for formal analysis along with CPN modelling is done for analysis of valid as well as invalid states of HART protocol. The Modelling shows various states that the protocol can take during one transaction of communication. Further this analysis can be extended for other Fieldbus protocols for security analysis.},
eventtitle = {2021 {{Asian Conference}} on {{Innovation}} in {{Technology}} ({{ASIANCON}})},
isbn = {978-1-72818-402-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/YUG8WQ85/Bhurke and Kazi - 2021 - Methods of Formal Analysis for ICS Protocols and H.pdf}
}
@incollection{biereBoundedModelChecking2003,
title = {Bounded {{Model Checking}}},
booktitle = {Advances in {{Computers}}},
author = {Biere, Armin and Cimatti, Alessandro and Clarke, Edmund M. and Strichman, Ofer and Zhu, Yunshan},
date = {2003},
volume = {58},
pages = {117--148},
publisher = {Elsevier},
doi = {10.1016/S0065-2458(03)58003-2},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0065245803580032},
urldate = {2023-11-02},
abstract = {Symbolic model checking with Binary Decision Diagrams (BDDs) has been successfully used in the last decade for formally verifying finite state systems such as sequential circuits and protocols. Since its introduction in the beginning of the 90’s, it has been integrated in the quality assurance process of several major hardware companies. The main bottleneck of this method is that BDDs may grow exponentially, and hence the amount of available memory restricts the size of circuits that can be verified efficiently. In this article we survey a technique called Bounded Model Checking (BMC), which uses a propositional SAT solver rather than BDD manipulation techniques. Since its introduction in 1999, BMC has been well received by the industry. It can find many logical errors in complex systems that can not be handled by competing techniques, and is therefore widely perceived as a complementary technique to BDD-based model checking. This observation is supported by several independent comparisons that have been published in the last few years.},
isbn = {978-0-12-012158-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/YYVN39RT/Biere et al. - 2003 - Bounded Model Checking.pdf}
}
@book{bifflSecurityQualityCyberPhysical2019,
title = {Security and {{Quality}} in {{Cyber-Physical Systems Engineering}}: {{With Forewords}} by {{Robert M}}. {{Lee}} and {{Tom Gilb}}},
shorttitle = {Security and {{Quality}} in {{Cyber-Physical Systems Engineering}}},
editor = {Biffl, Stefan and Eckhart, Matthias and Lüder, Arndt and Weippl, Edgar},
date = {2019},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-25312-7},
url = {http://link.springer.com/10.1007/978-3-030-25312-7},
urldate = {2023-10-11},
isbn = {978-3-030-25311-0 978-3-030-25312-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/WRY7XD7X/Biffl et al. - 2019 - Security and Quality in Cyber-Physical Systems Eng.pdf}
}
@article{biggsEnhancingTeachingConstructive1996,
title = {Enhancing Teaching through Constructive Alignment},
author = {Biggs, John},
date = {1996-10-01},
journaltitle = {Higher Education},
shortjournal = {High Educ},
volume = {32},
number = {3},
pages = {347--364},
issn = {1573-174X},
doi = {10.1007/BF00138871},
url = {https://doi.org/10.1007/BF00138871},
urldate = {2024-01-26},
abstract = {Two lines of thinking are becoming increasingly important in higher educational practice. The first derives from constructivist learning theory, and the second from the instructional design literature. Constructivism comprises a family of theories but all have in common the centrality of the learner's activities in creating meaning. These and related ideas have important implications for teaching and assessment. Instructional designers for their part have emphasised alignment between the objectives of a course or unit and the targets for assessing student performance. “Constructive alignment” represents a marriage of the two thrusts, constructivism being used as a framework to guide decision-making at all stages in instructional design: in deriving curriculum objectives in terms of performances that represent a suitably high cognitive level, in deciding teaching/learning activities judged to elicit those performances, and to assess and summatively report student performance. The “performances of understanding” nominated in the objectives are thus used to systematically align the teaching methods and the assessment. The process is illustrated with reference to a professional development unit in educational psychology for teachers, but the model may be generalized to most units or programs in higher education.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DIDSY7TD/Biggs - 1996 - Enhancing teaching through constructive alignment.pdf}
}
@article{blanchiniModelFreePlantTuning2017,
title = {Model-{{Free Plant Tuning}}},
author = {Blanchini, Franco and Fenu, Gianfranco and Giordano, Giulia and Pellegrino, Felice Andrea},
date = {2017-06},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {62},
number = {6},
pages = {2623--2634},
issn = {1558-2523},
doi = {10.1109/TAC.2016.2616025},
url = {https://ieeexplore.ieee.org/abstract/document/7586127},
urldate = {2024-07-10},
abstract = {Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, this paper considers the problem of tuning (i.e., driving to a desired value) the output, by suitably choosing the input. It is shown that, if the polytope is robustly nonsingular (or has full rank, in the nonsquare case), then a suitable tuning scheme drives the output to the desired point. The proof exploits a Lyapunov-like function and applies a well-known game-theoretic result, concerning the existence of a saddle point for a min-max zero-sum game. When the plant output is represented in an implicit form, it is shown that the same result can be obtained, resorting to a different Lyapunov-like function. The case in which proper input or output constraints must be enforced during the transient is considered as well. Some application examples are proposed to show the effectiveness of the approach.},
keywords = {Games,Generators,Jacobian matrices,Lyapunov methods,min-max theorem robust control,Robustness,Steady-state,Transient analysis,Tuning,uncertain systems},
file = {/home/danesabo/Zotero/storage/EIWCR5N3/Blanchini et al. - 2017 - Model-Free Plant Tuning.pdf;/home/danesabo/Zotero/storage/M3UQ3IZC/Blanchini et al. - 2017 - Model-Free Plant Tuning.html}
}
@article{blanchiniModelFreePlantTuning2017a,
title = {Model-{{Free Plant Tuning}}},
author = {Blanchini, Franco and Fenu, Gianfranco and Giordano, Giulia and Pellegrino, Felice Andrea},
date = {2017-06},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {62},
number = {6},
pages = {2623--2634},
issn = {1558-2523},
doi = {10.1109/TAC.2016.2616025},
url = {https://ieeexplore.ieee.org/abstract/document/7586127},
urldate = {2024-07-10},
abstract = {Given a static plant described by a differentiable input-output function, which is completely unknown, but whose Jacobian takes values in a known polytope in the matrix space, this paper considers the problem of tuning (i.e., driving to a desired value) the output, by suitably choosing the input. It is shown that, if the polytope is robustly nonsingular (or has full rank, in the nonsquare case), then a suitable tuning scheme drives the output to the desired point. The proof exploits a Lyapunov-like function and applies a well-known game-theoretic result, concerning the existence of a saddle point for a min-max zero-sum game. When the plant output is represented in an implicit form, it is shown that the same result can be obtained, resorting to a different Lyapunov-like function. The case in which proper input or output constraints must be enforced during the transient is considered as well. Some application examples are proposed to show the effectiveness of the approach.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
keywords = {Games,Generators,Jacobian matrices,Lyapunov methods,min-max theorem robust control,Robustness,Steady-state,Transient analysis,Tuning,uncertain systems},
file = {/home/danesabo/Zotero/storage/L3QSB6YH/Blanchini et al. - 2017 - Model-Free Plant Tuning.pdf}
}
@inproceedings{blumreiterSelfExplainableCyberPhysicalSystems2019,
title = {Towards {{Self-Explainable Cyber-Physical Systems}}},
booktitle = {2019 {{ACM}}/{{IEEE}} 22nd {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems Companion}} ({{MODELS-C}})},
author = {Blumreiter, Mathias and Greenyer, Joel and Chiyah Garcia, Francisco Javier and Klos, Verena and Schwammberger, Maike and Sommer, Christoph and Vogelsang, Andreas and Wortmann, Andreas},
date = {2019-09},
pages = {543--548},
publisher = {IEEE},
location = {Munich, Germany},
doi = {10.1109/MODELS-C.2019.00084},
url = {https://ieeexplore.ieee.org/document/8904796/},
urldate = {2023-10-11},
abstract = {With the increasing complexity of Cyber-Physical Systems, their behavior and decisions become increasingly difficult to understand and comprehend for users and other stakeholders. Our vision is to build self-explainable systems that can, at run-time, answer questions about the system’s past, current, and future behavior. As hitherto no design methodology or reference framework exists for building such systems, we propose the Monitor, Analyze, Build, Explain (MAB-EX) framework for building self-explainable systems that leverage requirements- and explainability models at run-time. The basic idea of MAB-EX is to first Monitor and Analyze a certain behavior of a system, then Build an explanation from explanation models and convey this EXplanation in a suitable way to a stakeholder. We also take into account that new explanations can be learned, by updating the explanation models, should new and yet unexplainable behavior be detected by the system.},
eventtitle = {2019 {{ACM}}/{{IEEE}} 22nd {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems Companion}} ({{MODELS-C}})},
isbn = {978-1-72815-125-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/RN7QFCDR/Blumreiter et al. - 2019 - Towards Self-Explainable Cyber-Physical Systems.pdf}
}
@book{boldoComputerArithmeticFormal2017,
title = {Computer {{Arithmetic}} and {{Formal Proofs}}: {{Verifying Floating-point Algorithms}} with the {{Coq System}}},
author = {Boldo, Sylvie and Melquiond, Guillaume},
date = {2017},
publisher = {ITSE Press, Ltd}
}
@book{boldoComputerArithmeticFormal2017a,
title = {Computer Arithmetic and Formal Proofs: Verifying Floating-Point Algorithms with the {{Coq}} System},
author = {Boldo, Sylvie and Melquiond, Guillaume},
date = {2017},
publisher = {Elsevier},
isbn = {0-08-101170-9}
}
@inproceedings{boldoFlocqUnifiedLibrary2011,
title = {Flocq: {{A Unified Library}} for {{Proving Floating-Point Algorithms}} in {{Coq}}},
shorttitle = {Flocq},
booktitle = {2011 {{IEEE}} 20th {{Symposium}} on {{Computer Arithmetic}}},
author = {Boldo, Sylvie and Melquiond, Guillaume},
date = {2011-07},
pages = {243--252},
publisher = {IEEE},
location = {Tuebingen, Germany},
doi = {10.1109/ARITH.2011.40},
url = {http://ieeexplore.ieee.org/document/5992132/},
urldate = {2024-01-16},
abstract = {Several formalizations of floating-point arithmetic have been designed for the Coq system, a generic proof assistant. Their different purposes have favored some specific applications: program verification, high-level properties, automation. Based on our experience using and/or developing these libraries, we have built a new system that is meant to encompass the other ones in a unified framework. It offers a multi-radix and multi-precision formalization for various floating- and fixed-point formats. This fresh setting has been the occasion for reevaluating known properties and generalizing them. This paper presents design decisions and examples of theorems from the Flocq system: a library easy to use, suitable for automation yet high-level and generic.},
eventtitle = {2011 {{IEEE}} 20th {{Symposium}} on {{Computer Arithmetic}} ({{ARITH}})},
isbn = {978-1-4244-9457-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZC4NLBJP/Boldo and Melquiond - 2011 - Flocq A Unified Library for Proving Floating-Poin.pdf}
}
@article{boldoWaveEquationNumerical2013,
title = {Wave {{Equation Numerical Resolution}}: {{A Comprehensive Mechanized Proof}} of a {{C Program}}},
shorttitle = {Wave {{Equation Numerical Resolution}}},
author = {Boldo, Sylvie and Clément, François and Filliâtre, Jean-Christophe and Mayero, Micaela and Melquiond, Guillaume and Weis, Pierre},
date = {2013-04-01},
journaltitle = {Journal of Automated Reasoning},
shortjournal = {J Autom Reasoning},
volume = {50},
number = {4},
pages = {423--456},
issn = {1573-0670},
doi = {10.1007/s10817-012-9255-4},
url = {https://doi.org/10.1007/s10817-012-9255-4},
urldate = {2024-03-19},
abstract = {We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and floating-point computations lead to round-off errors. We annotate this C program to specify both method error and round-off error. We use Frama-C to generate theorems that guarantee the soundness of the code. We discharge these theorems using SMT solvers, Gappa, and Coq. This involves a large Coq development to prove the adequacy of the C program to the numerical scheme and to bound errors. To our knowledge, this is the first time such a numerical analysis program is fully machine-checked.},
langid = {english},
file = {/home/danesabo/Zotero/storage/R8HBQT6A/Boldo et al. - 2013 - Wave Equation Numerical Resolution A Comprehensiv.pdf}
}
@article{boldoWaveEquationNumerical2013a,
title = {Wave {{Equation Numerical Resolution}}: {{A Comprehensive Mechanized Proof}} of a {{C Program}}},
shorttitle = {Wave {{Equation Numerical Resolution}}},
author = {Boldo, Sylvie and Clément, François and Filliâtre, Jean-Christophe and Mayero, Micaela and Melquiond, Guillaume and Weis, Pierre},
date = {2013-04-01},
journaltitle = {Journal of Automated Reasoning},
shortjournal = {J Autom Reasoning},
volume = {50},
number = {4},
pages = {423--456},
issn = {1573-0670},
doi = {10.1007/s10817-012-9255-4},
url = {https://doi.org/10.1007/s10817-012-9255-4},
urldate = {2024-03-19},
abstract = {We formally prove correct a C program that implements a numerical scheme for the resolution of the one-dimensional acoustic wave equation. Such an implementation introduces errors at several levels: the numerical scheme introduces method errors, and floating-point computations lead to round-off errors. We annotate this C program to specify both method error and round-off error. We use Frama-C to generate theorems that guarantee the soundness of the code. We discharge these theorems using SMT solvers, Gappa, and Coq. This involves a large Coq development to prove the adequacy of the C program to the numerical scheme and to bound errors. To our knowledge, this is the first time such a numerical analysis program is fully machine-checked.},
langid = {english},
file = {/home/danesabo/Zotero/storage/NLHQNXSN/Boldo et al. - 2013 - Wave Equation Numerical Resolution A Comprehensiv.pdf}
}
@article{bourbouhCoCoSimCodeGeneration,
title = {{{CoCoSim}}, a Code Generation Framework for Control/Command Applications {{An}} Overview of {{CoCoSim}} for Multi-Periodic Discrete {{Simulink}} Models},
author = {Bourbouh, Hamza and Garoche, Pierre-Loïc and Loquen, Thomas and Noulard, Éric and Pagetti, Claire},
abstract = {We present CoCoSim, a framework to support the design, code generation and analysis of discrete dataflow model expressed in Simulink. In this work, we specifically focus on the analysis and code generation of multi-periodic systems. For that CoCoSim provides two complementary approaches: the first amounts to encode the multiperiodic semantics in a pure-synchronous one – à la Lustre–, enabling the use of model checker for verifying properties. The second provides a faithful code generation into multiple communicating (mono)synchronous components – à la Prelude–that can be then simulated or embedded in the final platform with any real-time scheduler. These approaches have been experimented in various settings.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JDXYWMDE/Bourbouh et al. - CoCoSim, a code generation framework for controlc.pdf}
}
@inproceedings{brajeAdversarySafetyConstruction2022,
title = {Adversary Safety by Construction in a Language of Cryptographic Protocols},
booktitle = {2022 {{IEEE}} 35th {{Computer Security Foundations Symposium}} ({{CSF}})},
author = {Braje, Timothy M. and Lee, Alice R. and Wagner, Andrew and Kaiser, Benjamin and Park, Daniel and Kalke, Martine and Cunningham, Robert K. and Chlipala, Adam},
date = {2022},
pages = {412--427},
publisher = {IEEE},
isbn = {1-66548-417-9},
file = {/home/danesabo/Zotero/storage/29RD9H85/Braje et al. - Adversary Safety by Construction in a Language of .pdf}
}
@article{brandtnerEntropicRiskMeasures2018,
title = {Entropic Risk Measures and Their Comparative Statics in Portfolio Selection: {{Coherence}} vs. Convexity},
shorttitle = {Entropic Risk Measures and Their Comparative Statics in Portfolio Selection},
author = {Brandtner, Mario and Kürsten, Wolfgang and Rischau, Robert},
date = {2018-01},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {264},
number = {2},
pages = {707--716},
issn = {03772217},
doi = {10.1016/j.ejor.2017.07.007},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221717306343},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/5TBV5DU9/Brandtner et al. - 2018 - Entropic risk measures and their comparative stati.pdf}
}
@inproceedings{branickyAnalyzingContinuousSwitching1994,
title = {Analyzing Continuous Switching Systems: Theory and Examples},
shorttitle = {Analyzing Continuous Switching Systems},
booktitle = {Proceedings of 1994 {{American Control Conference}} - {{ACC}} '94},
author = {Branicky, M.S.},
date = {1994-06},
volume = {3},
pages = {3110-3114 vol.3},
doi = {10.1109/ACC.1994.735143},
url = {https://ieeexplore.ieee.org/document/735143},
urldate = {2024-01-16},
abstract = {This paper details work on ordinary differential equations that continuously switch among regimes of operation. In the first part, we develop some tools for analyzing such systems. We prove an extension of Bendixson's theorem to the case of Lipschitz continuous vector fields. We also prove a lemma dealing with the robustness of differential equations with respect to perturbations that preserve a linear part, which we call the linear robustness lemma (LRL). We then give some simple propositions that allow us to use this lemma in studying certain singular perturbation problems. In the second part, the attention focuses on example systems and their analysis. We use the tools from the first part and develop some general insights. The example systems arise from a realistic aircraft control problem. The extension of Bendixson's theorem and the LRL have applicability beyond the systems discussed in this paper.},
eventtitle = {Proceedings of 1994 {{American Control Conference}} - {{ACC}} '94},
file = {/home/danesabo/Zotero/storage/RKHNBI5U/Branicky - 1994 - Analyzing continuous switching systems theory and.pdf;/home/danesabo/Zotero/storage/7FKIYSN8/735143.html}
}
@incollection{branickyIntroductionHybridSystems2005,
title = {Introduction to {{Hybrid Systems}}},
booktitle = {Handbook of {{Networked}} and {{Embedded Control Systems}}},
author = {Branicky, Michael S.},
editor = {Hristu-Varsakelis, Dimitrios and Levine, William S.},
date = {2005},
pages = {91--116},
publisher = {Birkhäuser Boston},
location = {Boston, MA},
doi = {10.1007/0-8176-4404-0_5},
url = {http://link.springer.com/10.1007/0-8176-4404-0_5},
urldate = {2024-01-16},
abstract = {Hybrid systems arise when the continuous and the discrete meet. Combine continuous and discrete inputs, outputs, states, or dynamics, and you have a hybrid system. Particularly, hybrid systems arise from the use of finite-state logic to govern continuous physical processes (as in embedded control systems) or from topological and network constraints interacting with continuous control (as in networked control systems). This chapter provides an introduction to hybrid systems, building them up first from the completely continuous side and then from the completely discrete side. It should be accessible to control theorists and computer scientists alike.},
isbn = {978-0-8176-3239-7 978-0-8176-4404-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/ECDHT5FK/Branicky - 2005 - Introduction to Hybrid Systems.pdf}
}
@article{branickyMultipleLyapunovFunctions1998,
title = {Multiple {{Lyapunov}} Functions and Other Analysis Tools for Switched and Hybrid Systems},
author = {Branicky, M.S.},
date = {1998-04},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {43},
number = {4},
pages = {475--482},
issn = {1558-2523},
doi = {10.1109/9.664150},
url = {https://ieeexplore.ieee.org/document/664150},
urldate = {2024-01-16},
abstract = {We introduce some analysis tools for switched and hybrid systems. We first present work on stability analysis. We introduce multiple Lyapunov functions as a tool for analyzing Lyapunov stability and use iterated function systems theory as a tool for Lagrange stability. We also discuss the case where the switched systems are indexed by an arbitrary compact set. Finally, we extend Bendixson's theorem to the case of Lipschitz continuous vector fields, allowing limit cycle analysis of a class of "continuous switched" systems.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
file = {/home/danesabo/Zotero/storage/RU3Y8BYT/Branicky - 1998 - Multiple Lyapunov functions and other analysis too.pdf;/home/danesabo/Zotero/storage/DFU9PIWV/664150.html}
}
@inproceedings{branickySolvingHybridControl2000,
title = {Solving Hybrid Control Problems: Level Sets and Behavioral Programming},
shorttitle = {Solving Hybrid Control Problems},
booktitle = {Proceedings of the 2000 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{00CH36334}})},
author = {Branicky, M.S. and Zhang, G.},
date = {2000-06},
volume = {2},
pages = {1175-1180 vol.2},
issn = {0743-1619},
doi = {10.1109/ACC.2000.876685},
url = {https://ieeexplore.ieee.org/document/876685},
urldate = {2024-01-16},
abstract = {Hybrid systems include both continuous dynamics and discrete events. We represent the continuous dynamics by differential equations and represent the events by a discrete transition model. We describe computational approaches to solving optimal hybrid control problems using two techniques: a fast marching level set method and behavioral programming. We review our extension of the fast marching level set method to the hybrid setting, including its formalization, a constructive proof of its correctness, approximation errors to the analog solution, and upper- and lower-bounding approximate solutions. Our work also explores an idea known as behavioral programming. We review the theoretical underpinnings and then perform some experiments using this technique to solve a specific problem in robotic assembly, the peg-in-hole problem. We demonstrate the abstraction of primitive actions into behaviors, try out several strategies for combining behaviors, and compare their optimality and computational effort vis-a-vis primitive actions.},
eventtitle = {Proceedings of the 2000 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{00CH36334}})},
file = {/home/danesabo/Zotero/storage/9SYCJ9SN/Branicky and Zhang - 2000 - Solving hybrid control problems level sets and be.pdf;/home/danesabo/Zotero/storage/IUU6XNNQ/876685.html}
}
@inproceedings{branickyStabilityHybridSystems1997,
title = {Stability of Hybrid Systems: State of the Art},
shorttitle = {Stability of Hybrid Systems},
booktitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Branicky, M.S.},
date = {1997},
volume = {1},
pages = {120--125},
publisher = {IEEE},
location = {San Diego, CA, USA},
doi = {10.1109/CDC.1997.650600},
url = {http://ieeexplore.ieee.org/document/650600/},
urldate = {2024-03-04},
eventtitle = {36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
isbn = {978-0-7803-4187-6}
}
@inproceedings{branickyStabilityHybridSystems1997a,
title = {Stability of Hybrid Systems: State of the Art},
shorttitle = {Stability of Hybrid Systems},
booktitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Branicky, M.S.},
date = {1997-12},
volume = {1},
pages = {120-125 vol.1},
issn = {0191-2216},
doi = {10.1109/CDC.1997.650600},
url = {https://ieeexplore.ieee.org/document/650600},
urldate = {2024-01-16},
abstract = {This paper collects work on the stability analysis of hybrid systems. The hybrid systems considered are those that combine continuous dynamics (represented by differential or difference equations) with finite dynamics, usually thought of as being a finite automaton. We review multiple Lyapunov functions as a tool for analyzing Lyapunov stability of general hybrid systems. Background results, the author's introductory work, and subsequent extensions are covered. Specializing to hybrid systems with linear dynamics in each constituent mode and linear jump operators, we review some key theorems of Barabanov-Staroshilov (1988), and give corollaries encompassing several recently-derived "stability by first approximation" theorems in the literature. We also comment on the use of computational tests for stability of hybrid systems, and the general complexity. The result is a tutorial on the state of the art in theory and computation of hybrid systems stability.},
eventtitle = {Proceedings of the 36th {{IEEE Conference}} on {{Decision}} and {{Control}}},
file = {/home/danesabo/Zotero/storage/UUWDHV3I/Branicky - 1997 - Stability of hybrid systems state of the art.pdf;/home/danesabo/Zotero/storage/HWR8AGZP/650600.html}
}
@inproceedings{branickyStabilitySwitchedHybrid1994,
title = {Stability of Switched and Hybrid Systems},
booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Branicky, M.S.},
date = {1994-12},
volume = {4},
pages = {3498-3503 vol.4},
doi = {10.1109/CDC.1994.411688},
url = {https://ieeexplore.ieee.org/document/411688},
urldate = {2024-01-16},
abstract = {This paper outlines some preliminary work on the stability analysis of switched and hybrid systems. The hybrid systems considered are those that combine continuous dynamics, represented by differential or difference equations, with finite dynamics usually thought of as being a finite automaton. Here, we concentrate on the continuous dynamics and model the finite dynamics as switching among finitely many continuous systems. We introduce multiple Lyapunov functions as a tool for analyzing Lyapunov stability of such "switched systems". We use iterated function systems theory as a tool for Lagrange stability. We also discuss the case where the switched systems are indexed by an arbitrary compact set.{$<>$}},
eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
file = {/home/danesabo/Zotero/storage/8P3E82NG/Branicky - 1994 - Stability of switched and hybrid systems.pdf}
}
@thesis{branickyStudiesHybridSystems1995,
title = {Studies in {{Hybrid Systems}}: {{Modeling}}, {{Analysis}}, and {{Control}}},
author = {Branicky, Michael S.},
date = {1995},
institution = {MIT},
file = {/home/danesabo/Zotero/storage/2DQB9B7W/33226976-MIT.pdf}
}
@inproceedings{branickyTopologyHybridSystems1993,
title = {Topology of Hybrid Systems},
booktitle = {Proceedings of 32nd {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Branicky, M.S.},
date = {1993-12},
pages = {2309-2314 vol.3},
doi = {10.1109/CDC.1993.325609},
url = {https://ieeexplore.ieee.org/document/325609},
urldate = {2024-01-16},
abstract = {We discuss topological issues that arise when differential equations and finite automata interact (hybrid systems). In particular, we examine topologies for achieving continuity of maps from a set of measurements of continuous dynamics to a finite set of input symbols and from a finite set of output symbols into the control space for those continuous dynamics. Finding some anomalies in completing this loop, we discuss a new view of hybrid systems that may broach them and is more in line with traditional control systems. In fact, the most widely used fuzzy control system is related to this new view and does not possess these anomalies. Indeed, we show that fuzzy control leads to continuous maps (from measurements to controls) and that all such continuous maps may be implemented via fuzzy control.{$<>$}},
eventtitle = {Proceedings of 32nd {{IEEE Conference}} on {{Decision}} and {{Control}}},
file = {/home/danesabo/Zotero/storage/SM3N5268/Branicky - 1993 - Topology of hybrid systems.pdf;/home/danesabo/Zotero/storage/XXTGKMN7/325609.html}
}
@inproceedings{branickyUnifiedFrameworkHybrid1994,
title = {A Unified Framework for Hybrid Control},
booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Branicky, M.S. and Borkar, V.S. and Mitter, S.K.},
date = {1994-12},
volume = {4},
pages = {4228-4234 vol.4},
doi = {10.1109/CDC.1994.411615},
url = {https://ieeexplore.ieee.org/document/411615},
urldate = {2024-01-16},
abstract = {We propose a very general framework for hybrid control problems that encompasses several types of hybrid phenomena considered in the literature. A specific control problem is studied in this framework, leading to an existence result for optimal controls. The "value function" associated with this problem is expected to satisfy a set of "generalized quasi-variational inequalities".{$<>$}},
eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
file = {/home/danesabo/Zotero/storage/66RJAFNB/Branicky et al. - 1994 - A unified framework for hybrid control.pdf}
}
@article{branickyUnifiedFrameworkHybrid1998,
title = {A Unified Framework for Hybrid Control: Model and Optimal Control Theory},
shorttitle = {A Unified Framework for Hybrid Control},
author = {Branicky, M.S. and Borkar, V.S. and Mitter, S.K.},
date = {1998-01},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {43},
number = {1},
pages = {31--45},
issn = {1558-2523},
doi = {10.1109/9.654885},
url = {https://ieeexplore.ieee.org/document/654885},
urldate = {2024-01-16},
abstract = {We propose a very general framework that systematizes the notion of a hybrid system, combining differential equations and automata, governed by a hybrid controller that issues continuous-variable commands and makes logical decisions. We first identify the phenomena that arise in real-world hybrid systems. Then, we introduce a mathematical model of hybrid systems as interacting collections of dynamical systems, evolving on continuous-variable state spaces and subject to continuous controls and discrete transitions. The model captures the identified phenomena, subsumes previous models, yet retains enough structure to pose and solve meaningful control problems. We develop a theory for synthesizing hybrid controllers for hybrid plants in all optimal control framework. In particular, we demonstrate the existence of optimal (relaxed) and near-optimal (precise) controls and derive "generalized quasi-variational inequalities" that the associated value function satisfies. We summarize algorithms for solving these inequalities based on a generalized Bellman equation, impulse control, and linear programming.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
file = {/home/danesabo/Zotero/storage/JV94PIIA/Branicky et al. - 1998 - A unified framework for hybrid control model and .pdf;/home/danesabo/Zotero/storage/WEDHD2UZ/654885.html}
}
@misc{breenLevelSetMethods,
title = {Level {{Set Methods}} for {{Visualization}}},
author = {Breen, David and Museth, Ken},
file = {/home/danesabo/Zotero/storage/BH9FC2S4/Viz06_LS_Course_Notes.pdf}
}
@article{brosinskyFortunateDecisionThat2024,
title = {A {{Fortunate Decision That You Can Trust}}: {{Digital Twins}} as {{Enablers}} for the {{Next Generation}} of {{Energy Management Systems}} and {{Sophisticated Operator Assistance Systems}}},
shorttitle = {A {{Fortunate Decision That You Can Trust}}},
author = {Brosinsky, Christoph and Naglič, Matija and Lehnhoff, Sebastian and Krebs, Rainer and Westermann, Dirk},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {24--34},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3330120},
url = {https://ieeexplore.ieee.org/document/10398577/},
urldate = {2024-03-13},
abstract = {Power system operation is gaining complexity due to the changes imposed by the energy transition. Especially, the increased share of intermittent and decentralized renewable generation units in the energy mix, an increased uncertainty regarding the supply of energy, and the predominantly market-driven cross-region and cross-border transport of electricity impose new challenges on the operation of power systems in Europe. In particular, power system operators must facilitate higher utilization of the grid capacity and coordinate more with neighboring transmission system operators (TSOs) and distribution system operators (DSOs). To deal with these new challenges, there is a pressing need to improve the observability and controllability of key system parameters to safeguard the reliability of power systems. Furthermore, the aforementioned developments and challenges go hand in hand with the need to improve the system resilience from the cybersecurity and system stability points of view. In the future, these challenges cannot be met without innovation towards intelligent decision support systems and assistant functions, which allow a look ahead combined with fast response and proactive actions. Here, the rather novel digital twin (DT) concept in combination with data-driven (i.e., machine learning) applications can be purposefully applied.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/6VNDBUGU/Brosinsky et al. - 2024 - A Fortunate Decision That You Can Trust Digital T.pdf;/home/danesabo/Zotero/storage/GB3C5QN3/10398577.html}
}
@online{BuildingMathematicalLibrary2020,
title = {Building the {{Mathematical Library}} of the {{Future}}},
date = {2020-10-01T16:05+00:00},
url = {https://www.quantamagazine.org/building-the-mathematical-library-of-the-future-20201001/},
urldate = {2024-01-28},
abstract = {A small community of mathematicians is using a software program called Lean to build a new digital repository. They hope it represents the future of their field.}
}
@article{bullockHardwareintheloopSimulation2004,
title = {Hardware-in-the-Loop Simulation},
author = {Bullock, Darcy and Johnson, Brian and Wells, Richard B. and Kyte, Michael and Li, Zhen},
date = {2004-02-01},
journaltitle = {Transportation Research Part C: Emerging Technologies},
shortjournal = {Transportation Research Part C: Emerging Technologies},
volume = {12},
number = {1},
pages = {73--89},
issn = {0968-090X},
doi = {10.1016/j.trc.2002.10.002},
url = {https://www.sciencedirect.com/science/article/pii/S0968090X03000792},
urldate = {2024-08-08},
abstract = {The current generation of macroscopic and microscopic simulation packages do not have control algorithms that incorporate many of the advanced features now available in commercial traffic control hardware. Consequently, there is a need to develop cost effective procedures for evaluating state of the practice traffic signal control equipment so that informed deployment and design decisions can be made. These same procedures can also be used by researchers to develop new algorithms for applications such as transit priority or adaptive control. In order to achieve that objective, this paper presents the motivation for using hardware-in-the-loop simulation procedures. Hardware-in-the-loop simulation presents a new set of challenges for traffic engineering model developers as the “correctness” of a real-time model not only depends upon the numerical computation, but the timeliness with which the simulation model interacts with external control equipment. This paper reviews the state of practice, summarizes the fundamental technologies necessary for implementing such a system, and uses a simple statistical test for assessing the real-time errors introduced into a simulation model.},
keywords = {Controller,Equipment,Hardware,Signal,Simulation,Traffic},
file = {/home/danesabo/Zotero/storage/L3678LNB/S0968090X03000792.html}
}
@incollection{busoniuApproximateDynamicProgramming2010,
title = {Approximate {{Dynamic Programming}} and {{Reinforcement Learning}}},
booktitle = {Interactive {{Collaborative Information Systems}}},
author = {Buşoniu, Lucian and De Schutter, Bart and Babuška, Robert},
editor = {Babuška, Robert and Groen, Frans C. A.},
editora = {Kacprzyk, Janusz},
editoratype = {redactor},
date = {2010},
volume = {281},
pages = {3--44},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-11688-9_1},
url = {http://link.springer.com/10.1007/978-3-642-11688-9_1},
urldate = {2024-04-20},
abstract = {Dynamic Programming (DP) and Reinforcement Learning (RL) can be used to address problems from a variety of fields, including automatic control, artificial intelligence, operations research, and economy. Many problems in these fields are described by continuous variables, whereas DP and RL can find exact solutions only in the discrete case. Therefore, approximation is essential in practical DP and RL. This chapter provides an in-depth review of the literature on approximate DP and RL in large or continuous-space, infinite-horizon problems. Value iteration, policy iteration, and policy search approaches are presented in turn. Model-based (DP) as well as online and batch model-free (RL) algorithms are discussed. We review theoretical guarantees on the approximate solutions produced by these algorithms. Numerical examples illustrate the behavior of several representative algorithms in practice. Techniques to automatically derive value function approximators are discussed, and a comparison between value iteration, policy iteration, and policy search is provided. The chapter closes with a discussion of open issues and promising research directions in approximate DP and RL.},
isbn = {978-3-642-11687-2 978-3-642-11688-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/5AXF69RI/Buşoniu et al. - 2010 - Approximate Dynamic Programming and Reinforcement .pdf}
}
@inreference{CalculusConstructions2023,
title = {Calculus of Constructions},
booktitle = {Wikipedia},
date = {2023-12-30T17:58:22Z},
url = {https://en.wikipedia.org/w/index.php?title=Calculus_of_constructions&oldid=1192670368},
urldate = {2024-02-22},
abstract = {In mathematical logic and computer science, the calculus of constructions (CoC) is a type theory created by Thierry Coquand. It can serve as both a typed programming language and as constructive foundation for mathematics. For this second reason, the CoC and its variants have been the basis for Coq and other proof assistants. Some of its variants include the calculus of inductive constructions (which adds inductive types), the calculus of (co)inductive constructions (which adds coinduction), and the predicative calculus of inductive constructions (which removes some impredicativity).},
langid = {english},
annotation = {Page Version ID: 1192670368},
file = {/home/danesabo/Zotero/storage/8AAX379X/Calculus_of_constructions.html}
}
@book{caleroAutonomicTrustedComputing2011,
title = {Autonomic and {{Trusted Computing}}},
editor = {Calero, Jose M. Alcaraz and Yang, Laurence T. and Mármol, Félix Gómez and García Villalba, Luis Javier and Li, Andy Xiaolin and Wang, Yan},
date = {2011},
series = {Lecture {{Notes}} in {{Computer Science}}},
volume = {6906},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-23496-5},
url = {http://link.springer.com/10.1007/978-3-642-23496-5},
urldate = {2023-10-11},
isbn = {978-3-642-23495-8 978-3-642-23496-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/KZDEPX74/Calero et al. - 2011 - Autonomic and Trusted Computing.pdf}
}
@inproceedings{cardenasChallengesSecuringCyber2009,
title = {Challenges for Securing Cyber Physical Systems},
booktitle = {Workshop on Future Directions in Cyber-Physical Systems Security},
author = {Cardenas, Alvaro and Amin, Saurabh and Sinopoli, Bruno and Giani, Annarita and Perrig, Adrian and Sastry, Shankar},
date = {2009},
volume = {5},
number = {1},
publisher = {Citeseer},
file = {/home/danesabo/Zotero/storage/VIPBRX72/Cardenas et al. - Challenges for Securing Cyber Physical Systems.pdf}
}
@article{cardoneHistoryLambdacalculusCombinatory2006,
title = {History of Lambda-Calculus and Combinatory Logic},
author = {Cardone, Felice and Hindley, J Roger},
date = {2006},
journaltitle = {Handbook of the History of Logic},
shortjournal = {Handbook of the History of Logic},
volume = {5},
pages = {723--817},
publisher = {Citeseer},
file = {/home/danesabo/Zotero/storage/GCW3LDKX/Cardone and Hindley - 2006 - History of lambda-calculus and combinatory logic.pdf}
}
@online{CareersPreparationNational,
title = {Careers {{Preparation National Center}} | {{CAE Community}}},
url = {https://www.caecommunity.org/national-center/careers-preparation-national-center},
urldate = {2023-11-07},
file = {/home/danesabo/Zotero/storage/P7W6HMVG/careers-preparation-national-center.html}
}
@online{carneiroLean4LeanFormalizedMetatheory2024,
title = {{{Lean4Lean}}: {{Towards}} a Formalized Metatheory for the {{Lean}} Theorem Prover},
shorttitle = {{{Lean4Lean}}},
author = {Carneiro, Mario},
date = {2024-03-20},
eprint = {2403.14064},
eprinttype = {arXiv},
eprintclass = {cs},
url = {http://arxiv.org/abs/2403.14064},
urldate = {2024-03-25},
abstract = {In this paper we present a new "external verifier" for the Lean theorem prover, written in Lean itself. This is the first complete verifier for Lean 4 other than the reference implementation in C++ used by Lean itself, and our new verifier is competitive with the original, running between 20\% and 50\% slower and usable to verify all of Lean's mathlib library, forming an additional step in Lean's aim to self-host the full elaborator and compiler. Moreover, because the verifier is written in a language which admits formal verification, it is possible to state and prove properties about the kernel itself, and we report on some initial steps taken in this direction to formalize the Lean type theory abstractly and show that the kernel correctly implements this theory, to eliminate the possibility of implementation bugs in the kernel and increase the trustworthiness of proofs conducted in it. This work is still ongoing but we plan to use this project to help justify any future changes to the kernel and type theory and ensure unsoundness does not sneak in through either the abstract theory or implementation bugs.},
pubstate = {prepublished},
version = {1},
file = {/home/danesabo/Zotero/storage/JSQM93W8/Carneiro - 2024 - Lean4Lean Towards a formalized metatheory for the.pdf;/home/danesabo/Zotero/storage/DTNS3D35/2403.html}
}
@book{carreiraFoundationsMultiParadigmModelling2020,
title = {Foundations of {{Multi-Paradigm Modelling}} for {{Cyber-Physical Systems}}},
editor = {Carreira, Paulo and Amaral, Vasco and Vangheluwe, Hans},
date = {2020},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-43946-0},
url = {http://link.springer.com/10.1007/978-3-030-43946-0},
urldate = {2023-11-08},
isbn = {978-3-030-43945-3 978-3-030-43946-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/BR5ZCJH3/Carreira et al. - 2020 - Foundations of Multi-Paradigm Modelling for Cyber-.pdf}
}
@inproceedings{carterEC2000Criterion2001,
title = {{{EC}} 2000 {{Criterion}} 2: {{A Procedure For Creating}}, {{Assessing}}, {{And Documenting Program Educational Objectives}}},
shorttitle = {Ec 2000 {{Criterion}} 2},
booktitle = {2001 {{Annual Conference Proceedings}}},
author = {Carter, Michael and Brent, Rebecca and Rajala, Sarah},
date = {2001-06},
pages = {6.400.1-6.400.11},
publisher = {ASEE Conferences},
location = {Albuquerque, New Mexico},
doi = {10.18260/1-2--9153},
url = {http://peer.asee.org/9153},
urldate = {2024-01-30},
eventtitle = {2001 {{Annual Conference}}},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZUSEY378/Carter and Rajala - 2001 - Ec 2000 Criterion 2 A Procedure For Creating, Ass.pdf}
}
@article{caspiLUSTREDeclarativeLanguage,
title = {{{LUSTRE}}: {{A}} Declarative Language for Programming Synchronous Systems},
author = {Caspi, P and Pilaud, D and Halbwachs, N and Plaice, J A},
abstract = {LUSTRE is a synchronous data-flow language for programming systems which interact with their environments in real-time. After an informal presentation of the language, we describe its semantics by means of structural inference rules. Moreover, we show how to use this semantics in order to generate efficient sequential code, namely, a finite state automaton which represents the control of the program. Formal rules for program transformation are also presented.},
langid = {english},
file = {/home/danesabo/Zotero/storage/6379N5DJ/Caspi et al. - LUSTRE A declarative language for programming syn.pdf}
}
@inreference{CategoryTheory2023,
title = {Category Theory},
booktitle = {Wikipedia},
date = {2023-12-03T02:30:08Z},
url = {https://en.wikipedia.org/w/index.php?title=Category_theory&oldid=1188056431},
urldate = {2023-12-12},
abstract = {Category theory is a general theory of mathematical structures and their relations that was introduced by Samuel Eilenberg and Saunders Mac Lane in the middle of the 20th century in their foundational work on algebraic topology. Category theory is used in almost all areas of mathematics. In particular, many constructions of new mathematical objects from previous ones that appear similarly in several contexts are conveniently expressed and unified in terms of categories. Examples include quotient spaces, direct products, completion, and duality. Many areas of computer science also rely on category theory, such as functional programming and semantics. A category is formed by two sorts of objects: the objects of the category, and the morphisms, which relate two objects called the source and the target of the morphism. One often says that a morphism is an arrow that maps its source to its target. Morphisms can be composed if the target of the first morphism equals the source of the second one, and morphism composition has similar properties as function composition (associativity and existence of identity morphisms). Morphisms are often some sort of function, but this is not always the case. For example, a monoid may be viewed as a category with a single object, whose morphisms are the elements of the monoid. The second fundamental concept of category theory is the concept of a functor, which plays the role of a morphism between two categories C 1 \{\textbackslash displaystyle C\_\{1\}\} and C 2 : \{\textbackslash displaystyle C\_\{2\}:\} it maps objects of C 1 \{\textbackslash displaystyle C\_\{1\}\} to objects of C 2 \{\textbackslash displaystyle C\_\{2\}\} and morphisms of C 1 \{\textbackslash displaystyle C\_\{1\}\} to morphisms of C 2 \{\textbackslash displaystyle C\_\{2\}\} in such a way that sources are mapped to sources, and targets are mapped to targets (or, in the case of a contravariant functor, sources are mapped to targets and vice-versa). A third fundamental concept is a natural transformation that may be viewed as a morphism of functors.},
langid = {english},
annotation = {Page Version ID: 1188056431},
file = {/home/danesabo/Zotero/storage/JLEGLRH9/Category_theory.html}
}
@incollection{championKind2Model2016,
title = {The {{Kind}} 2 {{Model Checker}}},
booktitle = {Computer {{Aided Verification}}},
author = {Champion, Adrien and Mebsout, Alain and Sticksel, Christoph and Tinelli, Cesare},
editor = {Chaudhuri, Swarat and Farzan, Azadeh},
date = {2016},
volume = {9780},
pages = {510--517},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-41540-6_29},
url = {http://link.springer.com/10.1007/978-3-319-41540-6_29},
urldate = {2023-11-02},
abstract = {Kind 2 is an open-source, multi-engine, SMT-based model checker for safety properties of finite- and infinite-state synchronous reactive systems. It takes as input models written in an extension of the Lustre language that allows the specification of assume-guarantee-style contracts for system components. Kind 2 was implemented from scratch based on techniques used by its predecessor, the PKind model checker. This paper discusses a number of improvements over PKind in terms of invariant generation. It also introduces two main features: contract-based compositional reasoning and certificate generation.},
isbn = {978-3-319-41539-0 978-3-319-41540-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/9NYU8FU7/Champion et al. - 2016 - The Kind 2 Model Checker.pdf}
}
@article{chanFormalVerificationStability,
title = {Formal {{Verification}} of {{Stability Properties}} of {{Cyber-physical Systems}}},
author = {Chan, Matthew and Ricketts, Daniel and Lerner, Sorin and Malecha, Gregory},
langid = {english},
file = {/home/danesabo/Zotero/storage/DU2NYBHL/Chan et al. - Formal Verification of Stability Properties of Cybe.pdf}
}
@unpublished{chanReasoningBayesianNetwork2012,
title = {Reasoning about {{Bayesian}} Network Classifiers},
author = {Chan, Hei and Darwiche, Adnan},
date = {2012},
eprint = {1212.2470},
eprinttype = {arXiv},
file = {/home/danesabo/Zotero/storage/B654ZQJB/Reasoning about Bayesian Network Classifiers}
}
@article{chappellatElementaryProofsClassical1990,
title = {Elementary Proofs of Some Classical Stability Criteria},
author = {Chappellat, H. and Mansour, M. and Bhattacharyya, S.P.},
date = {1990-08},
journaltitle = {IEEE Transactions on Education},
volume = {33},
number = {3},
pages = {232--239},
issn = {1557-9638},
doi = {10.1109/13.57067},
url = {https://ieeexplore.ieee.org/abstract/document/57067?casa_token=SodSTIZPpjcAAAAA:ONTyRX4k9bUtWJTm0CpJTswPYnu3yjEiqspACwSjdysCegdrs2_eASfrDg3GmkXXElkGYUJbcw},
urldate = {2024-03-04},
abstract = {Classical stability results and test on the stability of a given polynomial are proved and derived using a simple continuity property. The resulting proofs given of the Hermite-Bieler theorem and the Routh and Jury tests are elementary and full of insight. The proofs allow the instructor to present these fundamental topics of control theory to undergraduates in an elementary, rational, and meaningful way rather than as mere sets of rules and formulae.{$<>$}},
eventtitle = {{{IEEE Transactions}} on {{Education}}},
file = {/home/danesabo/Zotero/storage/72C8YKGT/Chappellat et al. - 1990 - Elementary proofs of some classical stability crit.pdf;/home/danesabo/Zotero/storage/YLLB6JD5/57067.html}
}
@online{charalambousNewEraSoftware2023,
title = {A {{New Era}} in {{Software Security}}: {{Towards Self-Healing Software}} via {{Large Language Models}} and {{Formal Verification}}},
shorttitle = {A {{New Era}} in {{Software Security}}},
author = {Charalambous, Yiannis and Tihanyi, Norbert and Jain, Ridhi and Sun, Youcheng and Ferrag, Mohamed Amine and Cordeiro, Lucas C.},
date = {2023-05-24},
eprint = {2305.14752},
eprinttype = {arXiv},
eprintclass = {cs},
doi = {10.48550/arXiv.2305.14752},
url = {http://arxiv.org/abs/2305.14752},
urldate = {2024-03-07},
abstract = {In this paper we present a novel solution that combines the capabilities of Large Language Models (LLMs) with Formal Verification strategies to verify and automatically repair software vulnerabilities. Initially, we employ Bounded Model Checking (BMC) to locate the software vulnerability and derive a counterexample. The counterexample provides evidence that the system behaves incorrectly or contains a vulnerability. The counterexample that has been detected, along with the source code, are provided to the LLM engine. Our approach involves establishing a specialized prompt language for conducting code debugging and generation to understand the vulnerability's root cause and repair the code. Finally, we use BMC to verify the corrected version of the code generated by the LLM. As a proof of concept, we create ESBMC-AI based on the Efficient SMT-based Context-Bounded Model Checker (ESBMC) and a pre-trained Transformer model, specifically gpt-3.5-turbo, to detect and fix errors in C programs. Our experimentation involved generating a dataset comprising 1000 C code samples, each consisting of 20 to 50 lines of code. Notably, our proposed method achieved an impressive success rate of up to 80\% in repairing vulnerable code encompassing buffer overflow and pointer dereference failures. We assert that this automated approach can effectively incorporate into the software development lifecycle's continuous integration and deployment (CI/CD) process.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/8DZV9YCB/Charalambous et al. - 2023 - A New Era in Software Security Towards Self-Heali.pdf;/home/danesabo/Zotero/storage/SJ2HSCEP/2305.html}
}
@inproceedings{chekoleEnforcingMemorySafety2018,
title = {Enforcing {{Memory Safety}} in {{Cyber-Physical Systems}}},
booktitle = {Computer {{Security}}},
author = {Chekole, Eyasu Getahun and Castellanos, John Henry and Ochoa, Martín and Yau, David K. Y.},
editor = {Katsikas, Sokratis K. and Cuppens, Frédéric and Cuppens, Nora and Lambrinoudakis, Costas and Kalloniatis, Christos and Mylopoulos, John and Antón, Annie and Gritzalis, Stefanos},
date = {2018},
pages = {127--144},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-72817-9_9},
abstract = {Cyber-Physical Systems (CPS) integrate computations and communications with physical processes and are being widely adopted in various application areas. However, the increasing prevalence of cyber attacks targeting them poses a growing security concern. In particular, attacks exploiting memory-safety vulnerabilities constitute a major attack vector against CPS, because embedded systems often rely on unsafe but fast programming languages to meet their hard time constraints. A wide range of countermeasures has been developed to provide protection against these attacks. However, the most reliable countermeasures incur in high runtime overheads. In this work, we explore the applicability of strong countermeasures against memory-safety attacks in the context of realistic Industrial Control Systems (ICS). To this end, we design an experimental setup, based on a secure water treatment plant (SWaT) to empirically measure the memory safety overhead (MSO) caused by memory-safe compilation of the Programmable Logic Controller (PLC). We then quantify the tolerability of this overhead in terms of the expected real-time constraints of SWaT. Our results show high effectiveness of the security measure in detecting memory-safety violations and a MSO (197.86~\$\$\textbackslash upmu \textbackslash text \{s\}\$\$per scan-cycle) that is also tolerable for the SWaT simulation. We also discuss how different parameters impact the execution time of PLCs and the resulting absolute MSO.},
isbn = {978-3-319-72817-9},
langid = {english}
}
@article{cheminodFormalVulnerabilityAnalysis2011,
title = {Formal {{Vulnerability Analysis}} of a {{Security System}} for {{Remote Fieldbus Access}}},
author = {Cheminod, Manuel and Pironti, Alfredo and Sisto, Riccardo},
date = {2011-02},
journaltitle = {IEEE Transactions on Industrial Informatics},
shortjournal = {IEEE Trans. Ind. Inf.},
volume = {7},
number = {1},
pages = {30--40},
issn = {1551-3203, 1941-0050},
doi = {10.1109/TII.2010.2099233},
url = {http://ieeexplore.ieee.org/document/5685603/},
urldate = {2023-10-10},
abstract = {As fieldbus networks are becoming accessible from the Internet, security mechanisms to grant access only to authorized users and to protect data are becoming essential. This paper proposes a formally based approach to the analysis of such systems, both at the security protocols level and at the system architecture level. This multilevel analysis allows the evaluation of the effects of an attack on the overall system, due to security problems that affect the underlying security protocols. A case study on a typical fieldbus security system validates the approach.},
langid = {english},
file = {/home/danesabo/Zotero/storage/LQHDDLSW/Cheminod et al. - 2011 - Formal Vulnerability Analysis of a Security System.pdf}
}
@article{chenApplicationsCyberPhysicalSystem2017,
title = {Applications of {{Cyber-Physical System}}: {{A Literature Review}}},
shorttitle = {Applications of {{Cyber-Physical System}}},
author = {Chen, Hong},
date = {2017-09},
journaltitle = {Journal of Industrial Integration and Management},
shortjournal = {J. Ind. Intg. Mgmt.},
volume = {02},
number = {03},
pages = {1750012},
publisher = {World Scientific Publishing Co.},
issn = {2424-8622},
doi = {10.1142/S2424862217500129},
url = {https://www.worldscientific.com/doi/abs/10.1142/S2424862217500129},
urldate = {2025-03-31},
abstract = {Cyber-Physical System (CPS), a new generation of digital system, mainly focuses on complex interdependencies and integration between cyberspace and physical world. A CPS is composed of highly-integrated computation, communication, control, and physical elements. CPS is currently of interest in academia, industry, and government. However, a systematic and extensive review of research on CPS is not available. As such, this paper conducts an expanded literature review on applications of CPS by examining existing literatures from 2012 to 2017 in Scopus database. Specifically, 77 papers studying applications of CPS are grouped into 10 categories and reviewed. The contents of the papers in each research category are summarized. The challenges and trends of research on CPS are illustrated as well.},
keywords = {applications,Cyber-physical system,review},
file = {/home/danesabo/Zotero/storage/NS9QLA3X/Chen - 2017 - Applications of Cyber-Physical System A Literature Review.pdf}
}
@inproceedings{chenFlowAnalyzerNonlinear2013,
title = {Flow*: {{An Analyzer}} for {{Non-linear Hybrid Systems}}},
shorttitle = {Flow*},
booktitle = {Computer {{Aided Verification}}},
author = {Chen, Xin and Ábrahám, Erika and Sankaranarayanan, Sriram},
editor = {Sharygina, Natasha and Veith, Helmut},
date = {2013},
series = {Lecture {{Notes}} in {{Computer Science}}},
pages = {258--263},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-39799-8_18},
abstract = {The tool Flow* performs Taylor model-based flowpipe construction for non-linear (polynomial) hybrid systems. Flow* combines well-known Taylor model arithmetic techniques for guaranteed approximations of the continuous dynamics in each mode with a combination of approaches for handling mode invariants and discrete transitions. Flow* supports a wide variety of optimizations including adaptive step sizes, adaptive selection of approximation orders and the heuristic selection of template directions for aggregating flowpipes. This paper describes Flow* and demonstrates its performance on a series of non-linear continuous and hybrid system benchmarks. Our comparisons show that Flow* is competitive with other tools.},
isbn = {978-3-642-39799-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/SK8CFEYG/Chen et al. - 2013 - Flow An Analyzer for Non-linear Hybrid Systems.pdf}
}
@article{chenFullscopeHighfidelitySimulatorbased2024,
title = {A Full-Scope, High-Fidelity Simulator-Based Hardware-in-the-Loop Testbed for Comprehensive Nuclear Power Plant Cybersecurity Research},
author = {Chen, Xiangyi and Coble, Jamie and Zhang, Fan},
date = {2024-10-01},
journaltitle = {Progress in Nuclear Energy},
shortjournal = {Progress in Nuclear Energy},
volume = {175},
pages = {105348},
issn = {0149-1970},
doi = {10.1016/j.pnucene.2024.105348},
url = {https://www.sciencedirect.com/science/article/pii/S0149197024002981},
urldate = {2024-08-08},
abstract = {Nuclear power plant (NPP) cybersecurity research often relies on hardware-in-the-loop (HIL) testbeds that integrate real hardware components into simulated environments. These testbeds allow researchers to identify vulnerabilities, evaluate attack impacts, and test security measures in a controlled setting. However, previous HIL testbeds lacked fidelity to accurately represent real nuclear systems, limiting the scope of cybersecurity analysis. This study presents the creation of a HIL testbed, devised upon a full-scope, high-fidelity NPP simulator, to facilitate realistic and comprehensive cybersecurity research. To demonstrate its capabilities, the control logic for the steam generator water level was migrated from the simulator to an external programmable logic controller. As a practical application of the developed testbed, supply chain attack scenarios were simulated by injecting malicious code into the controller logic, and the effects of manipulating sensor inputs and control commands were observed. While this HIL testbed provides more detailed simulations, enhanced realism, and wider applicability compared to other options utilizing a less complex simulator, it is also more intricate and costly. For this reason, we include a detailed comparison with some alternative architectures to aid fellow researchers and practitioners in the selection of a suitable HIL architecture based on specific research objectives.},
keywords = {Cybersecurity,Hardware-in-the-loop,Nuclear power plants},
file = {/home/danesabo/Zotero/storage/728ANR9A/S0149197024002981.html}
}
@book{chengJoyAbstractionExploration2022,
title = {The {{Joy}} of {{Abstraction}}: {{An Exploration}} of {{Math}}, {{Category Theory}}, and {{Life}}},
shorttitle = {The {{Joy}} of {{Abstraction}}},
author = {Cheng, Eugenia},
date = {2022},
publisher = {Cambridge University Press},
location = {Cambridge},
doi = {10.1017/9781108769389},
url = {https://www.cambridge.org/core/books/joy-of-abstraction/00D9AFD3046A406CB85D1AFF5450E657},
urldate = {2023-12-12},
abstract = {Mathematician and popular science author Eugenia Cheng is on a mission to show you that mathematics can be flexible, creative, and visual. This joyful journey through the world of abstract mathematics into category theory will demystify mathematical thought processes and help you develop your own thinking, with no formal mathematical background needed. The book brings abstract mathematical ideas down to earth using examples of social justice, current events, and everyday life – from privilege to COVID-19 to driving routes. The journey begins with the ideas and workings of abstract mathematics, after which you will gently climb toward more technical material, learning everything needed to understand category theory, and then key concepts in category theory like natural transformations, duality, and even a glimpse of ongoing research in higher-dimensional category theory. For fans of How to Bake Pi, this will help you dig deeper into mathematical concepts and build your mathematical background.},
isbn = {978-1-108-47722-2},
file = {/home/danesabo/Zotero/storage/WP7ENA7K/Cheng - 2022 - The Joy of Abstraction An Exploration of Math, Ca.pdf}
}
@article{chenIntegratedIntelligentManufacturing2017,
title = {Integrated and {{Intelligent Manufacturing}}: {{Perspectives}} and {{Enablers}}},
shorttitle = {Integrated and {{Intelligent Manufacturing}}},
author = {Chen, Yubao},
date = {2017-10},
journaltitle = {Engineering},
shortjournal = {Engineering},
volume = {3},
number = {5},
pages = {588--595},
issn = {20958099},
doi = {10.1016/J.ENG.2017.04.009},
url = {https://linkinghub.elsevier.com/retrieve/pii/S2095809917307105},
urldate = {2023-10-11},
langid = {english},
file = {/home/danesabo/Zotero/storage/U9SWFV93/Chen - 2017 - Integrated and Intelligent Manufacturing Perspect.pdf}
}
@incollection{chenReachabilityAnalysisCyberPhysical2022,
title = {Reachability {{Analysis}} for {{Cyber-Physical Systems}}: {{Are We There Yet}}?},
shorttitle = {Reachability {{Analysis}} for {{Cyber-Physical Systems}}},
booktitle = {{{NASA Formal Methods}}},
author = {Chen, Xin and Sankaranarayanan, Sriram},
editor = {Deshmukh, Jyotirmoy V. and Havelund, Klaus and Perez, Ivan},
date = {2022},
volume = {13260},
pages = {109--130},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-031-06773-0_6},
url = {https://link.springer.com/10.1007/978-3-031-06773-0_6},
urldate = {2023-11-01},
abstract = {Reachability analysis is a fundamental problem in verification that checks for a given model and set of initial states if the system will reach a given set of unsafe states. Its importance lies in the ability to exhaustively explore the behaviors of a model over a finite or infinite time horizon. The problem of reachability analysis for Cyber-Physical Systems (CPS) is especially challenging because it involves reasoning about the continuous states of the system as well as its switching behavior. Each of these two aspects can by itself cause the reachability analysis problem to be undecidable. In this paper, we survey recent progress in this field beginning with the success of hybrid systems with affine dynamics. We then examine the current state-of-the-art for CPS with nonlinear dynamics and those driven by “learning-enabled” components such as neural networks. We conclude with an examination of some promising directions and open challenges.},
isbn = {978-3-031-06772-3 978-3-031-06773-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/REWKIBHI/Chen and Sankaranarayanan - 2022 - Reachability Analysis for Cyber-Physical Systems .pdf}
}
@report{chenReachabilityAnalysisNonLinear2015,
title = {Reachability {{Analysis}} of {{Non-Linear Hybrid Systems Using Taylor Models}}},
author = {Chen, Xin},
date = {2015-03},
institution = {RWTH Aachen},
file = {/home/danesabo/Zotero/storage/U4KQSFLR/_.pdf}
}
@inproceedings{chenTaylorModelFlowpipe2012,
title = {Taylor {{Model Flowpipe Construction}} for {{Non-linear Hybrid Systems}}},
booktitle = {2012 {{IEEE}} 33rd {{Real-Time Systems Symposium}}},
author = {Chen, Xin and Abraham, Erika and Sankaranarayanan, Sriram},
date = {2012-12},
pages = {183--192},
publisher = {IEEE},
location = {San Juan, PR, USA},
doi = {10.1109/RTSS.2012.70},
url = {http://ieeexplore.ieee.org/document/6424802/},
urldate = {2023-10-13},
abstract = {We propose an approach for verifying non-linear hybrid systems using higher-order Taylor models that are a combination of bounded degree polynomials over the initial conditions and time, bloated by an interval. Taylor models are an effective means for computing rigorous bounds on the complex time trajectories of non-linear differential equations. As a result, Taylor models have been successfully used to verify properties of non-linear continuous systems. However, the handling of discrete (controller) transitions remains a challenging problem.},
eventtitle = {2012 {{IEEE}} 33rd {{Real-Time Systems Symposium}} ({{RTSS}})},
isbn = {978-1-4673-3098-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/LXKWGYPQ/Chen et al. - 2012 - Taylor Model Flowpipe Construction for Non-linear .pdf}
}
@book{chlipalaCertifiedProgrammingDependent2022,
title = {Certified {{Programming}} with {{Dependent Types}}: {{A Pragmatic Introduction}} to the {{Coq Proof Assistant}}},
shorttitle = {Certified {{Programming}} with {{Dependent Types}}},
author = {Chlipala, Adam},
date = {2022-06-07},
eprint = {Ji9uEAAAQBAJ},
eprinttype = {googlebooks},
publisher = {MIT Press},
abstract = {A handbook to the Coq software for writing and checking mathematical proofs, with a practical engineering focus.The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes a practical engineering focus throughout, emphasizing techniques that will help users to build, understand, and maintain large Coq developments and minimize the cost of code change over time.Two topics, rarely discussed elsewhere, are covered in detail: effective dependently typed programming (making productive use of a feature at the heart of the Coq system) and construction of domain-specific proof tactics. Almost every subject covered is also relevant to interactive computer theorem proving in general, not just program verification, demonstrated through examples of verified programs applied in many different sorts of formalizations. The book develops a unique automated proof style and applies it throughout; even experienced Coq users may benefit from reading about basic Coq concepts from this novel perspective. The book also offers a library of tactics, or programs that find proofs, designed for use with examples in the book. Readers will acquire the necessary skills to reimplement these tactics in other settings by the end of the book. All of the code appearing in the book is freely available online.},
isbn = {978-0-262-54574-7},
langid = {english},
pagetotal = {437}
}
@inproceedings{chlipalaProofAssistantsHardwaresoftware2020,
title = {Proof Assistants at the Hardware-Software Interface (Invited Talk)},
author = {Chlipala, Adam},
date = {2020-01-22},
series = {{{CPP}} 2020},
pages = {2},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/3372885.3378575},
url = {https://dl.acm.org/doi/10.1145/3372885.3378575},
urldate = {2024-01-27},
abstract = {Some of the earliest applications of proof assistants were to correctness of digital hardware designs, but the subject doesn’t come up too frequently today at venues like CPP. I will try to make the case that proof assistants are a crucial tool for resolving both classical problems and new ones at the hardware-software interface. That is, it is important to understand exactly what guarantees a processor exports to software, it is important to verify that hardware exports those guarantees correctly, and it is important to prove end-to-end theorems covering both hardware and software. A few social developments make this an exciting time to tackle these problems: open instruction sets and open-source hardware designs are growing in real-world relevance, and surprising new classes of security vulnerabilities have gotten more practitioners thinking about precise hardware-software contracts. I will sketch the state of the research area and go into detail on a few of my own related projects. An ancillary goal is to convey that programming or proving digital hardware is a lot like programming or proving software, with a few fun distinctions, so more of the CPP crowd might want to give it a try!},
isbn = {978-1-4503-7097-4},
keywords = {formal verification,hardware-software interface,information leaks through side channels,machine-language instruction sets,Proof assistants},
file = {/home/danesabo/Zotero/storage/MS9I87ZS/Chlipala - 2020 - Proof assistants at the hardware-software interface (invited talk).pdf}
}
@article{choiCompilingNeuralNetworks2017,
title = {Compiling Neural Networks into Tractable {{Boolean}} Circuits},
author = {Choi, Arthur and Shi, Weijia and Shih, Andy and Darwiche, Adnan},
date = {2017},
journaltitle = {intelligence},
file = {/home/danesabo/Zotero/storage/I47P8AX8/Compiling Neural Networks into Tractable Boolean Circuits.pdf}
}
@inproceedings{choiRealTimeHardwareintheLoopHIL2021,
title = {A {{Real-Time Hardware-in-the-Loop}} ({{HIL}}) {{Cybersecurity Testbed}} for {{Power Electronics Devices}} and {{Systems}} in {{Cyber-Physical Environments}}},
booktitle = {2021 {{IEEE}} 12th {{International Symposium}} on {{Power Electronics}} for {{Distributed Generation Systems}} ({{PEDG}})},
author = {Choi, Jinchun and Narayanasamy, Deneesh and Ahn, Bohyun and Ahmad, Seerin and Zeng, Jianwu and Kim, Taesic},
date = {2021-06},
pages = {1--5},
issn = {2329-5767},
doi = {10.1109/PEDG51384.2021.9494202},
url = {https://ieeexplore.ieee.org/abstract/document/9494202?casa_token=M3oUmP8SwFwAAAAA:ACZjrOLxlTZLojfGcQKbezrwrOZAN_5jpmlBS7p3zQ0CKbwkSEr9KWUL1lFacIseAFjGsSOdxEo},
urldate = {2024-08-08},
abstract = {Cybersecurity of power electronics (PE) is increasingly essential as more systems from renewable energy systems, energy storage systems, and electric vehicle charging stations utilize PE devices to connect them into power grids with complex communication and computation systems for advanced control and situational awareness improvement in smart grid environments. However, cybersecurity research and development (R\&D) of networked power electronics (PE) is hampered by the lack of real-time security testbed incorporating real cyber events. This paper proposes a real-time hardware-in-the-loop cybersecurity tested for PE systems in cyber-physical environments. The proposed security testbed consists of: 1) a real-time PE system simulator; 2) a real-time cyber system using real network systems and a server; and 3) penetration testing tools generating real Cyber-attacks as cyber events. Several real cyber-attacks are created and their impacts in a PE system are provided to validate the feasibility of the proposed security testbed.},
eventtitle = {2021 {{IEEE}} 12th {{International Symposium}} on {{Power Electronics}} for {{Distributed Generation Systems}} ({{PEDG}})},
keywords = {Control systems,Cybersecurity,Distributed databases,false data injection attack,hardware-in-the-loop testbed,man-in-the-middle attack,penetration testing,power electronics,Real-time systems,Renewable energy sources,Servers,Smart grids,Tools},
file = {/home/danesabo/Zotero/storage/NAAC2F9Q/Choi et al. - 2021 - A Real-Time Hardware-in-the-Loop (HIL) Cybersecuri.pdf;/home/danesabo/Zotero/storage/LCESNBE5/9494202.html}
}
@report{chongReportNSFWorkshop2016,
title = {Report on the {{NSF}} Workshop on Formal Methods for Security},
author = {Chong, Stephen and Guttman, Joshua and Datta, Anupam and Myers, Andrew and Pierce, Benjamin and Schaumont, Patrick and Sherwood, Tim and Zeldovich, Nickolai},
date = {2016},
file = {/home/danesabo/Zotero/storage/H95MLW3Y/Chong et al. - Formal Methods for Security.pdf}
}
@article{cimattiSMTBasedVerificationHybrid2021,
title = {{{SMT-Based Verification}} of {{Hybrid Systems}}},
author = {Cimatti, Alessandro and Mover, Sergio and Tonetta, Stefano},
date = {2021-09-20},
journaltitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
shortjournal = {AAAI},
volume = {26},
number = {1},
pages = {2100--2105},
issn = {2374-3468, 2159-5399},
doi = {10.1609/aaai.v26i1.8442},
url = {https://ojs.aaai.org/index.php/AAAI/article/view/8442},
urldate = {2023-11-02},
abstract = {Hybrid automata networks (HAN) are a powerful formalism to model complex embedded systems. In this paper, we survey the recent advances in the application of Satisfiability Modulo Theories (SMT) to the analysis of HAN. SMT can be seen as an extended form of Boolean satisfiability (SAT), where literals are interpreted with respect to a background theory (e.g. linear arithmetic). HAN can be symbolically represented by means of SMT formulae, and analyzed by generalizing to the case of SMT the traditional model checking algorithms based on SAT.},
langid = {english},
file = {/home/danesabo/Zotero/storage/LKR5F7WA/Cimatti et al. - 2021 - SMT-Based Verification of Hybrid Systems.pdf}
}
@article{cleavelandFormallyVerifiedNextgeneration2023,
title = {Formally {{Verified Next-generation Airborne Collision Avoidance Games}} in {{ACAS X}}},
author = {Cleaveland, Rachel and Mitsch, Stefan and Platzer, André},
date = {2023-01-31},
journaltitle = {ACM Transactions on Embedded Computing Systems},
shortjournal = {ACM Trans. Embed. Comput. Syst.},
volume = {22},
number = {1},
pages = {1--30},
issn = {1539-9087, 1558-3465},
doi = {10.1145/3544970},
url = {https://dl.acm.org/doi/10.1145/3544970},
urldate = {2023-10-13},
abstract = {The design of aircraft collision avoidance algorithms is a subtle but important challenge that merits the need for provable safety guarantees. Obtaining such guarantees is nontrivial given the unpredictability of the interplay of the intruder aircraft decisions, the ownship pilot reactions, and the subtlety of the continuous motion dynamics of aircraft. Existing collision avoidance systems, such as TCAS and the Next-Generation Airborne Collision Avoidance System ACAS~X, have been analyzed assuming severe restrictions on the intruder’s flight maneuvers, limiting their safety guarantees in real-world scenarios where the intruder may change its course. This work takes a conceptually significant and practically relevant departure from existing ACAS~X models by generalizing them to hybrid games with first-class representations of the ownship and intruder decisions coming from two independent players, enabling significantly advanced predictive power. By proving the existence of winning strategies for the resulting Adversarial ACAS~X in differential game logic, collision-freedom is established for the rich encounters of ownship and intruder aircraft with independent decisions along differential equations for flight paths with evolving vertical/horizontal velocities. We present three classes of models of increasing complexity: single-advisory infinite-time models, bounded time models, and infinite time, multi-advisory models. Within each class of models, we identify symbolic conditions and prove that there then always is a possible ownship maneuver that will prevent a collision between the two aircraft.},
langid = {english},
file = {/home/danesabo/Zotero/storage/Q2YWB54J/Cleaveland et al. - 2023 - Formally Verified Next-generation Airborne Collisi.pdf}
}
@online{CNVerifyingSystems,
title = {{{CN}}: {{Verifying Systems C Code}} with {{Separation-Logic Refinement Types}}},
url = {https://www.cl.cam.ac.uk/~cp526/popl23.html},
urldate = {2024-04-04},
file = {/home/danesabo/Zotero/storage/KUI8J3TZ/popl23.html}
}
@inproceedings{coeckePicturingQuantumProcesses2018,
title = {Picturing {{Quantum Processes}}},
booktitle = {Diagrammatic {{Representation}} and {{Inference}}},
author = {Coecke, Bob and Kissinger, Aleks},
editor = {Chapman, Peter and Stapleton, Gem and Moktefi, Amirouche and Perez-Kriz, Sarah and Bellucci, Francesco},
date = {2018},
series = {Lecture {{Notes}} in {{Computer Science}}},
pages = {28--31},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-91376-6_6},
abstract = {We provide a self-contained introduction to quantum theory using a unique diagrammatic language. Far from simple visual aids, the diagrams we use are mathematical objects in their own right, which allow us to develop from first principles a completely rigorous treatment of ‘textbook’ quantum theory. Additionally, the diagrammatic treatment eliminates the need for the typical prerequisites of a standard course on the subject, making it suitable for a multi-disciplinary audience with no prior knowledge in physics or advanced mathematics.},
isbn = {978-3-319-91376-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/4EIF5CL6/Coecke and Kissinger - 2018 - Picturing Quantum Processes.pdf}
}
@article{coferCyberassuredSystemsEngineering2022,
title = {Cyberassured {{Systems Engineering}} at {{Scale}}},
author = {Cofer, Darren and Amundson, Isaac and Babar, Junaid and Hardin, David and Slind, Konrad and Alexander, Perry and Hatcliff, John and {Robby} and Klein, Gerwin and Lewis, Corey and Mercer, Eric and Shackleton, John},
date = {2022-05},
journaltitle = {IEEE Security \& Privacy},
shortjournal = {IEEE Secur. Privacy},
volume = {20},
number = {3},
pages = {52--64},
issn = {1540-7993, 1558-4046},
doi = {10.1109/MSEC.2022.3151733},
url = {https://ieeexplore.ieee.org/document/9734792/},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/C5UFPI5F/Cofer et al. - 2022 - Cyberassured Systems Engineering at Scale.pdf}
}
@report{coferSecureMathematicallyAssuredComposition2017,
type = {Final Technical Report},
title = {Secure {{Mathematically-Assured Composition}} of {{Control Models}}},
author = {Cofer, Darren and Backes, John and Gacek, Andrew and DaCosta, Daniel and Whalen, Michael and Kuz, Ihor and Klein, Gerwin and Heiser, Gernot and Pike, Lee and Foltzer, Adam and Podhradsky, Michal and Stuart, Douglas and Grahan, Jason and Wilson, Brett},
date = {2017},
number = {AFRL-RI-RS-TR-2017-176},
abstract = {The Secure Mathematically-Assured Composition of Control Models project (SMACCM) has developed new tools for building UAV software that is provably secure against many classes of cyber-attack. The goal of the project is to provide verifiable security; that is, system designs which provide the highest levels of confidence in their security based upon verifiable evidence. The SMACCM team has developed system architecture models, software components for mission and control functions, and operating system software, all of which are mathematically analyzed to ensure key security properties.},
file = {/home/danesabo/Zotero/storage/X4WW6A5E/SECURE MATHEMATICALLY-ASSURED COMPOSITION OF CONTROL MODELS.pdf}
}
@incollection{cohenFormalProofCoq2017,
title = {A {{Formal Proof}} in {{Coq}} of {{LaSalle}}’s {{Invariance Principle}}},
booktitle = {Interactive {{Theorem Proving}}},
author = {Cohen, Cyril and Rouhling, Damien},
editor = {Ayala-Rincón, Mauricio and Muñoz, César A.},
date = {2017},
volume = {10499},
pages = {148--163},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-66107-0_10},
url = {https://link.springer.com/10.1007/978-3-319-66107-0_10},
urldate = {2024-01-22},
abstract = {Stability analysis of dynamical systems plays an important role in the study of control techniques. LaSalle’s invariance principle is a result about the asymptotic stability of the solutions to a nonlinear system of differential equations and several extensions of this principle have been designed to fit different particular kinds of system. In this paper we present a formalization, in the Coq proof assistant, of a slightly improved version of the original principle. This is a step towards a formal verification of dynamical systems.},
isbn = {978-3-319-66106-3 978-3-319-66107-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/TGTE6VEY/Cohen and Rouhling - 2017 - A Formal Proof in Coq of LaSalle’s Invariance Prin.pdf}
}
@book{commissionCyberSecurityPrograms2010,
title = {Cyber Security Programs for Nuclear Facilities},
author = {Commission, US Nuclear Regulatory},
date = {2010},
publisher = {US Nuclear Regulatory Commission, Office of Nuclear Regulatory Research},
file = {/home/danesabo/Zotero/storage/QV45YLEI/NRC - CYBER SECURITY PROGRAMS FOR NUCLEAR FACILITIES.pdf}
}
@book{committeeonavisionforthefutureofcenter-basedmultidisciplinaryengineeringresearchNewVisionCenterBased2017,
title = {A {{New Vision}} for {{Center-Based Engineering Research}}},
author = {{Committee on a Vision for the Future of Center-Based Multidisciplinary Engineering Research} and {National Materials and Manufacturing Board} and {Division on Engineering and Physical Sciences} and {National Academy of Engineering} and {National Academies of Sciences, Engineering, and Medicine}},
date = {2017-07-18},
pages = {24767},
publisher = {National Academies Press},
location = {Washington, D.C.},
doi = {10.17226/24767},
url = {https://www.nap.edu/catalog/24767},
urldate = {2024-01-26},
isbn = {978-0-309-45905-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/5PV6DQFF/Committee on a Vision for the Future of Center-Based Multidisciplinary Engineering Research et al. - 2017 - A New Vision for Center-Based Engineering Research.pdf}
}
@inproceedings{communityLeanMathematicalLibrary2020,
title = {The {{Lean}} Mathematical Library},
booktitle = {Proceedings of the 9th {{ACM SIGPLAN International Conference}} on {{Certified Programs}} and {{Proofs}}},
author = {family=Community, given=The, prefix=mathlib, useprefix=false},
date = {2020-01-20},
eprint = {1910.09336},
eprinttype = {arXiv},
eprintclass = {cs, math},
pages = {367--381},
doi = {10.1145/3372885.3373824},
url = {http://arxiv.org/abs/1910.09336},
urldate = {2024-01-30},
abstract = {This paper describes mathlib, a community-driven effort to build a unified library of mathematics formalized in the Lean proof assistant. Among proof assistant libraries, it is distinguished by its dependently typed foundations, focus on classical mathematics, extensive hierarchy of structures, use of large- and small-scale automation, and distributed organization. We explain the architecture and design decisions of the library and the social organization that has led us here.},
file = {/home/danesabo/Zotero/storage/NFJMCVN5/Community - 2020 - The Lean mathematical library.pdf;/home/danesabo/Zotero/storage/EXVAUZBA/1910.html}
}
@online{CompetencyClient,
title = {{{CompetencyClient}}},
url = {https://cybercompetencies.com/help},
urldate = {2023-11-09},
file = {/home/danesabo/Zotero/storage/28XFHABH/help.html}
}
@misc{CompetencyDevelopment2pager,
title = {Competency {{Development}} 2-Pager},
file = {/home/danesabo/Zotero/storage/8BWNU6ZL/Competency Development_ 2-pager July 2023.pdf}
}
@online{CompfilesREADMEmdMain,
title = {Compfiles/{{README}}.Md at Main · Dwrensha/Compfiles},
url = {https://github.com/dwrensha/compfiles/blob/main/README.md},
urldate = {2024-03-28},
file = {/home/danesabo/Zotero/storage/9388NUZC/README.html}
}
@incollection{ComputerArithmeticFormal2017,
title = {Computer {{Arithmetic}} and {{Formal Proofs}}},
booktitle = {Floating-{{Point Algorithms}} and {{Formal Proofs}}},
date = {2017},
pages = {i-iii},
publisher = {Elsevier},
doi = {10.1016/B978-1-78548-112-3.50010-2},
url = {https://linkinghub.elsevier.com/retrieve/pii/B9781785481123500102},
urldate = {2024-01-16},
isbn = {978-1-78548-112-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/MCCW3PB5/2017 - Front matter.pdf}
}
@online{controltutorialsformatlab&simulinkInvertedPendulumSystem,
type = {Tutorial},
title = {Inverted {{Pendulum}}: {{System Modeling}}},
author = {Control Tutorials For Matlab \& Simulink},
url = {https://ctms.engin.umich.edu/CTMS/index.php?example=InvertedPendulum&section=SystemModeling},
urldate = {2023-11-15},
organization = {Control Tutorials For Matlab \& Simulink}
}
@book{ConvergenceFacilitatingTransdisciplinary2014,
title = {Convergence: {{Facilitating Transdisciplinary Integration}} of {{Life Sciences}}, {{Physical Sciences}}, {{Engineering}}, and {{Beyond}}},
shorttitle = {Convergence},
date = {2014-06-16},
pages = {18722},
publisher = {National Academies Press},
location = {Washington, D.C.},
doi = {10.17226/18722},
url = {http://www.nap.edu/catalog/18722},
urldate = {2024-01-26},
isbn = {978-0-309-30151-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/7Z64C3WL/2014 - Convergence Facilitating Transdisciplinary Integr.pdf}
}
@article{cookIndustrialControlSystem2017,
title = {The Industrial Control System Cyber Defence Triage Process},
author = {Cook, Allan and Janicke, Helge and Smith, Richard and Maglaras, Leandros},
date = {2017-09},
journaltitle = {Computers \& Security},
shortjournal = {Computers \& Security},
volume = {70},
pages = {467--481},
issn = {01674048},
doi = {10.1016/j.cose.2017.07.009},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0167404817301505},
urldate = {2023-10-11},
abstract = {The threat to Industrial Control Systems (ICS) from cyber attacks is widely acknowledged by governments and literature. Operators of ICS are looking to address these threats in an effective and cost-sensitive manner that does not expose their operations to additional risks through invasive testing. Whilst existing standards and guidelines offer comprehensive advice for reviewing the security of ICS infrastructure, resource and time limitations can lead to incomplete assessments or undesirably long countermeasure implementation schedules. In this paper we consider the problem of undertaking efficient cyber security risk assessments and implementing mitigations in large, established ICS operations for which a full security review cannot be implemented on a constrained timescale. The contribution is the Industrial Control System Cyber Defence Triage Process (ICS-CDTP). ICS-CDTP determines areas of priority where the impact of attacks is greatest, and where initial investment reduces the organisation’s overall exposure swiftly. ICS-CDTP is designed to be a precursor to a wider, holistic review across the operation following established security management approaches. ICS-CDTP is a novel combination of the Diamond Model of Intrusion Analysis, the Mandiant Attack Lifecycle, and the CARVER Matrix, allowing for an effective triage of attack vectors and likely targets for a capable antagonist. ICS-CDTP identifies and focuses on key ICS processes and their exposure to cyber threats with the view to maintain critical operations. The article defines ICS-CDTP and exemplifies its application using a fictitious water treatment facility, and explains its evaluation as part of a large-scale serious game exercise.},
langid = {english},
file = {/home/danesabo/Zotero/storage/GSXFDXCH/Cook et al. - 2017 - The industrial control system cyber defence triage.pdf}
}
@article{coquandCalculusConstructions,
title = {The Calculus of Constructions},
author = {Coquand, T and Huet, Gérard},
file = {/home/danesabo/Zotero/storage/6RINJL4G/Coquand and Huet - The calculus of constructions.pdf}
}
@book{councilDigitalInstrumentationControl1997,
title = {Digital Instrumentation and Control Systems in Nuclear Power Plants: Safety and Reliability Issues},
author = {Council, National Research},
date = {1997},
publisher = {National Academies Press},
isbn = {0-309-05732-9},
file = {/home/danesabo/Zotero/storage/B88RJKSN/Council - 1997 - Digital instrumentation and control systems in nuc.pdf}
}
@article{cremersFormalMethodsSecurity2003,
title = {Formal Methods for Security Protocols: {{Three}} Examples of the Black-Box Approach},
author = {Cremers, C. J. F. and Mauw, S. and De Vink, E. P.},
date = {2003},
journaltitle = {NVTI newsletter},
volume = {7},
pages = {21--32},
file = {/home/danesabo/Zotero/storage/TEF7JGI3/Cremers et al. - Formal Methods for Security Protocols Three Examp.pdf}
}
@inproceedings{crespoComputationalFrameworkControl2010,
title = {A {{Computational Framework}} to {{Control Verification}} and {{Robustness Analysis}}},
author = {Crespo, Luis G. and Kenny, Sean P. and Giesy, Daniel P.},
date = {2010-01-01},
url = {https://ntrs.nasa.gov/citations/20100006918},
urldate = {2024-07-10},
abstract = {This paper presents a methodology for evaluating the robustness of a controller based on its ability to satisfy the design requirements. The framework proposed is generic since it allows for high-fidelity models, arbitrary control structures and arbitrary functional dependencies between the requirements and the uncertain parameters. The cornerstone of this contribution is the ability to bound the region of the uncertain parameter space where the degradation in closed-loop performance remains acceptable. The size of this bounding set, whose geometry can be prescribed according to deterministic or probabilistic uncertainty models, is a measure of robustness. The robustness metrics proposed herein are the parametric safety margin, the reliability index, the failure probability and upper bounds to this probability. The performance observed at the control verification setting, where the assumptions and approximations used for control design may no longer hold, will fully determine the proposed control assessment.},
keywords = {Aircraft Stability And Control},
annotation = {NTRS Author Affiliations: National Inst. of Aerospace, NASA Langley Research Center\\
NTRS Report/Patent Number: L-19786\\
NTRS Document ID: 20100006918\\
NTRS Research Center: Langley Research Center (LaRC)},
file = {/home/danesabo/Zotero/storage/FGHX7PPI/Crespo et al. - 2010 - A Computational Framework to Control Verification .pdf;/home/danesabo/Zotero/storage/GTKHW7XL/20100006918.html}
}
@online{CriteriaAccreditingEngineering,
title = {Criteria for {{Accrediting Engineering Programs}}, 2022 - 2023},
url = {https://www.abet.org/accreditation/accreditation-criteria/criteria-for-accrediting-engineering-programs-2022-2023/},
urldate = {2024-01-26},
langid = {american},
organization = {ABET}
}
@inproceedings{crossLevelSetMethods2008,
title = {Level Set Methods for Computing Reachable Sets of Systems with Differential Algebraic Equation Dynamics},
booktitle = {2008 {{American Control Conference}}},
author = {Cross, Elizabeth Ann and Mitchell, Ian M.},
date = {2008-06},
pages = {2260--2265},
publisher = {IEEE},
location = {Seattle, WA},
doi = {10.1109/ACC.2008.4586828},
url = {http://ieeexplore.ieee.org/document/4586828/},
urldate = {2023-10-27},
abstract = {Most existing algorithms for approximating the reachable sets of continuous systems assume an ordinary differential equation model of system evolution. In this paper we adapt such an existing algorithm—one based on level set methods and the Hamilton-Jacobi partial differential equation—in two distinct ways to work with systems modeled by index one differential algebraic equations (DAEs). The first method works by analytic projection of the dynamics onto the DAE’s constraint manifold, while the second works in the full dimensional state space. The two schemes are demonstrated on a nonlinear power system voltage safety problem.},
eventtitle = {2008 {{American Control Conference}} ({{ACC}} '08)},
isbn = {978-1-4244-2078-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/9QYT24ZG/getPDF.pdf}
}
@online{Cryptol,
title = {Cryptol},
url = {https://cryptol.net/},
urldate = {2024-04-04}
}
@online{cuomoScientificMachineLearning2022,
title = {Scientific {{Machine Learning}} through {{Physics-Informed Neural Networks}}: {{Where}} We Are and {{What}}'s Next},
shorttitle = {Scientific {{Machine Learning}} through {{Physics-Informed Neural Networks}}},
author = {Cuomo, Salvatore and family=Cola, given=Vincenzo Schiano, prefix=di, useprefix=true and Giampaolo, Fabio and Rozza, Gianluigi and Raissi, Maziar and Piccialli, Francesco},
date = {2022-06-07},
eprint = {2201.05624},
eprinttype = {arXiv},
eprintclass = {physics},
url = {http://arxiv.org/abs/2201.05624},
urldate = {2024-01-30},
abstract = {Physics-Informed Neural Networks (PINN) are neural networks (NNs) that encode model equations, like Partial Differential Equations (PDE), as a component of the neural network itself. PINNs are nowadays used to solve PDEs, fractional equations, integral-differential equations, and stochastic PDEs. This novel methodology has arisen as a multi-task learning framework in which a NN must fit observed data while reducing a PDE residual. This article provides a comprehensive review of the literature on PINNs: while the primary goal of the study was to characterize these networks and their related advantages and disadvantages. The review also attempts to incorporate publications on a broader range of collocation-based physics informed neural networks, which stars form the vanilla PINN, as well as many other variants, such as physics-constrained neural networks (PCNN), variational hp-VPINN, and conservative PINN (CPINN). The study indicates that most research has focused on customizing the PINN through different activation functions, gradient optimization techniques, neural network structures, and loss function structures. Despite the wide range of applications for which PINNs have been used, by demonstrating their ability to be more feasible in some contexts than classical numerical techniques like Finite Element Method (FEM), advancements are still possible, most notably theoretical issues that remain unresolved.},
pubstate = {prepublished},
keywords = {Computer Science - Artificial Intelligence,Computer Science - Machine Learning,Mathematics - Numerical Analysis,Physics - Data Analysis Statistics and Probability,Review Paper},
file = {/home/danesabo/Zotero/storage/QRD8BXX9/Cuomo et al. - 2022 - Scientific Machine Learning through Physics-Inform.pdf;/home/danesabo/Zotero/storage/QEJYHDAU/2201.html}
}
@online{CWECommonWeakness,
title = {{{CWE}} - {{Common Weakness Enumeration}}},
url = {https://cwe.mitre.org/},
urldate = {2024-02-29},
file = {/home/danesabo/Zotero/storage/XQYSKTJH/cwe.mitre.org.html}
}
@online{CWECWECAPEC,
title = {{{CWE}} - {{CWE}}/{{CAPEC Board}}},
url = {https://cwe.mitre.org/community/board.html},
urldate = {2024-02-29},
file = {/home/danesabo/Zotero/storage/ABWFP6Q7/board.html}
}
@online{CyberAttackGerman2015,
title = {Cyber {{Attack}} on {{German Steel Mill Leads}} to ‘{{Massive}}’ {{Real World Damage}}},
date = {2015-01-08},
url = {https://www.pbs.org/wgbh/nova/article/cyber-attack-german-steel-mill-leads-massive-real-world-damage/},
urldate = {2024-08-13},
abstract = {A steel mill in Germany lost control of its blast furnace. Hackers had infiltrated the mill’s control system, according to the German government’s office for information security.},
langid = {american},
file = {/home/danesabo/Zotero/storage/Y6IAD9IJ/cyber-attack-german-steel-mill-leads-massive-real-world-damage.html}
}
@report{CyberInformedEngineeringImplementation2023,
title = {Cyber-{{Informed Engineering Implementation Guide}}},
date = {2023-08-07},
number = {INL/RPT-23-74072},
file = {/home/danesabo/Zotero/storage/7PU4N9BT/Sort_67122.pdf}
}
@online{CybersecurityEmergingEngineering,
title = {Cybersecurity in {{Emerging Engineering Systems}} | {{Academics}}},
url = {https://www.academics.pitt.edu/programs/cybersecurity-emerging-engineering-systems},
urldate = {2024-03-27},
file = {/home/danesabo/Zotero/storage/FBXWWXCL/cybersecurity-emerging-engineering-systems.html}
}
@article{CYBERSECURITYHIGHRISKSERIES,
title = {{{CYBERSECURITY HIGH-RISK SERIES}}: {{Challenges}} in {{Protecting Cyber Critical Infrastructure}}},
langid = {english},
file = {/home/danesabo/Zotero/storage/DU9QPYDJ/GAO-23-106441, CYBERSECURITY HIGH-RISK SERIES Ch.pdf}
}
@report{CyberSecurityPlan2010,
title = {Cyber {{Security Plan}} for {{Nuclear Power Reactors}}},
date = {2010-04},
number = {NEI 08-09 [Rev. 6]},
file = {/home/danesabo/Zotero/storage/XL5B2QC3/ML101180437.pdf}
}
@incollection{dammLscsBreathingLife1999,
title = {Lsc’s: {{Breathing Life Into Message Sequence Charts}}},
shorttitle = {Lsc’s},
booktitle = {Formal {{Methods}} for {{Open Object-Based Distributed Systems}}},
author = {Damm, Werner and Harel, David},
editor = {Ciancarini, Paolo and Fantechi, Alessandro and Gorrieri, Robert},
date = {1999},
pages = {293--311},
publisher = {Springer US},
location = {Boston, MA},
doi = {10.1007/978-0-387-35562-7_23},
url = {http://link.springer.com/10.1007/978-0-387-35562-7_23},
urldate = {2023-10-11},
abstract = {While message sequence charts (MSCs) are widely used in industry to document the interworking of processes or objects, they are expressively weak, being based on the modest semantic notion of a partial ordering of events as defined, e.g., in the ITU standard. A highly expressive and rigorously defined MSC language is a must for serious, semantically meaningful tool support for use-cases and scenarios. It is also a prerequisite to addressing what we regard as one of the central problems in behavioral specification of systems: relating scenario-based inter-object specification to state-machine intra-object specification. This paper proposes an extension of MSCs, which we call live sequence charts (or LSCs), since our main extension deals with specifying “liveness”, i.e., things that must occur. In fact, LSCs allow the distinction between possible and necessary behavior both globally, on the level of an entire chart and locally, when specifying events, conditions and progress over time within a chart. This makes it possible to specify forbidden scenarios, for example, and enables naturally specified structuring constructs such as subcharts, branching and iteration.},
isbn = {978-1-4757-5266-3 978-0-387-35562-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/X2KCT9RY/Damm and Harel - 1999 - Lsc’s Breathing Life Into Message Sequence Charts.pdf}
}
@inproceedings{dangeloProbabilisticRobustnessAnalysis2019,
title = {Probabilistic {{Robustness Analysis}} of an {{Actively Controlled Structure}} That {{Operates}} in {{Harsh}} and {{Uncertain Environments}}},
booktitle = {Structural {{Health Monitoring}}, {{Photogrammetry}} \& {{DIC}}, {{Volume}} 6},
author = {D’Angelo, Christopher J. and Cole, Daniel G. and Collinger, John C.},
editor = {Niezrecki, Christopher and Baqersad, Javad},
date = {2019},
pages = {121--131},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-74476-6_17},
abstract = {This work uses probabilistic robustness techniques to show how the stability margin of an uncertain controlled structure that operates in a harsh, potentially radioactive environment can be analyzed in order to find a less conservative destabilizing uncertainty perturbation. The uncertainty is quantified in terms of a measure on the size of the covariance matrix in a multivariate Gaussian distribution. This uncertainty is used to capture the aggregate effects on a structure’s dynamic behavior due to material changes resulting from radiation embrittlement and mechanical fatigue. A probabilistic-robust full-state feedback ℋ∞\$\$\{\textbackslash mathcal \{H\}\_\textbackslash infty \}\$\$controller is synthesized for a low-dimensional structural model using a technique known as scenario-based probabilistic-robust synthesis. A probabilistic-robust stability margin is defined and extracted from a stability degradation function, demonstrating that a fourfold increase in the amount of uncertainty in the model can be tolerated if the designer is willing to concede a small probability that the actively-controlled structure may be unstable for certain system configurations.},
isbn = {978-3-319-74476-6},
langid = {english},
keywords = {\(\mathcal H_\infty \),Active vibration control,Probabilistic robust control,Probabilistic stability margins,Uncertainty},
file = {/home/danesabo/Zotero/storage/URB949VZ/D’Angelo et al. - 2019 - Probabilistic Robustness Analysis of an Actively C.pdf}
}
@incollection{darvasFormalVerificationSafety2016,
title = {Formal {{Verification}} of {{Safety PLC Based Control Software}}},
booktitle = {Integrated {{Formal Methods}}},
author = {Darvas, Dániel and Majzik, István and Blanco Viñuela, Enrique},
editor = {Ábrahám, Erika and Huisman, Marieke},
date = {2016},
volume = {9681},
pages = {508--522},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-33693-0_32},
url = {http://link.springer.com/10.1007/978-3-319-33693-0_32},
urldate = {2023-10-10},
abstract = {Programmable Logic Controllers (PLCs) are widely used in the industry for various industrial automation tasks. Besides non-safety applications, the usage of PLCs became accepted in safety-critical installations, where the cost of failure is high. In these cases the used hardware is special (so-called fail-safe or safety PLCs), but also the software needs special considerations. Formal verification is a method that can help to develop high-quality software for critical tasks. However, such method should be adapted to the special needs of the safety PLCs, that are often particular compared to the normal PLC development domain. In this paper we propose two complementary solutions for the formal verification of safety-critical PLC programs based on model checking and equivalence checking using formal specification. Furthermore, a case study is presented, demonstrating our approach.},
isbn = {978-3-319-33692-3 978-3-319-33693-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/WJ76H7IQ/Darvas et al. - 2016 - Formal Verification of Safety PLC Based Control So.pdf}
}
@article{dattaStabilityInertia1999,
title = {Stability and Inertia},
author = {Datta, Biswa Nath},
date = {1999-12},
journaltitle = {Linear Algebra and its Applications},
shortjournal = {Linear Algebra and its Applications},
volume = {302--303},
pages = {563--600},
issn = {00243795},
doi = {10.1016/S0024-3795(99)00213-X},
url = {https://linkinghub.elsevier.com/retrieve/pii/S002437959900213X},
urldate = {2024-03-04},
abstract = {The purpose of this paper is to present a brief overview of matrix stability and inertia theory. A few applications of inertia and stability theorems, and a nonspectral implicit matrix equation method for determining stability and inertia of a nonhermitian matrix are also presented. Inter-relationships between different theorems are explicitly stated, whenever appropriate. The paper concludes with some problems for future research in this area. © 1999 Elsevier Science Inc. All rights reserved.},
langid = {english},
file = {/home/danesabo/Zotero/storage/KR633RQ7/Datta - 1999 - Stability and inertia.pdf}
}
@article{davisFidelityMathematicalDiscourse1972,
title = {Fidelity in {{Mathematical Discourse}}: {{Is One}} and {{One Really Two}}?},
shorttitle = {Fidelity in {{Mathematical Discourse}}},
author = {Davis, P. J.},
date = {1972},
journaltitle = {The American Mathematical Monthly},
volume = {79},
number = {3},
eprint = {2316620},
eprinttype = {jstor},
pages = {252--263},
publisher = {Mathematical Association of America},
issn = {0002-9890},
doi = {10.2307/2316620},
url = {https://www.jstor.org/stable/2316620},
urldate = {2024-02-17},
file = {/home/danesabo/Zotero/storage/TSW5BQ6F/Davis - 1972 - Fidelity in Mathematical Discourse Is One and One.pdf}
}
@article{decarloPerspectivesResultsStability2000,
title = {Perspectives and Results on the Stability and Stabilizability of Hybrid Systems},
author = {Decarlo, R.A. and Branicky, M.S. and Pettersson, S. and Lennartson, B.},
date = {2000-07},
journaltitle = {Proceedings of the IEEE},
volume = {88},
number = {7},
pages = {1069--1082},
issn = {1558-2256},
doi = {10.1109/5.871309},
url = {https://ieeexplore.ieee.org/document/871309},
urldate = {2024-01-16},
abstract = {This paper introduces the concept of a hybrid system and some of the challenges associated with the stability of such systems, including the issues of guaranteeing stability of switched stable systems and finding conditions for the existence of switched controllers for stabilizing switched unstable systems. In this endeavour, this paper surveys the major results in the (Lyapunov) stability of finite-dimensional hybrid systems and then discusses the stronger, more specialized results of switched linear (stable and unstable) systems. A section detailing how some of the results can be formulated as linear matrix inequalities is given. Stability analyses on the regulation of the angle of attack of an aircraft and on the PI control of a vehicle with an automatic transmission are given. Other examples are included to illustrate various results in this paper.},
eventtitle = {Proceedings of the {{IEEE}}},
file = {/home/danesabo/Zotero/storage/BZZGQZKR/Decarlo et al. - 2000 - Perspectives and results on the stability and stab.pdf}
}
@article{delahayeProbabilisticContractsCompositional2011,
title = {Probabilistic Contracts: A Compositional Reasoning Methodology for the Design of Systems with Stochastic and/or Non-Deterministic Aspects},
shorttitle = {Probabilistic Contracts},
author = {Delahaye, Benoît and Caillaud, Benoît and Legay, Axel},
date = {2011-02},
journaltitle = {Formal Methods in System Design},
shortjournal = {Form Methods Syst Des},
volume = {38},
number = {1},
pages = {1--32},
issn = {0925-9856, 1572-8102},
doi = {10.1007/s10703-010-0107-8},
url = {http://link.springer.com/10.1007/s10703-010-0107-8},
urldate = {2023-11-08},
abstract = {A contract allows to distinguish hypotheses made on a system (the guarantees) from those made on its environment (the assumptions). In this paper, we focus on models of Assume/Guarantee contracts for (stochastic) systems. We consider contracts capable of capturing reliability and availability properties of such systems. We also show that classical notions of Satisfaction and Refinement can be checked by effective methods thanks to a reduction to classical verification problems. Finally, theorems supporting compositional reasoning and enabling the scalable analysis of complex systems are also studied.},
langid = {english},
file = {/home/danesabo/Zotero/storage/VKNJ5WQI/Delahaye et al. - 2011 - Probabilistic contracts a compositional reasoning.pdf}
}
@article{demilloSocialProcessesProofs1979,
title = {Social Processes and Proofs of Theorems and Programs},
author = {De Millo, Richard A. and Lipton, Richard J. and Perlis, Alan J.},
date = {1979-05-01},
journaltitle = {Communications of the ACM},
shortjournal = {Commun. ACM},
volume = {22},
number = {5},
pages = {271--280},
issn = {0001-0782},
doi = {10.1145/359104.359106},
url = {https://dl.acm.org/doi/10.1145/359104.359106},
urldate = {2024-02-17},
abstract = {It is argued that formal verifications of programs, no matter how obtained, will not play the same key role in the development of computer science and software engineering as proofs do in mathematics. Furthermore the absence of continuity, the inevitability of change, and the complexity of specification of significantly many real programs make the formal verification process difficult to justify and manage. It is felt that ease of formal verification should not dominate program language design.},
file = {/home/danesabo/Zotero/storage/3EZJGH5Z/De Millo et al. - 1979 - Social processes and proofs of theorems and progra.pdf}
}
@article{demouraLean4Theorem,
title = {The {{Lean}} 4 {{Theorem Prover}} and {{Programming Language}} ({{System Description}})},
author = {family=Moura, given=Leonardo, prefix=de, useprefix=true and Ullrich, Sebastian},
abstract = {Lean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm called functional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.},
langid = {english},
file = {/home/danesabo/Zotero/storage/5SN35WB7/de Moura and Ullrich - The Lean 4 Theorem Prover and Programming Language.pdf}
}
@article{derlerModelingCyberPhysical2012,
title = {Modeling {{Cyber}}–{{Physical Systems}}},
author = {Derler, P. and Lee, E. A. and Vincentelli, A. S.},
date = {2012-01},
journaltitle = {Proceedings of the IEEE},
shortjournal = {Proc. IEEE},
volume = {100},
number = {1},
pages = {13--28},
issn = {0018-9219, 1558-2256},
doi = {10.1109/JPROC.2011.2160929},
url = {http://ieeexplore.ieee.org/document/5995279/},
urldate = {2023-10-11},
abstract = {This paper focuses on the challenges of modeling cyber–physical systems (CPSs) that arise from the intrinsic heterogeneity, concurrency, and sensitivity to timing of such systems. It uses a portion of an aircraft vehicle management system (VMS), specifically the fuel management subsystem, to illustrate the challenges, and then discusses technologies that at least partially address the challenges. Specific technologies described include hybrid system modeling and simulation, concurrent and heterogeneous models of computation, the use of domain-specific ontologies to enhance modularity, and the joint modeling of functionality and implementation architectures.},
langid = {english},
file = {/home/danesabo/Zotero/storage/IG6G3BEH/Derler et al. - 2012 - Modeling Cyber–Physical Systems.pdf}
}
@article{deutschbeinHardwareSecurityProperty2022,
title = {Toward {{Hardware Security Property Generation}} at {{Scale}}},
author = {Deutschbein, Calvin and Meza, Andres and Restuccia, Francesco and Gregoire, Matthew and Kastner, Ryan and Sturton, Cynthia},
date = {2022-05},
journaltitle = {IEEE Security \& Privacy},
shortjournal = {IEEE Secur. Privacy},
volume = {20},
number = {3},
pages = {43--51},
issn = {1540-7993, 1558-4046},
doi = {10.1109/MSEC.2022.3155376},
url = {https://ieeexplore.ieee.org/document/9765633/},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/VMQL5YJU/Deutschbein et al. - 2022 - Toward Hardware Security Property Generation at Sc.pdf}
}
@article{dicairanoStabilizingDynamicControllers2014,
title = {Stabilizing {{Dynamic Controllers}} for {{Hybrid Systems}}: {{A Hybrid Control Lyapunov Function Approach}}},
shorttitle = {Stabilizing {{Dynamic Controllers}} for {{Hybrid Systems}}},
author = {Di Cairano, Stefano and Heemels, W. P. Maurice H. and Lazar, Mircea and Bemporad, Alberto},
date = {2014-10},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {59},
number = {10},
pages = {2629--2643},
issn = {0018-9286, 1558-2523},
doi = {10.1109/TAC.2014.2324111},
url = {http://ieeexplore.ieee.org/document/6816126/},
urldate = {2023-11-22},
file = {/home/danesabo/Zotero/storage/M362U7HY/Di Cairano et al. - 2014 - Stabilizing Dynamic Controllers for Hybrid Systems.pdf}
}
@inproceedings{didebanControllerSynthesisPetri2009,
title = {Controller {{Synthesis By Petri Nets Modeling}}},
author = {Dideban, Abbas and Alla, Hassane},
date = {2009-07-01},
publisher = {BCS Learning \& Development},
doi = {10.14236/ewic/VECOS2009.10},
url = {https://www.scienceopen.com/hosted-document?doi=10.14236/ewic/VECOS2009.10},
urldate = {2024-02-15},
abstract = {In this paper, we present two different methods for the synthesis of a simplified controller using Petri Nets. The supervisory control theory presented by Ramadge and Wonham is adapted to Petri nets modeling. Uncontrollable transitions in discrete event systems are the cause of forbidden states in supervisory control. This paper concerns the problem of forbidden states in safe Petri Net. We present different methods to reduce the number of constraints that prevent from forbidden states. Using these methods, we can construct a maximally permissive controller. The implementation of these approaches is considered using the SFC model.},
eventtitle = {Third {{International Workshop}} on {{Verification}} and {{Evaluation}} of {{Computer}} and {{Communication Systems}} ({{VECoS}} 2009)},
file = {/home/danesabo/Zotero/storage/3ZTRNBGA/Dideban and Alla - 2009 - Controller Synthesis By Petri Nets Modeling.pdf}
}
@inproceedings{digennaroReductionTimedHybrid1994,
title = {Reduction of Timed Hybrid Systems},
booktitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Di Gennaro, S. and Horn, C. and Kulkarni, S.R. and Ramadge, P.J.},
date = {1994-12},
volume = {4},
pages = {4215-4220 vol.4},
doi = {10.1109/CDC.1994.411613},
url = {https://ieeexplore.ieee.org/abstract/document/411613?casa_token=jZEjNvcldxoAAAAA:7rrnH_LmLsGug_cmuNNoeGuE6kjFX31OYZeElBL-zU8gc1FgLPuT9-qzHnsDtPR-vBGatshfXg},
urldate = {2024-01-16},
abstract = {We consider a class of hybrid dynamic systems composed of interacting discrete and continuous subsystems. Of particular interest is the reduction of the coupled system to a single finite state automaton. Such a reduction has been proposed and analyzed in the literature on computer verification for certain special hybrid systems called timed automata. We use timed automata with two clocks (integrators) as a tool to explore extensions and generalizations of the reduction constructions. Several interesting new classes of reductions are presented.{$<>$}},
eventtitle = {Proceedings of 1994 33rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
file = {/home/danesabo/Zotero/storage/J4N49CTA/Di Gennaro et al. - 1994 - Reduction of timed hybrid systems.pdf;/home/danesabo/Zotero/storage/Z8UZQZFH/411613.html}
}
@inproceedings{diggaralaVerificationAnnotatedModels,
title = {Verification of {{Annotated Models}} from {{Executions}}},
booktitle = {{{EMSOFT}} 2023},
author = {Diggarala and Mitra and Visawnathan},
file = {/home/danesabo/Zotero/storage/VC6QY8S5/C2E2Theory2.pdf}
}
@online{DigitalTwins,
title = {Digital {{Twins}}},
url = {https://www.nrc.gov/reactors/power/digital-twins.html},
urldate = {2024-05-21},
abstract = {Digital Twins},
langid = {american},
organization = {NRC Web},
file = {/home/danesabo/Zotero/storage/VL2AU6JP/digital-twins.html}
}
@online{DoDCyberWorkforce,
title = {{{DoD Cyber Workforce Framework}} – {{DoD Cyber Exchange}}},
url = {https://public.cyber.mil/wid/dcwf/},
urldate = {2023-11-07},
file = {/home/danesabo/Zotero/storage/3EM5FBI9/dcwf.html}
}
@article{dreierFormallyPracticallyVerifying2019,
title = {Formally and Practically Verifying Flow Properties in Industrial Systems},
author = {Dreier, Jannik and Puys, Maxime and Potet, Marie-Laure and Lafourcade, Pascal and Roch, Jean-Louis},
date = {2019-09},
journaltitle = {Computers \& Security},
shortjournal = {Computers \& Security},
volume = {86},
pages = {453--470},
issn = {01674048},
doi = {10.1016/j.cose.2018.09.018},
url = {https://linkinghub.elsevier.com/retrieve/pii/S016740481831441X},
urldate = {2023-10-10},
langid = {english},
file = {/home/danesabo/Zotero/storage/V3FNANF6/Dreier et al. - 2019 - Formally and practically verifying flow properties.pdf}
}
@online{DSPACE,
title = {{{dSPACE}}},
url = {https://www.dspace.com/en/inc/home.cfm},
urldate = {2024-08-14},
abstract = {Around the world, dSPACE helps companies make their visions and ideas come to life faster and more reliably. In this we take pride. We are your partner in simulation and validation.},
langid = {english},
file = {/home/danesabo/Zotero/storage/G49FSLXT/home.html}
}
@incollection{duggiralaC2E2VerificationTool2015,
title = {{{C2E2}}: {{A Verification Tool}} for {{Stateflow Models}}},
shorttitle = {{{C2E2}}},
booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
author = {Duggirala, Parasara Sridhar and Mitra, Sayan and Viswanathan, Mahesh and Potok, Matthew},
editor = {Baier, Christel and Tinelli, Cesare},
date = {2015},
volume = {9035},
pages = {68--82},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-662-46681-0_5},
url = {http://link.springer.com/10.1007/978-3-662-46681-0_5},
urldate = {2023-11-02},
abstract = {Mathwork’s Stateflow is a predominant environment for modeling embedded and cyberphysical systems where control software interact with physical processes. We present Compare-Execute-Check-Engine (C2E2)—a verification tool for continuous and hybrid Stateflow models. It checks bounded time invariant properties of models with nonlinear dynamics, and discrete transitions with guards and resets. C2E2 transforms the model, computing simulations using a validated numerical solver, and then computes reachtube over-approximations with increasing precision. For this last step it uses annotations that have to be added to the model. These annotations are extensions of proof certificates studied in Control Theory and can be automatically obtained for linear dynamics. The C2E2 algorithm is sound and it is guaranteed to terminate if the system is robustly safe (or unsafe) with respect to perturbations to the of guards and invariants of the model. We present the architecture of C2E2, its workflow, and examples illustrating its potential role in model-based design, verification, and validation.},
isbn = {978-3-662-46680-3 978-3-662-46681-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/ETLC4293/Duggirala et al. - 2015 - C2E2 A Verification Tool for Stateflow Models.pdf}
}
@article{durethConditionalDiffusionbasedMicrostructure2023,
title = {Conditional Diffusion-Based Microstructure Reconstruction},
author = {Düreth, Christian and Seibert, Paul and Rücker, Dennis and Handford, Stephanie and Kästner, Markus and Gude, Maik},
date = {2023-06},
journaltitle = {Materials Today Communications},
shortjournal = {Materials Today Communications},
volume = {35},
pages = {105608},
issn = {23524928},
doi = {10.1016/j.mtcomm.2023.105608},
url = {https://linkinghub.elsevier.com/retrieve/pii/S2352492823002982},
urldate = {2024-05-20},
langid = {english},
file = {/home/danesabo/Zotero/storage/IQ3XQTUG/Düreth et al. - 2023 - Conditional diffusion-based microstructure reconst.pdf}
}
@incollection{dutertreFormalModelingAnalysis2007,
title = {Formal {{Modeling}} and {{Analysis}} of the {{Modbus Protocol}}},
booktitle = {Critical {{Infrastructure Protection}}},
author = {Dutertre, Bruno},
editor = {Goetz, Eric and Shenoi, Sujeet},
date = {2007},
volume = {253},
pages = {189--204},
publisher = {Springer US},
location = {Boston, MA},
doi = {10.1007/978-0-387-75462-8_14},
url = {http://link.springer.com/10.1007/978-0-387-75462-8_14},
urldate = {2023-10-10},
abstract = {Modbus is a communication protocol that is widely used in SCADA systems and distributed control applications. This paper presents formal specifications of Modbus developed using PVS, a generic theorem prover; and SAL, a toolset for the automatic analysis of state-transition systems. Both formalizations are based on the Modbus Application Protocol, which specifies the format of Modbus request and response messages. This formal modeling effort is the first step in the development of automated methods for systematic and extensive testing of Modbus devices.},
isbn = {978-0-387-75461-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/S78P2BS3/Dutertre - 2007 - Formal Modeling and Analysis of the Modbus Protoco.pdf}
}
@article{dwDARPAsExplainableArtificial2019,
title = {{{DARPA}}’s Explainable Artificial Intelligence Program},
author = {DW, Gunning D. Aha},
date = {2019},
journaltitle = {AI Mag},
volume = {40},
number = {2},
pages = {44},
file = {/home/danesabo/Zotero/storage/MVPYRP4A/storage:storage:DARPA’s Explainable
Artificial Intelligence Program.pdf}
}
@book{EffectiveHaskell,
title = {Effective {{Haskell}}},
url = {https://learning.oreilly.com/library/view/effective-haskell/9798888650400/},
urldate = {2023-12-13},
abstract = {Put the power of Haskell to work in your programs, learning from an engineer who uses Haskell daily to get practical work done efficiently. Leverage powerful features like Monad Transformers and...},
isbn = {9798888650400},
langid = {english},
file = {/home/danesabo/Zotero/storage/PLQMGIZH/9798888650400.html}
}
@video{egerstedtLecture52Hybrid2014,
entrysubtype = {video},
title = {Lecture 5.2 - {{Hybrid Automata}}},
editor = {Egerstedt, Magnus},
editortype = {director},
date = {2014},
location = {Georgia Instiute of Technology},
url = {https://www.youtube.com/watch?v=KdjMz0rpMms},
urldate = {2023-11-14}
}
@article{ellisonExtendingAADLSecurity2015,
title = {Extending {{AADL}} for Security Design Assurance of Cyber-Physical Systems},
author = {Ellison, Robert and Householder, Allen and Hudak, John and Kazman, Rik and Woody, Carol},
date = {2015},
journaltitle = {CMU/SEI Report},
file = {/home/danesabo/Zotero/storage/H2IWZM6I/Ellison et al. - Extending AADL for Security Design Assurance of Cy.pdf}
}
@article{emamiNeuralNetworkbasedFlight2022,
title = {Neural Network-Based Flight Control Systems: {{Present}} and Future},
shorttitle = {Neural Network-Based Flight Control Systems},
author = {Emami, Seyyed Ali and Castaldi, Paolo and Banazadeh, Afshin},
date = {2022-01-01},
journaltitle = {Annual Reviews in Control},
shortjournal = {Annual Reviews in Control},
volume = {53},
pages = {97--137},
issn = {1367-5788},
doi = {10.1016/j.arcontrol.2022.04.006},
url = {https://www.sciencedirect.com/science/article/pii/S1367578822000219},
urldate = {2025-04-07},
abstract = {As the first review in this field, this paper presents an in-depth mathematical view of Intelligent Flight Control Systems (IFCSs), particularly those based on artificial neural networks. The rapid evolution of IFCSs in the last two decades in both the methodological and technical aspects necessitates a comprehensive view of them to better demonstrate the current stage and the crucial remaining steps towards developing a truly intelligent flight management unit. To this end, in this paper, we will provide a detailed mathematical view of Neural Network (NN)-based flight control systems and the challenging problems that still remain. The paper will cover both the model-based and model-free IFCSs. The model-based methods consist of the basic feedback error learning scheme, the pseudocontrol strategy, and the neural backstepping method. Besides, different approaches to analyze the closed-loop stability in IFCSs, their requirements, and their limitations will be discussed in detail. Various supplementary features, which can be integrated with a basic IFCS such as the fault-tolerance capability, the consideration of system constraints, and the combination of NNs with other robust and adaptive elements like disturbance observers, would be covered, as well. On the other hand, concerning model-free flight controllers, both the indirect and direct adaptive control systems including indirect adaptive control using NN-based system identification, the approximate dynamic programming using NN, and the reinforcement learning-based adaptive optimal control will be carefully addressed. Finally, by demonstrating a well-organized view of the current stage in the development of IFCSs, the challenging issues, which are critical to be addressed in the future, are thoroughly identified. As a result, this paper can be considered as a comprehensive road map for all researchers interested in the design and development of intelligent control systems, particularly in the field of aerospace applications.},
keywords = {Flight control,Intelligent control,Neural networks,Reinforcement learning},
file = {/home/danesabo/Zotero/storage/JVE6ZH28/Emami et al. - 2022 - Neural network-based flight control systems Present and future.pdf;/home/danesabo/Zotero/storage/TJUGEB38/S1367578822000219.html}
}
@book{EnhancingEffectivenessTeam2015,
title = {Enhancing the {{Effectiveness}} of {{Team Science}}},
date = {2015-07-15},
pages = {19007},
publisher = {National Academies Press},
location = {Washington, D.C.},
doi = {10.17226/19007},
url = {http://www.nap.edu/catalog/19007},
urldate = {2024-01-26},
isbn = {978-0-309-31682-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/P8PJ4FTW/2015 - Enhancing the Effectiveness of Team Science.pdf}
}
@article{esmaeiliEnhancingDigitalRock2024,
title = {Enhancing Digital Rock Analysis through Generative Artificial Intelligence: {{Diffusion}} Models},
shorttitle = {Enhancing Digital Rock Analysis through Generative Artificial Intelligence},
author = {Esmaeili, Mohammad},
date = {2024-06},
journaltitle = {Neurocomputing},
shortjournal = {Neurocomputing},
volume = {587},
pages = {127676},
issn = {09252312},
doi = {10.1016/j.neucom.2024.127676},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0925231224004478},
urldate = {2024-05-20},
langid = {english}
}
@article{estefanSurveyModelBasedSystems2008,
title = {Survey of {{Model-Based Systems Engineering}} ({{MBSE}}) {{Methodologies}}},
author = {Estefan, Jeff A},
date = {2008},
langid = {english},
keywords = {Important},
file = {/home/danesabo/Zotero/storage/R8V4TI8S/Estefan - 2008 - Survey of Model-Based Systems Engineering (MBSE) M.pdf}
}
@online{ExplainableVerificationSurvey2024,
title = {Explainable {{Verification}}: {{Survey}}, {{Situations}}, and {{New Ideas}}},
shorttitle = {Explainable {{Verification}}},
date = {2024-04-16},
url = {https://insights.sei.cmu.edu/library/explainable-verification-survey-situations-and-new-ideas/},
urldate = {2024-06-26},
abstract = {This report focuses on potential changes in software development practice and research that would help tools used for formal methods explain their output, making software practitioners more likely to trust them.},
langid = {english},
file = {/home/danesabo/Zotero/storage/TMYUKHUT/explainable-verification-survey-situations-and-new-ideas.html}
}
@article{fabianPetriNetsControl1994,
title = {Petri {{Nets}} and {{Control Synthesis}}: {{An Object-Oriented Approach}}},
shorttitle = {Petri {{Nets}} and {{Control Synthesis}}},
author = {Fabian, M. and Lennartson, B.},
date = {1994-06},
journaltitle = {IFAC Proceedings Volumes},
shortjournal = {IFAC Proceedings Volumes},
volume = {27},
number = {4},
pages = {365--370},
issn = {14746670},
doi = {10.1016/S1474-6670(17)46051-4},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1474667017460514},
urldate = {2024-02-15},
langid = {english},
file = {/home/danesabo/Zotero/storage/LICAU236/Fabian and Lennartson - 1994 - Petri Nets and Control Synthesis An Object-Orient.pdf}
}
@article{fabianPetriNetsControl1994a,
title = {Petri {{Nets}} and {{Control Synthesis}}: {{An Object-Oriented Approach}}},
shorttitle = {Petri {{Nets}} and {{Control Synthesis}}},
author = {Fabian, M. and Lennartson, B.},
date = {1994-06-01},
journaltitle = {IFAC Proceedings Volumes},
shortjournal = {IFAC Proceedings Volumes},
series = {{{IFAC Workshop}} on {{Intelligent Manufacturing Systems}} 1994 ({{IMS}}'94), {{Vienna}}, {{Austria}}, 13-15 {{June}}},
volume = {27},
number = {4},
pages = {365--370},
issn = {1474-6670},
doi = {10.1016/S1474-6670(17)46051-4},
url = {https://www.sciencedirect.com/science/article/pii/S1474667017460514},
urldate = {2024-02-15},
abstract = {When implementing control of discrete event systems, the efficiency and reliability would be greatly improved if the control algorithms could be automatically synthesised. Using reussble software models as models of the physical resources, and part-routing es specifications on the system-behavior, we will show how such automatic generation of coatrol algorithms can be achieved. Our approach IS based on the Supervisory Control Theory (SCT) developed by Ramadge and Wonham. The machining resources are modeled by Petri Nets. The pat-routes are also given ad petri Nets describing the order in which each part should, or can (alternative routes are allowed)visit the respective resources, together with which operation the resource is to perform on the individual part The parts’ desired routes are individually specified irrespective of parts of other types, even though they may compete for mutual resources. The part specifications, seen now as users of the resources, are composed into a joint global specification which is further composed with the resources. Elementary Petri Net manipulations give a net describing the total system with but a fraction of the states that would result from composition of the corresponding state-automatons. The reachability-graph of this Petri Net is then calculated and used as the finite state-machine input to an SCT algorithm. At this point further specifications, in the from of desired or forbidden stetes can be introduced, whereafter the supervisor is generated. In the global specification, and hence within the supervisor, the same event can lead to any of a subset of different states. This non-determinism is resolved by inspection of the system-state before and after the event. In this paper we will describe a flexible manufcturing system with a number of different products and generate its control-laws as outlined above.},
file = {/home/danesabo/Zotero/storage/JZU3UPC4/S1474667017460514.html}
}
@online{FactSheetONCD2024,
title = {Fact {{Sheet}}: {{ONCD Report Calls}} for {{Adoption}} of {{Memory Safe Programming Languages}} and {{Addressing}} the {{Hard Research Problem}} of {{Software Measurability}} | {{ONCD}}},
shorttitle = {Fact {{Sheet}}},
date = {2024-02-26},
url = {https://www.whitehouse.gov/oncd/briefing-room/2024/02/26/memory-safety-fact-sheet/},
urldate = {2024-08-14},
abstract = {ONCD Rallies Industry, Academia, and Civil Society to Join Effort February 26, 2024 Read the full report here Watch the video address here Today, the Office of the National Cyber Director (ONCD) published a technical report entitled “Back to the Building Blocks: A Path Toward Secure and Measurable Software.” The report builds upon the President’s…},
langid = {american},
organization = {The White House},
file = {/home/danesabo/Zotero/storage/5E2YKELM/memory-safety-fact-sheet.html}
}
@article{fainekosRobustnessTemporalLogic2009,
title = {Robustness of Temporal Logic Specifications for Continuous-Time Signals},
author = {Fainekos, Georgios E. and Pappas, George J.},
date = {2009-09-28},
journaltitle = {Theoretical Computer Science},
shortjournal = {Theoretical Computer Science},
volume = {410},
number = {42},
pages = {4262--4291},
issn = {0304-3975},
doi = {10.1016/j.tcs.2009.06.021},
url = {https://www.sciencedirect.com/science/article/pii/S0304397509004149},
urldate = {2023-11-03},
abstract = {In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas over signals that take values in metric spaces. For such signals, which are generated by systems whose states are equipped with non-trivial metrics, for example continuous or hybrid, robustness is not only natural, but also a critical measure of system performance. Thus, we propose multi-valued semantics for MTL formulas, which capture not only the usual Boolean satisfiability of the formula, but also topological information regarding the distance, ε, from unsatisfiability. We prove that any other signal that remains ε-close to the initial one also satisfies the same MTL specification under the usual Boolean semantics. Finally, our framework is applied to the problem of testing formulas of two fragments of MTL, namely Metric Interval Temporal Logic (MITL) and closed Metric Temporal Logic (clMTL), over continuous-time signals using only discrete-time analysis. The motivating idea behind our approach is that if the continuous-time signal fulfills certain conditions and the discrete-time signal robustly satisfies the temporal logic specification, then the corresponding continuous-time signal should also satisfy the same temporal logic specification.},
file = {/home/danesabo/Zotero/storage/7247R8AS/Fainekos and Pappas - 2009 - Robustness of temporal logic specifications for co.pdf;/home/danesabo/Zotero/storage/ZUNXFP5U/S0304397509004149.html}
}
@incollection{fanAutomaticReachabilityAnalysis2016,
title = {Automatic {{Reachability Analysis}} for {{Nonlinear Hybrid Models}} with {{C2E2}}},
booktitle = {Computer {{Aided Verification}}},
author = {Fan, Chuchu and Qi, Bolun and Mitra, Sayan and Viswanathan, Mahesh and Duggirala, Parasara Sridhar},
editor = {Chaudhuri, Swarat and Farzan, Azadeh},
date = {2016},
volume = {9779},
pages = {531--538},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-41528-4_29},
url = {http://link.springer.com/10.1007/978-3-319-41528-4_29},
urldate = {2023-11-02},
abstract = {C2E2 is a bounded reachability analysis tool for nonlinear dynamical systems and hybrid automaton models. Previously it required users to annotate each system of differential equations of the hybrid automaton with discrepancy functions, and since these annotations are difficult to get for general nonlinear differential equations, the tool had limited usability. This version of C2E2 is improved in several ways, the most prominent among which is the elimination of the need for userprovided discrepancy functions. It automatically computes piece-wise (or local) discrepancy functions around the reachable parts of the state space using symbolically computed Jacobian matrix and eigenvalue perturbation bounds. The special cases of linear and constant rate differential equations are handled with more efficient algorithm. In this paper, we discuss these and other new features that make the new C2E2 a usable tool for bounded reachability analysis of hybrid systems.},
isbn = {978-3-319-41527-7 978-3-319-41528-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/5RSUFEFL/Fan et al. - 2016 - Automatic Reachability Analysis for Nonlinear Hybr.pdf}
}
@article{faselEnsembleSINDyRobustSparse2022,
title = {Ensemble-{{SINDy}}: {{Robust}} Sparse Model Discovery in the Low-Data, High-Noise Limit, with Active Learning and Control},
shorttitle = {Ensemble-{{SINDy}}},
author = {Fasel, U. and Kutz, J. N. and Brunton, B. W. and Brunton, S. L.},
date = {2022-04},
journaltitle = {Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
shortjournal = {Proc. R. Soc. A.},
volume = {478},
number = {2260},
pages = {20210904},
issn = {1364-5021, 1471-2946},
doi = {10.1098/rspa.2021.0904},
url = {https://royalsocietypublishing.org/doi/10.1098/rspa.2021.0904},
urldate = {2024-01-04},
abstract = {Sparse model identification enables the discovery of nonlinear dynamical systems purely from data; however, this approach is sensitive to noise, especially in the low-data limit. In this work, we leverage the statistical approach of bootstrap aggregating (bagging) to robustify the sparse identification of~the nonlinear dynamics (SINDy) algorithm. First, an ensemble of SINDy models is identified from subsets of limited and noisy data. The aggregate model statistics are then used to produce inclusion probabilities of the candidate functions, which enables uncertainty quantification and probabilistic forecasts. We apply this ensemble-SINDy (E-SINDy) algorithm to several synthetic and real-world datasets and demonstrate substantial improvements to the accuracy and robustness of model discovery from extremely noisy and limited data. For example, E-SINDy uncovers partial differential equations models from data with more than twice as much measurement noise as has been previously reported. Similarly, E-SINDy learns the Lotka Volterra dynamics from remarkably limited data of yearly lynx and hare pelts collected from 1900 to 1920. E-SINDy is computationally efficient, with similar scaling as standard SINDy. Finally, we show that ensemble statistics from E-SINDy can be exploited for active learning and improved model predictive control.},
langid = {english},
file = {/home/danesabo/Zotero/storage/GEIIX8KL/Fasel et al. - 2022 - Ensemble-SINDy Robust sparse model discovery in t.pdf}
}
@article{FederalCybersecurityResearch2023,
title = {Federal {{Cybersecurity Research}} and {{Development Strategic Plan}} (2023)},
date = {2023},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZES2SB5T/2023 - Federal Cybersecurity Research and Development Str.pdf}
}
@incollection{fehnkerBenchmarksHybridSystems2004,
title = {Benchmarks for {{Hybrid Systems Verification}}},
booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
author = {Fehnker, Ansgar and Ivančić, Franjo},
editor = {Alur, Rajeev and Pappas, George J.},
editora = {Goos, Gerhard and Hartmanis, Juris and Van Leeuwen, Jan},
editoratype = {redactor},
date = {2004},
volume = {2993},
pages = {326--341},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-540-24743-2_22},
url = {http://link.springer.com/10.1007/978-3-540-24743-2_22},
urldate = {2023-11-01},
abstract = {There are numerous application examples for hybrid systems verification in recent literature. Most of them were introduced to illustrate a new approach to hybrid systems verification, and are therefore of a limited size. Others are case studies that serve to prove that an approach can be applied to real world problems. Verification of these typically requires a lot of domain experience to obtain a tractable, verifiable model. Verification of a case study yields a singular result that is hard to compare and time-consuming to reproduce.},
isbn = {978-3-540-21259-1 978-3-540-24743-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/3W8M5M5I/Fehnker and Ivančić - 2004 - Benchmarks for Hybrid Systems Verification.pdf}
}
@article{felderABCSENGINEERINGEDUCATION2004,
title = {{{THE ABC}}’{{S OF ENGINEERING EDUCATION}}: {{ABET}}, {{BLOOM}}’{{S TAXONOMY}}, {{COOPERATIVE LEARNING}}, {{AND SO ON}}},
author = {Felder, Richard M and Brent, Rebecca},
date = {2004},
langid = {english},
file = {/home/danesabo/Zotero/storage/PMHC56FH/Felder and Brent - 2004 - THE ABC’S OF ENGINEERING EDUCATION ABET, BLOOM’S .pdf}
}
@article{felderDesigningTeachingCourses2003,
title = {Designing and {{Teaching Courses}} to {{Satisfy}} the {{ABET Engineering Criteria}}},
author = {Felder, Richard M. and Brent, Rebecca},
date = {2003},
journaltitle = {Journal of Engineering Education},
volume = {92},
number = {1},
pages = {7--25},
issn = {2168-9830},
doi = {10.1002/j.2168-9830.2003.tb00734.x},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/j.2168-9830.2003.tb00734.x},
urldate = {2024-01-26},
abstract = {Since the new ABET accreditation system was first introduced to American engineering education in the middle 1990s as Engineering Criteria 2000, most discussion in the literature has focused on how to assess Outcomes 3a-3k and relatively little has concerned how to equip students with the skills and attitudes specified in those outcomes. This paper seeks to fill this gap. Its goals are to (1) overview the accreditation process and clarify the confusing array of terms associated with it (objectives, outcomes, outcome indicators, etc.); (2) provide guidance on the formulation of course learning objectives and assessment methods that address Outcomes 3a-3k; (3) identify and describe instructional techniques that should effectively prepare students to achieve those outcomes by the time they graduate; and (4) propose a strategy for integrating program-level and course-level activities when designing an instructional program to meet the requirements of the ABET engineering criteria.},
langid = {english},
file = {/home/danesabo/Zotero/storage/CWVDC6WV/Felder and Brent - 2003 - Designing and Teaching Courses to Satisfy the ABET.pdf;/home/danesabo/Zotero/storage/MEG822JW/j.2168-9830.2003.tb00734.html}
}
@article{fernandezadiegoApplyingModelChecking2015,
title = {Applying {{Model Checking}} to {{Industrial-Sized PLC Programs}}},
author = {Fernández Adiego, Borja and Darvas, Dániel and Viñuela, Enrique Blanco and Tournier, Jean-Charles and Bliudze, Simon and Blech, Jan Olaf and González Suárez, Víctor Manuel},
date = {2015-12},
journaltitle = {IEEE Transactions on Industrial Informatics},
volume = {11},
number = {6},
pages = {1400--1410},
issn = {1941-0050},
doi = {10.1109/TII.2015.2489184},
url = {https://ieeexplore.ieee.org/abstract/document/7295624?casa_token=0JbkBFtDk8cAAAAA:sp0RxKZlXykLt1TObkrAtS9gMJiSHS7NuevkhtyVRi5v104B7KMTEzWZJdD0HWeglU55PJHDd9E},
urldate = {2024-08-08},
abstract = {Programmable logic controllers (PLCs) are embedded computers widely used in industrial control systems. Ensuring that a PLC software complies with its specification is a challenging task. Formal verification has become a recommended practice to ensure the correctness of safety-critical software, but is still underused in industry due to the complexity of building and managing formal models of real applications. In this paper, we propose a general methodology to perform automated model checking of complex properties expressed in temporal logics [e.g., computation tree logic (CTL) and linear temporal logic (LTL)] on PLC programs. This methodology is based on an intermediate model (IM) meant to transform PLC programs written in various standard languages [structured text (ST), sequential function chart (SFC), etc.] to different modeling languages of verification tools. We present the syntax and semantics of the IM, and the transformation rules of the ST and SFC languages to the nuXmv model checker passing through the IM. Finally, two real cases studies of the European Organization for Nuclear Research (CERN) PLC programs, written mainly in the ST language, are presented to illustrate and validate the proposed approach.},
eventtitle = {{{IEEE Transactions}} on {{Industrial Informatics}}},
keywords = {automata,Automata,Biological system modeling,IEC 61131,IEC Standards,Informatics,model checking,Model checking,modeling,nuXmv,PLC,programmable logic controller (PLC),Software,verification},
file = {/home/danesabo/Zotero/storage/SQVUQS5B/Fernández Adiego et al. - 2015 - Applying Model Checking to Industrial-Sized PLC Pr.pdf;/home/danesabo/Zotero/storage/B6DJHWQY/7295624.html}
}
@article{ferranteSimpleProofRouth1999,
title = {A Simple Proof of the {{Routh}} Test},
author = {Ferrante, A. and Lepschy, A. and Viaro, U.},
date = {1999-06},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {44},
number = {6},
pages = {1306--1309},
issn = {1558-2523},
doi = {10.1109/9.769396},
url = {https://ieeexplore.ieee.org/abstract/document/769396?casa_token=qEO0cTxWiXAAAAAA:-BTm1YxP6pWOUaC6hv8pF3OOIYGiwL4YqOTO3Qu-9oylO5EN-gn2yeEu45EAC2uq7oxUP88JUA},
urldate = {2024-03-04},
abstract = {An elementary proof of the classic Routh method for counting the number of left half-plane and right half-plane zeros of a real coefficient polynomial P/sub n/(s) of degree n is given. Such a proof refers to the polynomials P/sub i/(s) of degree i/spl les/n formed from the entries of the rows of order i and i-1 of the relevant Routh array. In particular, it is based on the consideration of an auxiliary polynomial P/sub i/(s; q), linearly dependent on a real parameter q, which reduces to either polynomial P/sub i/(s) or to polynomial P/sub i-1/(s) for particular values of q. In this way, it is easy to show that i-1 zeroes of P/sub i/(s) lie in the same half-plane as the zeros of P/sub i/(s), and the remaining zero lies in the left or in the right half-plane according to the sign of the ratio of the leading coefficients of P/sub i/(s) and P/sub i-1/(s). By successively applying this property to all pairs of polynomials in the sequence, starting from P/sub o/(s) and P/sub 1/(s), the standard rule for determining the zero distribution of P/sub n/(s) is immediately derived.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
file = {/home/danesabo/Zotero/storage/YWCFSEZ9/Ferrante et al. - 1999 - A simple proof of the Routh test.pdf;/home/danesabo/Zotero/storage/7Y7K6BSP/769396.html}
}
@article{ferrariFormalMethodsRailways2022,
title = {Formal {{Methods}} in {{Railways}}: {{A Systematic Mapping Study}}},
shorttitle = {Formal {{Methods}} in {{Railways}}},
author = {Ferrari, Alessio and Beek, Maurice H. Ter},
date = {2022-11-21},
journaltitle = {ACM Comput. Surv.},
volume = {55},
number = {4},
pages = {69:1--69:37},
issn = {0360-0300},
doi = {10.1145/3520480},
url = {https://dl.acm.org/doi/10.1145/3520480},
urldate = {2025-03-31},
abstract = {Formal methods are mathematically based techniques for the rigorous development of software-intensive systems. The railway signaling domain is a field in which formal methods have traditionally been applied, with several success stories. This article reports on a mapping study that surveys the landscape of research on applications of formal methods to the development of railway systems. Following the guidelines of systematic reviews, we identify 328 relevant primary studies, and extract information about their demographics, the characteristics of formal methods used and railway-specific aspects. Our main results are as follows: (i)\&nbsp;we identify a total of 328 primary studies relevant to our scope published between 1989 and 2020, of which 44\% published during the last 5 years and 24\% involved industry; (ii)\&nbsp;the majority of studies are evaluated through Examples\&nbsp;(41\%) and Experience Reports\&nbsp;(38\%), while full-fledged Case Studies are limited\&nbsp;(1.5\%); (iii)\&nbsp;Model checking is the most commonly adopted technique\&nbsp;(47\%), followed by simulation\&nbsp;(27\%) and theorem proving\&nbsp;(19.5\%); (iv)\&nbsp;the dominant languages are UML\&nbsp;(18\%) and B\&nbsp;(15\%), while frequently used tools are ProB\&nbsp;(9\%), NuSMV\&nbsp;(8\%), and UPPAAL\&nbsp;(7\%); however, a diverse landscape of languages and tools is employed; (v)\&nbsp;the majority of systems are interlocking products\&nbsp;(40\%), followed by models of high-level control logic\&nbsp;(27\%); and (vi)\&nbsp;most of the studies focus on the Architecture\&nbsp;(66\%) and Detailed Design\&nbsp;(45\%) development phases. Based on these findings, we highlight current research gaps and expected actions. In particular, the need to focus on more empirically sound research methods, such as Case Studies and Controlled Experiments, and to lower the degree of abstraction, by applying formal methods and tools to development phases that are closer to software development. Our study contributes with an empirically based perspective on the future of research and practice in formal methods applications for railways. It can be used by formal methods researchers to better focus their scientific inquiries, and by railway practitioners for an improved understanding of the interplay between formal methods and their specific application domain.},
file = {/home/danesabo/Zotero/storage/M4ZFK54A/Ferrari and Beek - 2022 - Formal Methods in Railways A Systematic Mapping Study.pdf}
}
@article{fischerRemarksMeasureRisk2007,
title = {Remarks on “{{A}} Measure of Risk and a Decision-Making Model Based on Expected Utility and Entropy” by {{Jiping Yang}} and {{Wanhua Qiu}} ({{EJOR}} 164 (2005), 792–799)},
author = {Fischer, Kathrin and Kleine, Andreas},
date = {2007-10},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {182},
number = {1},
pages = {469--474},
issn = {03772217},
doi = {10.1016/j.ejor.2006.07.033},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221706007983},
urldate = {2024-01-26},
abstract = {Yang and Qiu [Yang, J., Qiu, W., 2005. A measure of risk and a decision-making model based on expected utility and entropy. European Journal of Operational Research 164, 792–799] suggest a new concept for decision making under risk. This concept relies on a combination of the well-known expected utility criterion and the so-called entropy. The authors claim that the approach might be used as a descriptive as well as a normative decision model.},
langid = {english},
file = {/home/danesabo/Zotero/storage/V38GBN9Y/Fischer and Kleine - 2007 - Remarks on “A measure of risk and a decision-makin.pdf}
}
@article{fisherHACMSProgramUsing2017,
title = {The {{HACMS}} Program: Using Formal Methods to Eliminate Exploitable Bugs},
shorttitle = {The {{HACMS}} Program},
author = {Fisher, Kathleen and Launchbury, John and Richards, Raymond},
date = {2017-10-13},
journaltitle = {Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences},
shortjournal = {Phil. Trans. R. Soc. A.},
volume = {375},
number = {2104},
pages = {20150401},
issn = {1364-503X, 1471-2962},
doi = {10.1098/rsta.2015.0401},
url = {https://royalsocietypublishing.org/doi/10.1098/rsta.2015.0401},
urldate = {2023-10-10},
abstract = {For decades, formal methods have offered the promise of verified software that does not have exploitable bugs. Until recently, however, it has not been possible to verify software of sufficient complexity to be useful. Recently, that situation has changed. SeL4 is an open-source operating system microkernel efficient enough to be used in a wide range of practical applications. Its designers proved it to be fully functionally correct, ensuring the absence of buffer overflows, null pointer exceptions, use-after-free errors, etc., and guaranteeing integrity and confidentiality. The CompCert Verifying C Compiler maps source C programs to provably equivalent assembly language, ensuring the absence of exploitable bugs in the compiler. A number of factors have enabled this revolution, including faster processors, increased automation, more extensive infrastructure, specialized logics and the decision to co-develop code and correctness proofs rather than verify existing artefacts. In this paper, we explore the promise and limitations of current formal-methods techniques. We discuss these issues in the context of DARPA’s HACMS program, which had as its goal the creation of high-assurance software for vehicles, including quadcopters, helicopters and automobiles. This article is part of the themed issue ‘Verified trustworthy software systems’.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JF5DILLS/Fisher et al. - 2017 - The HACMS program using formal methods to elimina.pdf}
}
@inproceedings{fitzgeraldCyberPhysicalSystemsDesign2015,
title = {Cyber-{{Physical Systems Design}}: {{Formal Foundations}}, {{Methods}} and {{Integrated Tool Chains}}},
shorttitle = {Cyber-{{Physical Systems Design}}},
booktitle = {2015 {{IEEE}}/{{ACM}} 3rd {{FME Workshop}} on {{Formal Methods}} in {{Software Engineering}}},
author = {Fitzgerald, John and Gamble, Carl and Larsen, Peter Gorm and Pierce, Kenneth and Woodcock, Jim},
date = {2015-05},
pages = {40--46},
publisher = {IEEE},
location = {Florence, Italy},
doi = {10.1109/FormaliSE.2015.14},
url = {http://ieeexplore.ieee.org/document/7166696/},
urldate = {2023-10-10},
abstract = {The engineering of dependable cyber-physical systems (CPSs) is inherently collaborative, demanding cooperation between diverse disciplines. A goal of current research is the development of integrated tool chains for model-based CPS design that support co-modelling, analysis, co-simulation, testing and implementation. We discuss the role of formal methods in addressing three key aspects of this goal: providing reasoning support for semantically heterogeneous models, managing the complexity and scale of design space exploration, and supporting traceability and provenance in the CPS design set. We briefly outline an approach to the development of such a tool chain based on existing tools and discuss ongoing challenges and open research questions in this area.},
eventtitle = {2015 {{IEEE}}/{{ACM}} 3rd {{FME Workshop}} on {{Formal Methods}} in {{Software Engineering}} ({{FormaliSE}})},
isbn = {978-1-4673-7043-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/FWTMMHFV/Fitzgerald et al. - 2015 - Cyber-Physical Systems Design Formal Foundations,.pdf}
}
@article{fleischhackerRelationshipEntropyDemand2015,
title = {On the Relationship between Entropy, Demand Uncertainty, and Expected Loss},
author = {Fleischhacker, Adam J. and Fok, Pak-Wing},
date = {2015-09},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {245},
number = {2},
pages = {623--628},
issn = {03772217},
doi = {10.1016/j.ejor.2015.03.014},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221715002076},
urldate = {2024-01-26},
abstract = {We analyze the effect of demand uncertainty, as measured by entropy, on expected costs in a stochastic inventory model. Existing models studying demand variability’s impact use either stochastic ordering techniques or use variance as a measure of uncertainty. Due to both axiomatic appeal and recent use of entropy in the operations management literature, this paper develops entropy’s use as a demand uncertainty measure. Our key contribution is an insightful proof quantifying how costs are non-increasing when entropy is reduced.},
langid = {english},
file = {/home/danesabo/Zotero/storage/VTLUY7XG/Fleischhacker and Fok - 2015 - On the relationship between entropy, demand uncert.pdf}
}
@article{foleyOperadsComplexSystem2021,
title = {Operads for Complex System Design Specification, Analysis and Synthesis},
author = {Foley, John D. and Breiner, Spencer and Subrahmanian, Eswaran and Dusel, John M.},
date = {2021-06-23},
journaltitle = {Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences},
volume = {477},
number = {2250},
pages = {20210099},
publisher = {Royal Society},
doi = {10.1098/rspa.2021.0099},
url = {https://royalsocietypublishing.org/doi/full/10.1098/rspa.2021.0099},
urldate = {2023-12-12},
abstract = {As the complexity and heterogeneity of a system grows, the challenge of specifying, documenting and synthesizing correct, machine-readable designs increases dramatically. Separation of the system into manageable parts is needed to support analysis at various levels of granularity so that the system is maintainable and adaptable over its life cycle. In this paper, we argue that operads provide an effective knowledge representation to address these challenges. Formal documentation of a syntactically correct design is built up during design synthesis, guided by semantic reasoning about design effectiveness. Throughout, the ability to decompose the system into parts and reconstitute the whole is maintained. We describe recent progress in effective modelling under this paradigm and directions for future work to systematically address scalability challenges for complex system design.},
keywords = {Important},
file = {/home/danesabo/Zotero/storage/TS9KYZJ6/Foley et al. - 2021 - Operads for complex system design specification, a.pdf}
}
@online{FormalMethods,
title = {Formal {{Methods}}},
url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/},
urldate = {2024-07-09}
}
@online{FormalMethodsa,
title = {Formal {{Methods}}},
url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/},
urldate = {2024-02-13},
file = {/home/danesabo/Zotero/storage/2ZSBFVTQ/formal_methods.html}
}
@online{FormalMethodsb,
title = {Formal {{Methods}}},
url = {https://users.ece.cmu.edu/~koopman/des_s99/formal_methods/#:~:text=Formal%20methods%20are%20techniques%20used,thorough%20fashion%20than%20empirical%20testing.},
organization = {Formal Methods}
}
@online{FormalMethodsSafetyCritical2023,
title = {Formal {{Methods}} for {{Safety-Critical Control}}},
date = {2023-10-26T12:11:26-04:00},
url = {https://lids.mit.edu/news-and-events/events/formal-methods-safety-critical-control},
urldate = {2024-07-09},
langid = {english},
organization = {MIT LIDS},
file = {/home/danesabo/Zotero/storage/38GH569T/formal-methods-safety-critical-control.html}
}
@unpublished{fradeCalculusInductiveConstructions2008,
title = {Calculus of {{Inductive Constructions}}: {{Software Formal Verification}}},
author = {Frade, Maria João},
date = {2008/2009},
url = {https://web.archive.org/web/20140529103535/http://www3.di.uminho.pt/~mjf/pub/SFV-CIC-2up.pdf},
urldate = {2024-02-22},
file = {/home/danesabo/Zotero/storage/IUHSL2GV/2014 - Wayback Machine.pdf}
}
@book{friedmanLittleTyper2018,
title = {The {{Little Typer}}},
author = {Friedman, Daniel P. and Christiansen, David Thrane},
date = {2018},
publisher = {MIT Press},
isbn = {0-262-35100-5}
}
@inproceedings{fultonKeYmaeraAxiomaticTactical2015,
title = {{{KeYmaera~X}}: {{An Axiomatic Tactical Theorem Prover}} for {{Hybrid Systems}}},
shorttitle = {{{KeYmaera~X}}},
booktitle = {Automated {{Deduction}} - {{CADE-25}}},
author = {Fulton, Nathan and Mitsch, Stefan and Quesel, Jan-David and Völp, Marcus and Platzer, André},
editor = {Felty, Amy P. and Middeldorp, Aart},
date = {2015},
pages = {527--538},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-21401-6_36},
abstract = {KeYmaera~X is a theorem prover for differential dynamic logic (), a logic for specifying and verifying properties of hybrid systems. Reasoning about complicated hybrid systems models requires support for sophisticated proof techniques, efficient computation, and a user interface that crystallizes salient properties of the system. KeYmaera~X allows users to specify custom proof search techniques as tactics, execute these tactics in parallel, and interface with partial proofs via an extensible user interface.},
isbn = {978-3-319-21401-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/948LBZVA/Fulton et al. - 2015 - KeYmaera X An Axiomatic Tactical Theorem Prover f.pdf}
}
@article{furrerSafeSecureSystem2023,
title = {Safe and Secure System Architectures for Cyber-Physical Systems},
author = {Furrer, Frank J.},
date = {2023-04},
journaltitle = {Informatik Spektrum},
shortjournal = {Informatik Spektrum},
volume = {46},
number = {2},
pages = {96--103},
issn = {0170-6012, 1432-122X},
doi = {10.1007/s00287-023-01533-z},
url = {https://link.springer.com/10.1007/s00287-023-01533-z},
urldate = {2023-11-08},
abstract = {Cyber-physical systems are at the core of our current civilization. Countless examples dominate our daily life and work, such as driverless cars that will soon master our roads, implanted medical devices that will improve many lives, and industrial control systems that control production and infrastructure. Because cyber-physical systems manipulate the real world, they constitute a danger for many applications. Therefore, their safety and security are essential properties of these indispensable systems. The long history of systems engineering has demonstrated that the system quality properties—such as safety and security—strongly depend on the underlying system architecture. Satisfactory system quality properties can only be ensured if the fundamental system architecture is sound! The development of dependable cyber-physical architectures in recent years suggests that two harmonical architectures are required: a design-time architecture and a run-time architecture. The design-time architecture defines and specifies all parts and relationships, assuring the required system quality properties. However, in today’s complex systems, ensuring all quality properties in all operating conditions during design time will never be possible. Therefore, an additional line of defense against safety accidents and security incidents is indispensable: This must be provided by the run-time architecture. The run-time architecture primarily consists of a protective shell that monitors the run-time system during operation. It detects anomalies in system behavior, interface functioning, or data—often using artificial intelligence algorithms—and takes autonomous mitigation measures, thus attempting to prevent imminent safety accidents or security incidents before they occur. This paper’s core is the protective shell as a run-time protection mechanism for cyber-physical systems. The paper has the form of an introductory tutorial and includes focused references.},
langid = {english},
file = {/home/danesabo/Zotero/storage/7MHXAPX6/Furrer - 2023 - Safe and secure system architectures for cyber-phy.pdf}
}
@inproceedings{gaborSimulationBasedArchitectureSmart2016,
title = {A {{Simulation-Based Architecture}} for {{Smart Cyber-Physical Systems}}},
booktitle = {2016 {{IEEE International Conference}} on {{Autonomic Computing}} ({{ICAC}})},
author = {Gabor, Thomas and Belzner, Lenz and Kiermeier, Marie and Beck, Michael Till and Neitz, Alexander},
date = {2016-07},
pages = {374--379},
publisher = {IEEE},
location = {Wuerzburg, Germany},
doi = {10.1109/ICAC.2016.29},
url = {http://ieeexplore.ieee.org/document/7573168/},
urldate = {2023-10-11},
abstract = {In order to accurately predict future states of a smart cyber-physical system, which can change its behavior to a large degree in response to environmental influences, the existence of precise models of the system and its surroundings is demandable. In machine engineering, ultra-high fidelity simulations have been developed to better understand both constraints in system design and possible consequences of external influences during the system’s operation. These digital twins enable further applications in software design for complex cyberphysical systems as online planning methods can utilize good simulations to continuously optimize the system behavior, yielding a software architecture framework based on the information flow between the cyber-physical system, its physical environment and the digital twin model.},
eventtitle = {2016 {{IEEE International Conference}} on {{Autonomic Computing}} ({{ICAC}})},
isbn = {978-1-5090-1654-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/KKRR6XCH/Gabor et al. - 2016 - A Simulation-Based Architecture for Smart Cyber-Ph.pdf}
}
@article{gallierConstructiveLogicsPart1993,
title = {Constructive Logics {{Part I}}: {{A}} Tutorial on Proof Systems and Typed λ-Calculi},
shorttitle = {Constructive Logics {{Part I}}},
author = {Gallier, Jean},
date = {1993-03-29},
journaltitle = {Theoretical Computer Science},
shortjournal = {Theoretical Computer Science},
volume = {110},
number = {2},
pages = {249--339},
issn = {0304-3975},
doi = {10.1016/0304-3975(93)90011-H},
url = {https://www.sciencedirect.com/science/article/pii/030439759390011H},
urldate = {2024-02-21},
abstract = {The purpose of this paper is to give an exposition of material dealing with constructive logics, typed λ-calculi, and linear logic. The emergence in the past ten years of a coherent field of research often named “logic and computation” has had two major (and related) effects: firstly, it has rocked vigorously the world of mathematical logic; secondly, it has created a new computer science discipline, which spans a range of subjects from what is traditionally called the theory of computation, to programming language design. Remarkably, this new body of work relies heavily on some “old” concepts found in mathematical logic, like natural deduction, sequent calculus, and λ-calculus (but often viewed in a different light), and also on some newer concepts. Thus, it may be quite a challenge to become initiated to this new body of work (but the situation is improving, and there are now some excellent texts on this subject matter). This paper attempts to provide a coherent and hopefully “gentle” initiation to this new body of work. We have attempted to cover the basic material on natural deduction, sequent calculus, and typed λ-calculus, but also to provide an introduction to Girard's linear logic, one of the most exciting developments in logic these past six years. The first part of these notes gives an exposition of the background material (with some exceptions, such as “contraction-free” systems for intuitionistic propositional logic and the Girard translation of classical logic into intuitionistic logic, which is new). The second part is devoted to more current topics such as linear logic, proof nets, the geometry of interaction, and unified systems of logic (LU).},
file = {/home/danesabo/Zotero/storage/92VUR955/030439759390011H.html}
}
@incollection{galvaoFormalVerificationFocused2019,
title = {Formal {{Verification}}: {{Focused}} on the {{Verification Using}} a {{Plant Model}}},
shorttitle = {Formal {{Verification}}},
booktitle = {Innovation, {{Engineering}} and {{Entrepreneurship}}},
author = {Galvão, Joel and Oliveira, Cedrico and Lopes, Helena and Tiainen, Laura},
editor = {Machado, José and Soares, Filomena and Veiga, Germano},
date = {2019},
volume = {505},
pages = {124--131},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-91334-6_18},
url = {http://link.springer.com/10.1007/978-3-319-91334-6_18},
urldate = {2023-10-10},
abstract = {The main goal of this paper is present a review and discussion about the option of using plant models in formal verification techniques. Relevant works in the field considering different approaches are reviewed and the importance of choosing the level of detail correctly is discussed. Although exists few works about this topic, the studies revealed the necessity and importance to consider the plant model in formal verification.},
isbn = {978-3-319-91333-9 978-3-319-91334-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/DY9V9YUI/Galvão et al. - 2019 - Formal Verification Focused on the Verification U.pdf}
}
@article{gaoCyberAttacksSignature2014,
title = {On {{Cyber Attacks}} and {{Signature Based Intrusion Detection}} for {{Modbus Based Industrial Control Systems}}},
author = {Gao, Wei and Morris, Thomas},
date = {2014-01-01},
journaltitle = {Journal of Digital Forensics, Security and Law},
volume = {9},
number = {1},
issn = {1558-7223},
doi = {10.15394/jdfsl.2014.1162},
url = {https://commons.erau.edu/jdfsl/vol9/iss1/3},
file = {/home/danesabo/Zotero/storage/YH7XVP5K/Gao and Morris - 2014 - On Cyber Attacks and Signature Based Intrusion Det.pdf;/home/danesabo/Zotero/storage/YX9PYKKB/3.html}
}
@online{gaoDeltaCompleteAnalysisBounded2014,
title = {Delta-{{Complete Analysis}} for {{Bounded Reachability}} of {{Hybrid Systems}}},
author = {Gao, Sicun and Kong, Soonho and Chen, Wei and Clarke, Edmund},
date = {2014-04-28},
eprint = {1404.7171},
eprinttype = {arXiv},
eprintclass = {cs},
url = {http://arxiv.org/abs/1404.7171},
urldate = {2023-11-02},
abstract = {We present the framework of δ-complete analysis for bounded reachability problems of general hybrid systems. We perform bounded reachability checking through solving δ-decision problems over the reals. The techniques take into account of robustness properties of the systems under numerical perturbations. We prove that the verification problems become much more mathematically tractable in this new framework. Our implementation of the techniques, an open-source tool dReach, scales well on several highly nonlinear hybrid system models that arise in biomedical and robotics applications.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/UY85DK5H/Gao et al. - 2014 - Delta-Complete Analysis for Bounded Reachability o.pdf}
}
@inproceedings{garciaHeyMyMalware2017,
title = {Hey, {{My Malware Knows Physics}}! {{Attacking PLCs}} with {{Physical Model Aware Rootkit}}.},
booktitle = {{{NDSS}}},
author = {Garcia, Luis and Brasser, Ferdinand and Cintuglu, Mehmet Hazar and Sadeghi, Ahmad-Reza and Mohammed, Osama A. and Zonouz, Saman A.},
date = {2017},
pages = {1--15},
file = {/home/danesabo/Zotero/storage/BMF5SJNX/Garcia et al. - 2017 - Hey, My Malware Knows Physics! Attacking PLCs with.pdf}
}
@inproceedings{garciaHyPLCHybridProgrammable2019,
title = {{{HyPLC}}: Hybrid Programmable Logic Controller Program Translation for Verification},
shorttitle = {{{HyPLC}}},
booktitle = {Proceedings of the 10th {{ACM}}/{{IEEE International Conference}} on {{Cyber-Physical Systems}}},
author = {Garcia, Luis and Mitsch, Stefan and Platzer, André},
date = {2019-04-16},
pages = {47--56},
publisher = {ACM},
location = {Montreal Quebec Canada},
doi = {10.1145/3302509.3311036},
url = {https://dl.acm.org/doi/10.1145/3302509.3311036},
urldate = {2023-10-10},
abstract = {Programmable Logic Controllers (PLCs) provide a prominent choice of implementation platform for safety-critical industrial control systems. Formal verification provides ways of establishing correctness guarantees, which can be quite important for such safety-critical applications. But since PLC code does not include an analytic model of the system plant, their verification is limited to discrete properties. In this paper, we, thus, start the other way around with hybrid programs that include continuous plant models in addition to discrete control algorithms. Correctness properties of hybrid programs can be formally verified in the theorem prover KeYmaera X that implements differential dynamic logic, dL, for hybrid programs. After verifying the hybrid program, we now present an approach for translating hybrid programs into PLC code. The new HyPLC tool implements this translation of discrete control code of verified hybrid program models to PLC controller code and, vice versa, the translation of existing PLC code into the discrete control actions for a hybrid program given an additional input of the continuous dynamics of the system to be verified. This approach allows for the generation of real controller code while preserving, by compilation, the correctness of a valid and verified hybrid program. PLCs are common cyber-physical interfaces for safety-critical industrial control applications, and HyPLC serves as a pragmatic tool for bridging formal verification of complex cyber-physical systems at the algorithmic level of hybrid programs with the execution layer of concrete PLC implementations.},
eventtitle = {{{ICCPS}} '19: {{ACM}}/{{IEEE}} 10th {{International Conference}} on {{Cyber-Physical Systems}}},
isbn = {978-1-4503-6285-6},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZI3JNAKD/Garcia et al. - 2019 - HyPLC hybrid programmable logic controller progra.pdf}
}
@report{garciaUSAREGULATORYEFFORTS,
title = {U.{{S}}.{{A}}. {{REGULATORY EFFORTS FOR CYBER SECURITY OF ADVANCED REACTORS}}},
author = {Garcia, I and Jauntirans, J and Rowland, M},
abstract = {Small Modular Reactors / Advanced Reactors (SMR/ARs) are expected to provide safe, secure, and economical power that have the potential to support initiatives aimed at combating climate change. Current proposed SMR/ARs involve diverse technologies that include next generation modular pressurized water reactors, high temperature gas cooled reactors, molten salt reactors, and liquid metal cooled fast reactors. These diverse technologies each have a unique set of functions and systems that support both nuclear safety and security. To address these challenges, the U.S. Nuclear Regulatory Commission (NRC) is moving toward a risk informed, performance based and technology-neutral regulation and associated regulatory guides. The U.S. NRC, supported by cyber security experts from DOE national laboratories and U.S. universities, has undertaken efforts to develop a regulatory guide (RG), to provide an advanced reactor licensee with an acceptable approach for meeting the requirements of the proposed cyber security rule for advanced reactors, 10 CFR 73.110, “Technology neutral requirements for protection of digital computer and communication systems and networks.” The RG aims to provide a process that accounts for the differing risk levels within advanced reactor technologies while providing reasonable assurance of adequate protection of public health and safety and promoting the common defense and security and protecting the environment. As such, a key RG outcome will be to provide the licensee with a risk-informed approach that would allow for the design and implementation of a cyber security program to meet demands for protection against the unacceptable consequences from a cyber attack. The RG is expected to leverage both the outcomes of the safety and security analyses performed for the associated reactor design.},
langid = {english},
file = {/home/danesabo/Zotero/storage/T8QH76S6/Garcia et al. - U.S.A. REGULATORY EFFORTS FOR CYBER SECURITY OF AD.pdf}
}
@online{GenerativeModelingEstimating,
title = {Generative {{Modeling}} by {{Estimating Gradients}} of the {{Data Distribution}} | {{Yang Song}}},
url = {https://yang-song.net/blog/2021/score/},
urldate = {2024-02-28},
file = {/home/danesabo/Zotero/storage/LXHEU3GU/score.html}
}
@incollection{gheorghiubobaruAutomatedAssumeGuaranteeReasoning2008,
title = {Automated {{Assume-Guarantee Reasoning}} by {{Abstraction Refinement}}},
booktitle = {Computer {{Aided Verification}}},
author = {Gheorghiu Bobaru, Mihaela and Păsăreanu, Corina S. and Giannakopoulou, Dimitra},
editor = {Gupta, Aarti and Malik, Sharad},
date = {2008},
volume = {5123},
pages = {135--148},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
issn = {0302-9743, 1611-3349},
doi = {10.1007/978-3-540-70545-1_14},
url = {http://link.springer.com/10.1007/978-3-540-70545-1_14},
urldate = {2023-10-10},
isbn = {978-3-540-70543-7 978-3-540-70545-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/ULHBRVL6/Gheorghiu Bobaru et al. - 2008 - Automated Assume-Guarantee Reasoning by Abstractio.pdf}
}
@article{gibouReviewLevelsetMethods2018,
title = {A Review of Level-Set Methods and Some Recent Applications},
author = {Gibou, Frederic and Fedkiw, Ronald and Osher, Stanley},
date = {2018-01-15},
journaltitle = {Journal of Computational Physics},
shortjournal = {Journal of Computational Physics},
volume = {353},
pages = {82--109},
issn = {0021-9991},
doi = {10.1016/j.jcp.2017.10.006},
url = {https://www.sciencedirect.com/science/article/pii/S0021999117307441},
urldate = {2023-10-27},
abstract = {We review some of the recent advances in level-set methods and their applications. In particular, we discuss how to impose boundary conditions at irregular domains and free boundaries, as well as the extension of level-set methods to adaptive Cartesian grids and parallel architectures. Illustrative applications are taken from the physical and life sciences. Fast sweeping methods are briefly discussed.},
file = {/home/danesabo/Zotero/storage/8M6R3PJ9/Gibou et al. - 2018 - A review of level-set methods and some recent appl.pdf;/home/danesabo/Zotero/storage/478XA3J7/S0021999117307441.html}
}
@inproceedings{girardInvariantSetsAssumeGuarantee2022,
title = {Invariant {{Sets}} for {{Assume-Guarantee Contracts}}},
booktitle = {2022 {{IEEE}} 61st {{Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
author = {Girard, Antoine and Iovine, Alessio and Benberkane, Sofiane},
date = {2022-12-06},
pages = {2190--2195},
publisher = {IEEE},
location = {Cancun, Mexico},
doi = {10.1109/CDC51059.2022.9993344},
url = {https://ieeexplore.ieee.org/document/9993344/},
urldate = {2023-11-08},
abstract = {Contract theory is a powerful tool to reason on systems that are interacting with an external environment, possibly made of other systems. Formally, a contract is usually given by assumptions and guarantees, which specify the expected behavior of the system (the guarantees) in a certain context (the assumptions). In this work, we present a verification framework for discrete-time dynamical systems with assume-guarantee contracts. We first introduce a class of assume-guarantee contracts with their satisfaction semantics parameterized by a time-horizon over which assumptions are evaluated. We then show that the problem of verifying whether such contracts are satisfied is equivalent to show the existence of a positive invariant set for an auxiliary system. This allows us to leverage the extensive literature on invariant set computation. A simple illustrative example is provided to show the effectiveness of our approach.},
eventtitle = {2022 {{IEEE}} 61st {{Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
isbn = {978-1-66546-761-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/MYCDQVDI/Girard et al. - 2022 - Invariant Sets for Assume-Guarantee Contracts.pdf}
}
@incollection{girardReachabilityUncertainLinear2005,
title = {Reachability of {{Uncertain Linear Systems Using Zonotopes}}},
booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
author = {Girard, Antoine},
editor = {Morari, Manfred and Thiele, Lothar},
editora = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Dough and Vardi, Moshe Y. and Weikum, Gerhard},
editoratype = {redactor},
date = {2005},
volume = {3414},
pages = {291--305},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-540-31954-2_19},
url = {http://link.springer.com/10.1007/978-3-540-31954-2_19},
urldate = {2023-11-01},
abstract = {We present a method for the computation of reachable sets of uncertain linear systems. The main innovation of the method consists in the use of zonotopes for reachable set representation. Zonotopes are special polytopes with several interesting properties : they can be encoded efficiently, they are closed under linear transformations and Minkowski sum. The resulting method has been used to treat several examples and has shown great performances for high dimensional systems. An extension of the method for the verification of piecewise linear hybrid systems is proposed.},
isbn = {978-3-540-25108-8 978-3-540-31954-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/DNBBFVL8/Girard - 2005 - Reachability of Uncertain Linear Systems Using Zon.pdf}
}
@article{giuaPetriNetsAutomatic2018,
title = {Petri Nets and {{Automatic Control}}: {{A}} Historical Perspective},
shorttitle = {Petri Nets and {{Automatic Control}}},
author = {Giua, Alessandro and Silva, Manuel},
date = {2018},
journaltitle = {Annual Reviews in Control},
shortjournal = {Annual Reviews in Control},
volume = {45},
pages = {223--239},
issn = {13675788},
doi = {10.1016/j.arcontrol.2018.04.006},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1367578818300117},
urldate = {2024-02-15},
abstract = {The goal of this paper is to overview the historical development of the field of Petri nets (PNs) from a Systems Theory and Automatic Control perspective. It is intentionally not meant to be comprehensive: we limit ourselves to outline, through selected representative topics, some of the conceptual issues studied in the literature. In a first part we retrace the emergence of some basic net concepts to provide a broad view of the family of PN formalisms. Then we focus, more specifically, on the use of Petri nets within Automatic Control. Discrete net models have been considered since the middle of the 70s and starting since the late 80s have also been used for addressing classical problems, such as supervisory and deadlock control, state estimation, diagnosis, and so on. The double benefit is the ability to model a larger class of systems and to provide efficient algorithms for solving certain of those problems. We also discuss new approaches based on continuous and hybrid nets, which have been developed within the Automatic Control community.},
langid = {english},
file = {/home/danesabo/Zotero/storage/Z5WCCXJA/Giua and Silva - 2018 - Petri nets and Automatic Control A historical per.pdf}
}
@article{giuaPetriNetStructural1994,
title = {Petri Net Structural Analysis for Supervisory Control},
author = {Giua, A. and DiCesare, F.},
date = {1994-04},
journaltitle = {IEEE Transactions on Robotics and Automation},
volume = {10},
number = {2},
pages = {185--195},
issn = {2374-958X},
doi = {10.1109/70.282543},
url = {https://ieeexplore.ieee.org/abstract/document/282543?casa_token=mzh0ebl2u50AAAAA:e0mDsVZJxEI2G7I8y5eafMtGOpvXPFp6AkObg96NMVS4NOMN4HyuBombfMXntRYtqHIz7b_SeQ},
urldate = {2024-02-15},
abstract = {The primary motivation for this research is to show how Petri nets may be efficiently used within the framework of supervisory control. In particular, the paper discusses how integer programming techniques for Petri net models may be used to validate supervisors for the control of discrete event systems. We consider a class of place/transition nets, called elementary composed state machines. The reachability problem for this class can be solved by a modification of classical incidence matrix analysis. In fact it is possible to derive a set of linear inequalities that exactly defines the set of reachable markings. Finally, we show how important properties of discrete event systems, such as the absence of blocking states or controllability, may be analyzed by integer programming techniques.{$<>$}},
eventtitle = {{{IEEE Transactions}} on {{Robotics}} and {{Automation}}},
file = {/home/danesabo/Zotero/storage/7WNHYMKP/Giua and DiCesare - 1994 - Petri net structural analysis for supervisory cont.pdf}
}
@article{giuaSystemsTheoryView,
title = {A {{Systems Theory View}} of {{Petri Nets}}},
author = {Giua, Alessandro and Seatzu, Carla},
abstract = {Petri nets are a family of powerful discrete event models whose interest has grown, within the automatic control community, in parallel with the development of the theory of discrete event systems. In this tutorial paper our goal is that of giving a flavor, by means of simple examples, of the features that make Petri nets a good model for systems theory and of pointing out at a few open areas for research. We focus on Place/Transitions nets, the simplest Petri net model. In particular we compare Petri nets with automata, and show that the former model has several advantages over the latter, not only because it is more general but also because it offers a better structure that has been used for developing computationally efficient algorithms for analysis and synthesis.},
langid = {english},
file = {/home/danesabo/Zotero/storage/K8MQSQ7D/Giua and Seatzu - A Systems Theory View of Petri Nets.pdf}
}
@inproceedings{glaessgenDigitalTwinParadigm2012,
title = {The {{Digital Twin Paradigm}} for {{Future NASA}} and {{U}}.{{S}}. {{Air Force Vehicles}}},
booktitle = {53rd {{AIAA}}/{{ASME}}/{{ASCE}}/{{AHS}}/{{ASC Structures}}, {{Structural Dynamics}} and {{Materials Conference}}\&lt;{{BR}}\&gt;20th {{AIAA}}/{{ASME}}/{{AHS Adaptive Structures Conference}}\&lt;{{BR}}\&gt;14th {{AIAA}}},
author = {Glaessgen, Edward and Stargel, David},
date = {2012-04-23},
publisher = {{American Institute of Aeronautics and Astronautics}},
location = {Honolulu, Hawaii},
doi = {10.2514/6.2012-1818},
url = {http://arc.aiaa.org/doi/abs/10.2514/6.2012-1818},
urldate = {2023-10-11},
eventtitle = {53rd {{AIAA}}/{{ASME}}/{{ASCE}}/{{AHS}}/{{ASC Structures}}, {{Structural Dynamics}} and {{Materials Conference}}{$<$}{{BR}}{$>$}20th {{AIAA}}/{{ASME}}/{{AHS Adaptive Structures Conference}}{$<$}{{BR}}{$>$}14th {{AIAA}}},
isbn = {978-1-60086-937-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/RFVZYEB9/Glaessgen and Stargel - 2012 - The Digital Twin Paradigm for Future NASA and U.S..pdf}
}
@online{golovnevBrakedownLineartimeFieldagnostic2021,
title = {Brakedown: {{Linear-time}} and Field-Agnostic {{SNARKs}} for {{R1CS}}},
shorttitle = {Brakedown},
author = {Golovnev, Alexander and Lee, Jonathan and Setty, Srinath and Thaler, Justin and Wahby, Riad S.},
date = {2021},
number = {2021/1043},
url = {https://eprint.iacr.org/2021/1043},
urldate = {2024-04-01},
abstract = {This paper introduces Brakedown, the first built system that provides linear-time SNARKs for NP, meaning the prover incurs O(N) finite field operations to prove the satisfiability of an N-sized R1CS instance. Brakedown’s prover is faster, both concretely and asymptotically, than prior SNARK implementations. Brakedown does not require a trusted setup and is plausibly post-quantum secure. Furthermore, it is compatible with arbitrary finite fields of sufficient size; this property is new amongst implemented arguments with sublinear proof sizes. To design Brakedown, we observe that recent work of Bootle, Chiesa, and Groth (BCG, TCC 2020) provides a polynomial commitment scheme that, when combined with the linear-time interactive proof system of Spartan (CRYPTO 2020), yields linear-time IOPs and SNARKs for R1CS (a similar theoretical result was previously established by BCG, but our approach is conceptually simpler, and crucial for achieving high-speed SNARKs). A core ingredient in the polynomial commitment scheme that we distill from BCG is a linear-time encodable code. Existing constructions of such codes are believed to be impractical. Nonetheless, we design and engineer a new one that is practical in our context. We also implement a variant of Brakedown that uses Reed-Solomon codes instead of our linear-time encodable codes; we refer to this variant as Shockwave. Shockwave is not a linear-time SNARK, but it provides shorter proofs and lower verification times than Brakedown (it also provides a faster prover than prior plausibly post-quantum SNARKs).},
pubstate = {prepublished},
annotation = {Publication info: A minor revision of an IACR publication in CRYPTO 2023},
file = {/home/danesabo/Zotero/storage/HLCP25RW/Golovnev et al. - 2021 - Brakedown Linear-time and field-agnostic SNARKs f.pdf}
}
@inproceedings{goncalvesFormalVerificationAADL2017,
title = {Formal {{Verification}} of {{AADL Models Using UPPAAL}}},
booktitle = {2017 {{VII Brazilian Symposium}} on {{Computing Systems Engineering}} ({{SBESC}})},
author = {Goncalves, Fernando Silvano and Pereira, David and Tovar, Eduardo and Becker, Leandro Buss},
date = {2017-11},
pages = {117--124},
publisher = {IEEE},
location = {Curitiba},
doi = {10.1109/SBESC.2017.22},
url = {http://ieeexplore.ieee.org/document/8116568/},
urldate = {2023-10-10},
abstract = {Cyber-Physical Systems (CPS) are known to be highly complex systems which can be applied to a variety of different environments, covering both civil and military application domains. As CPS are typically complex systems, its design process requires strong guarantees that the specified functional and nonfunctional properties are satisfied on the designed application. Model-Driven Engineering (MDE) and high-level specification languages are a valuable asset to help the design and evaluation of such complex systems. However, when looking at the existing MDE tool-support, it is observed that there is still little support for the automated integration of formal verification techniques in these tools. Given that formal verification is necessary to ensure the levels of reliability required by safety critical CPS, this paper presents an approach that aims to integrate the Model Checking technique in the CPS design process for the purpose of correctly analyzing temporal and safety characteristics. A tool named ECPS Verifier was designed to support the model checking integration into the design process, providing the generation of timed automata models from high-levels specifications in AADL. The proposed method is illustrated by means of the design of an Unmanned Aerial Vehicle, from where we derive the timed automata models to be analyzed in the UPPAAL tool.},
eventtitle = {2017 {{VII Brazilian Symposium}} on {{Computing Systems Engineering}} ({{SBESC}})},
isbn = {978-1-5386-3590-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/KHXC8GUZ/Goncalves et al. - 2017 - Formal Verification of AADL Models Using UPPAAL.pdf}
}
@thesis{gonthierSmallScaleReflection2016,
type = {report},
title = {A {{Small Scale Reflection Extension}} for the {{Coq}} System},
author = {Gonthier, Georges and Mahboubi, Assia and Tassi, Enrico},
date = {2016},
institution = {Inria Saclay Ile de France},
url = {https://inria.hal.science/inria-00258384},
urldate = {2024-03-18},
abstract = {This is the user manual of Ssreflect, a set of extensions to the proof scripting language of the Coq proof assistant. While these extensions were developed to support a particular proof methodology - small-scale reflection - most of them actually are of a quite general nature, improving the functionality of Coq in basic areas such as script layout and structuring, proof context management, and rewriting. Consequently, and in spite of the title of this document, most of the extensions described here should be of interest for all Coq users, whether they embrace small-scale reflection or not.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JX7Y48DY/Gonthier et al. - 2016 - A Small Scale Reflection Extension for the Coq sys.pdf}
}
@inproceedings{goubaultForwardInnerApproximatedReachability2017,
title = {Forward {{Inner-Approximated Reachability}} of {{Non-Linear Continuous Systems}}},
booktitle = {Proceedings of the 20th {{International Conference}} on {{Hybrid Systems}}: {{Computation}} and {{Control}}},
author = {Goubault, Eric and Putot, Sylvie},
date = {2017-04-13},
pages = {1--10},
publisher = {ACM},
location = {Pittsburgh Pennsylvania USA},
doi = {10.1145/3049797.3049811},
url = {https://dl.acm.org/doi/10.1145/3049797.3049811},
urldate = {2023-11-22},
eventtitle = {{{HSCC}} '17: 20th {{International Conference}} on {{Hybrid Systems}}: {{Computation}} and {{Control}}},
isbn = {978-1-4503-4590-3},
langid = {english}
}
@online{gouertArctyrEXAcceleratedEncrypted2023,
title = {{{ArctyrEX}} : {{Accelerated Encrypted Execution}} of {{General-Purpose Applications}}},
shorttitle = {{{ArctyrEX}}},
author = {Gouert, Charles and Joseph, Vinu and Dalton, Steven and Augonnet, Cedric and Garland, Michael and Tsoutsos, Nektarios Georgios},
date = {2023-06-19},
eprint = {2306.11006},
eprinttype = {arXiv},
eprintclass = {cs},
doi = {10.48550/arXiv.2306.11006},
url = {http://arxiv.org/abs/2306.11006},
urldate = {2023-12-06},
abstract = {Fully Homomorphic Encryption (FHE) is a cryptographic method that guarantees the privacy and security of user data during computation. FHE algorithms can perform unlimited arithmetic computations directly on encrypted data without decrypting it. Thus, even when processed by untrusted systems, confidential data is never exposed. In this work, we develop new techniques for accelerated encrypted execution and demonstrate the significant performance advantages of our approach. Our current focus is the Fully Homomorphic Encryption over the Torus (CGGI) scheme, which is a current state-of-the-art method for evaluating arbitrary functions in the encrypted domain. CGGI represents a computation as a graph of homomorphic logic gates and each individual bit of the plaintext is transformed into a polynomial in the encrypted domain. Arithmetic on such data becomes very expensive: operations on bits become operations on entire polynomials. Therefore, evaluating even relatively simple nonlinear functions, such as a sigmoid, can take thousands of seconds on a single CPU thread. Using our novel framework for end-to-end accelerated encrypted execution called ArctyrEX, developers with no knowledge of complex FHE libraries can simply describe their computation as a C program that is evaluated over \$40\textbackslash times\$ faster on an NVIDIA DGX A100 and \$6\textbackslash times\$ faster with a single A100 relative to a 256-threaded CPU baseline.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/IVZRPKSN/Gouert et al. - 2023 - ArctyrEX Accelerated Encrypted Execution of Gene.pdf;/home/danesabo/Zotero/storage/2NB92UVC/2306.html}
}
@online{GraduateCourseApplied,
title = {A {{Graduate Course}} in {{Applied Cryptography}}},
url = {https://toc.cryptobook.us/},
urldate = {2024-04-01},
file = {/home/danesabo/Zotero/storage/7TJMJH3J/toc.cryptobook.us.html}
}
@article{grandeAugmentedNeuralLyapunov2023,
title = {Augmented {{Neural Lyapunov Control}}},
author = {Grande, Davide and Peruffo, Andrea and Anderlini, Enrico and Salavasidis, Georgios},
date = {2023},
journaltitle = {IEEE Access},
volume = {11},
pages = {67979--67986},
issn = {2169-3536},
doi = {10.1109/ACCESS.2023.3291349},
url = {https://ieeexplore.ieee.org/document/10171339},
urldate = {2024-01-17},
abstract = {Machine learning-based methodologies have recently been adapted to solve control problems. The Neural Lyapunov Control (NLC) method is one such example. This approach combines Artificial Neural Networks (ANNs) with Satisfiability Modulo Theories (SMT) solvers to synthesise stabilising control laws and to prove their formal correctness. The ANNs are trained over a dataset of state-space samples to generate candidate control and Lyapunov functions, while the SMT solvers are tasked with certifying the correctness of the Lyapunov function over a continuous domain or by returning a counterexample. Despite the approach’s attractiveness, issues can occur due to subsequent calls of the SMT module at times returning similar counterexamples, which can turn out to be uninformative and may lead to dataset overfitting. Additionally, the control network weights are usually initialised with pre-computed gains from state-feedback controllers, e.g. Linear-Quadratic Regulators. To properly perform the initialisation requires user time and control expertise. In this work, we present an Augmented NLC method that mitigates these drawbacks, removes the need for the control initialisation and further improves counterexample generation. As a result, the proposed method allows the synthesis of nonlinear (as well as linear) control laws with the sole requirement being the knowledge of the system dynamics. The ANLC is tested over challenging benchmarks such as the Lorenz attractor and outperformed existing methods in terms of successful synthesis rate. The developed framework is released open-source at: https://github.com/grande-dev/Augmented-Neural-Lyapunov-Control.},
eventtitle = {{{IEEE Access}}},
file = {/home/danesabo/Zotero/storage/TMV4CJLY/Grande et al. - 2023 - Augmented Neural Lyapunov Control.pdf;/home/danesabo/Zotero/storage/N7RBAZGV/10171339.html}
}
@software{gratzerJozefgLearntt2024,
title = {Jozefg/Learn-Tt},
author = {{gratzer}, daniel},
date = {2024-01-21T08:30:44Z},
origdate = {2015-08-03T17:47:52Z},
url = {https://github.com/jozefg/learn-tt},
urldate = {2024-01-22},
abstract = {A collection of resources for learning type theory and type theory adjacent fields.}
}
@thesis{grobelnaGroblena_masterpdf2019,
type = {mathesis},
title = {Groblena\_master.Pdf},
author = {Grobelna, Marta},
date = {2019-09-16},
institution = {RWTH Aachen University},
file = {/home/danesabo/Zotero/storage/CZQDVPRN/groblena_master.pdf}
}
@article{grochowskiAlgorithmicTransparencyExplainability2021,
title = {Algorithmic Transparency and Explainability for {{EU}} Consumer Protection: Unwrapping the Regulatory Premises},
author = {Grochowski, Mateusz and Jablonowska, Agnieszka and Lagioia, Francesca and Sartor, Giovanni},
date = {2021},
journaltitle = {Critical Analysis L.},
volume = {8},
pages = {43},
publisher = {HeinOnline},
file = {/home/danesabo/Zotero/storage/5X97WYVF/storage:storage:Algorithmic Transparency and
Explainability for EU Consumer
Protection: Unwrapping the
Regulatory Premises.pdf}
}
@article{gronlundGronlundsWritingInstructional2009,
title = {Gronlund's Writing Instructional Objectives},
author = {Gronlund, Norman Edward and Brookhart, Susan M.},
date = {2009},
journaltitle = {(No Title)}
}
@report{grossApplicationModelbasedFault1997,
title = {Application of a Model-Based Fault Detection System to Nuclear Plant Signals},
author = {Gross, K. C. and Singer, R. M. and Wegerich, S. W. and Herzog, J. P. and VanAlstine, R. and Bockhorst, F.},
date = {1997},
institution = {Argonne National Lab.(ANL), Argonne, IL (United States)},
file = {/home/danesabo/Zotero/storage/IEXQ4VSQ/Application of a Model-based Fault Detection System to Nuclear Plant Signals .pdf}
}
@book{guckenheimerNonlinearOscillationsDynamical2013,
title = {Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields},
author = {Guckenheimer, John and Holmes, Philip},
date = {2013},
volume = {42},
publisher = {Springer Science \& Business Media},
isbn = {1-4612-1140-9}
}
@inproceedings{guFormalVerificationAutonomous2018,
title = {Formal Verification of an Autonomous Wheel Loader by Model Checking},
booktitle = {Proceedings of the 6th {{Conference}} on {{Formal Methods}} in {{Software Engineering}}},
author = {Gu, Rong and Marinescu, Raluca and Seceleanu, Cristina and Lundqvist, Kristina},
date = {2018-06-02},
pages = {74--83},
publisher = {ACM},
location = {Gothenburg Sweden},
doi = {10.1145/3193992.3193999},
url = {https://dl.acm.org/doi/10.1145/3193992.3193999},
urldate = {2023-10-10},
abstract = {In an attempt to increase productivity and the workers’ safety, the construction industry is moving towards autonomous construction sites, where various construction machines operate without human intervention. In order to perform their tasks autonomously, the machines are equipped with different features, such as position localization, human and obstacle detection, collision avoidance, etc. Such systems are safety critical, and should operate autonomously with very high dependability (e.g., by meeting task deadlines, avoiding (fatal) accidents at all costs, etc.). An Autonomous Wheel Loader is a machine that transports materials within the construction site without a human in the cab. To check the dependability of the loader, in this paper we provide a timed automata description of the vehicle’s control system, including the abstracted path planning and collision avoidance algorithms used to navigate the loader, and we model check the encoding in UPPAAL, against various functional, timing and safety requirements. The complex nature of the navigation algorithms makes the loader’s abstract modeling and the verification very challenging. Our work shows that exhaustive verification techniques can be applied early in the development of autonomous systems, to enable finding potential design errors that would incur increased costs if discovered later.},
eventtitle = {{{ICSE}} '18: 40th {{International Conference}} on {{Software Engineering}}},
isbn = {978-1-4503-5718-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/YQK398X2/Gu et al. - 2018 - Formal verification of an autonomous wheel loader .pdf}
}
@article{guoNewModelbasedApproach2014,
title = {A New Model-Based Approach for Power Plant {{Tube-ball}} Mill Condition Monitoring and Fault Detection},
author = {Guo, Shen and Wang, Jihong and Wei, Jianlin and Zachariades, Paschalis},
date = {2014-04},
journaltitle = {Energy Conversion and Management},
shortjournal = {Energy Conversion and Management},
volume = {80},
pages = {10--19},
issn = {01968904},
doi = {10.1016/j.enconman.2013.12.046},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0196890413008224},
urldate = {2023-10-11},
abstract = {With the fast growth in intermittent renewable power generation, unprecedented demands for power plant operation flexibility have posed new challenges to the ageing conventional power plants in the UK. Adding biomass to coal for co-fired power generation has become widely implemented practices in order to meet the emission regulation targets. These have impacted the coal mill and power plant operation safety and reliability. The Vertical Spindle mill model was developed through the authors’ work before 2007. From then, the new research progress has been made in modelling and condition monitoring for Tube-ball mills and is reported in the paper. A mathematical model for Tube-ball milling process is developed by applying engineering principles combined with model unknown parameter identifications using a computational intelligent algorithm. The model describes the whole milling process from the mill idle status, start-up to normal grinding and shut-down. The model is verified using on-site measurement data and on-line test. The on-line model is used for mill condition monitoring in two ways: (i) to compare the predicted and measured mill output pressure and temperatures and to raise alarms if there are big discrepancies; and (ii) to monitor the mill model parameter variation patterns which detect the potential faults and mill malfunctions.},
langid = {english},
file = {/home/danesabo/Zotero/storage/4HFL5VK6/Guo et al. - 2014 - A new model-based approach for power plant Tube-ba.pdf}
}
@article{hadiControlCOVID19System2021,
title = {Control of {{COVID-19}} System Using a Novel Nonlinear Robust Control Algorithm},
author = {Hadi, Musadaq A. and Ali, Hazem I.},
date = {2021-02},
journaltitle = {Biomedical Signal Processing and Control},
shortjournal = {Biomedical Signal Processing and Control},
volume = {64},
pages = {102317},
issn = {17468094},
doi = {10.1016/j.bspc.2020.102317},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1746809420304341},
urldate = {2024-05-20},
langid = {english},
file = {/home/danesabo/Zotero/storage/7EMIZIQ2/Hadi and Ali - 2021 - Control of COVID-19 system using a novel nonlinear.pdf}
}
@article{hahnAUTOMATEDCYBERSECURITY,
title = {{{AUTOMATED CYBER SECURITY TESTING PLATFORM FOR INDUSTRIAL CONTROL SYSTEMS}}},
author = {Hahn, Andrew and Sandoval, Daniel R and Fasano, Raymond E and Lamb, Christopher},
abstract = {Nuclear Power Plants (NPPs) are a complex system of coupled physics controlled by a network of Programmable Logic Controllers (PLCs). These PLCs communicate process data across the network to coordinate control actions with each other and inform the operators of process variables and control decisions. Networking the PLCs allows more effective process control and provides the operator more information which results in more efficient plant operation. This interconnectivity creates new security issues, as operators have more access to the plant controls, so will bad actors.},
langid = {english},
file = {/home/danesabo/Zotero/storage/TDEZJ6BC/Hahn et al. - AUTOMATED CYBER SECURITY TESTING PLATFORM FOR INDU.pdf}
}
@online{hahnSMARTTOT_Emulation_Data_BrokerMain,
title = {{{SMARTT}}/{{OT}}\_{{Emulation}}\_{{Data}}\_{{Broker}} at Main · Sandialabs/{{SMARTT}}},
author = {Hahn, A S},
url = {https://github.com/sandialabs/SMARTT/tree/main/OT_Emulation_Data_Broker},
urldate = {2024-08-14},
file = {/home/danesabo/Zotero/storage/8VEH9M4J/OT_Emulation_Data_Broker.html}
}
@article{hailesellasieIntrusionDetectionPLCBased2018,
title = {Intrusion {{Detection}} in {{PLC-Based Industrial Control Systems Using Formal Verification Approach}} in {{Conjunction}} with {{Graphs}}},
author = {Hailesellasie, Muluken and Hasan, Syed Rafay},
date = {2018-03},
journaltitle = {Journal of Hardware and Systems Security},
shortjournal = {J Hardw Syst Secur},
volume = {2},
number = {1},
pages = {1--14},
issn = {2509-3428, 2509-3436},
doi = {10.1007/s41635-017-0017-y},
url = {http://link.springer.com/10.1007/s41635-017-0017-y},
urldate = {2023-10-10},
langid = {english},
file = {/home/danesabo/Zotero/storage/M9EPIB2N/Hailesellasie and Hasan - 2018 - Intrusion Detection in PLC-Based Industrial Contro.pdf}
}
@online{hanDeepLinkEquating2023,
title = {The {{Deep Link Equating Math Proofs}} and {{Computer Programs}}},
author = {Han, Sheon},
date = {2023-10-11T14:30+00:00},
url = {https://www.quantamagazine.org/the-deep-link-equating-math-proofs-and-computer-programs-20231011/},
urldate = {2024-01-28},
abstract = {Mathematical logic and the code of computer programs are, in an exact way, mirror images of each other.}
}
@inproceedings{harrisonConstructingCloudBasedIDS2012,
title = {Constructing a {{Cloud-Based IDS}} by {{Merging VMI}} with {{FMA}}},
booktitle = {2012 {{IEEE}} 11th {{International Conference}} on {{Trust}}, {{Security}} and {{Privacy}} in {{Computing}} and {{Communications}}},
author = {Harrison, Christopher and Cook, Devin and McGraw, Robert and Hamilton Jr., John A.},
date = {2012-06},
pages = {163--169},
issn = {2324-9013},
doi = {10.1109/TrustCom.2012.113},
url = {https://ieeexplore.ieee.org/abstract/document/6295971?casa_token=QsolkvO1g_AAAAAA:SonsQYxySS_Sn65nJ2R6k1IBzNQXmsqWhnWG6fr47VkZIZaYD6nE6_UxBllmtLP7BEpHbIihP4E},
urldate = {2023-10-25},
abstract = {Cloud computing has emerged in recent years as a major segment of the IT industry; however, security concerns remain the primary impediment to full-scale adoption. Leveraging properties of virtualization, virtual machine introspection (VMI) has yielded promising research for cloud security yet adoption of these approaches in production environments remains minimal due to a semantic gap: the extraction of high-level knowledge of the guest operating system's state from low-level artifacts collected out-of-VM. Within the field of forensic memory analysis (FMA), a similar semantic gap exists from the reconstruction of physical memory dumps. We implement a production oriented prototype utilizing designs that combines and narrows these semantic gaps in a modular framework to function as an intrusion detection system (IDS) detecting and defeating post-exploitation activity.},
eventtitle = {2012 {{IEEE}} 11th {{International Conference}} on {{Trust}}, {{Security}} and {{Privacy}} in {{Computing}} and {{Communications}}},
file = {/home/danesabo/Zotero/storage/GTVZD7X7/Harrison et al. - 2012 - Constructing a Cloud-Based IDS by Merging VMI with.pdf;/home/danesabo/Zotero/storage/VTB449XC/6295971.html}
}
@online{hartnettHackerProofCodeConfirmed2016,
title = {Hacker-{{Proof Code Confirmed}}},
author = {Hartnett, Kevin},
date = {2016-09-20T16:06+00:00},
url = {https://www.quantamagazine.org/formal-verification-creates-hacker-proof-code-20160920/},
urldate = {2024-01-28},
abstract = {Computer scientists can prove certain programs to be error-free with the same certainty that mathematicians prove theorems.}
}
@inproceedings{hartonas-garmhausenAutomaticVerificationIndustrial1995,
title = {Automatic Verification of Industrial Designs},
booktitle = {Proceedings of 1995 {{IEEE Workshop}} on {{Industrial-Strength Formal Specification Techniques}}},
author = {Hartonas-Garmhausen, V. and Kurfess, T. and Clarke, E.M. and Long, D.},
date = {1995},
pages = {88--96},
publisher = {IEEE Comput. Soc. Press},
location = {Boca Raton, FL, USA},
doi = {10.1109/WIFT.1995.515481},
url = {http://ieeexplore.ieee.org/document/515481/},
urldate = {2023-11-08},
eventtitle = {1995 {{IEEE Workshop}} on {{Industrial-Strength Formal Specification Techniques}}},
isbn = {978-0-8186-7005-3}
}
@inproceedings{haspalamutgilAdaptiveSwitchingMethod2017,
title = {Adaptive Switching Method for {{Adaptive Cruise Control}}},
booktitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
author = {Haspalamutgıl, Kadir and Adali, Erkan},
date = {2017-10},
pages = {140--145},
doi = {10.1109/ICSTCC.2017.8107024},
url = {https://ieeexplore.ieee.org/abstract/document/8107024?casa_token=GCbUxFFrhDUAAAAA:JfMiJhBzXxVfq4N_RsCHdnGSyMHKux4ZovytCx9BfEycz4bQe5BvdfZQcq9syGy3lVpk28NV2Q},
urldate = {2023-11-20},
abstract = {We present an Adaptive Cruise Control (ACC) architecture which is focused on solving repetitive switching issues between two modes of ACC, speed control and distance control. A cascaded controller structure has been used. First controller (upper) includes two modes: a speed controller (PI) and a distance controller (time-gap). Outputs of these controllers are acceleration reference signals. The second controller (lower) is responsible of providing the desired acceleration by controlling throttle. The switching problem occurs in most algorithms between two modes of the upper controller. In the proposed method, additional to the normal switching logic which is checking the distance with the leading vehicle, a set of logical comparisons have been used to prevent repetitive mode changing at the exact desired distance.},
eventtitle = {2017 21st {{International Conference}} on {{System Theory}}, {{Control}} and {{Computing}} ({{ICSTCC}})},
file = {/home/danesabo/Zotero/storage/CN2BHTK4/Haspalamutgıl and Adali - 2017 - Adaptive switching method for Adaptive Cruise Cont.pdf;/home/danesabo/Zotero/storage/349JHJEW/8107024.html}
}
@article{hatcherListRecommendedBooks,
title = {A {{List}} of {{Recommended Books}} in {{Topology}}},
author = {Hatcher, Allen},
langid = {english},
file = {/home/danesabo/Zotero/storage/58724NMS/Hatcher - A List of Recommended Books in Topology.pdf}
}
@article{hauksdottirProvingRouthsTheorem2020,
title = {Proving {{Routh}}’s {{Theorem}} Using the {{Euclidean Algorithm}} and {{Cauchy}}’s {{Theorem}}⁎},
author = {Hauksdóttir, Anna Soffía and Sigurðsson, Sven Þ.},
date = {2020-01-01},
journaltitle = {IFAC-PapersOnLine},
shortjournal = {IFAC-PapersOnLine},
series = {21st {{IFAC World Congress}}},
volume = {53},
number = {2},
pages = {4460--4467},
issn = {2405-8963},
doi = {10.1016/j.ifacol.2020.12.446},
url = {https://www.sciencedirect.com/science/article/pii/S2405896320307370},
urldate = {2024-03-04},
abstract = {This paper presents a proof of Routh’s theorem for polynomials with real coefficients, determining the number of roots in the right half plane (RHP). The proof exploits the relationship of the Routh array to the Euclidean algorithm and applies Cauchy’s theorem in an analogous way to that of applying the Nyquist criterion to investigate the stability of a control system. While a number of papers have been published over the years with different proofs of Routh’s stability criterion or Routh’s theorem, the aim in this paper is to present a proof that may offer most insight to undergraduate students of engineering. Routh’s theorem and his array are introduced without any proof in most undergraduate texts on control theory, whereas the Nyquist criterion is typically treated quite extensively in such texts. As well as presenting a proof for the regular case when all the coefficients in the first column of the Routh array are non-zero, analogous proofs are given for the singular cases when some of the leading coefficients in a row, or the coefficients of the entire row, become zero. In the first case, these result in a statement on the number of roots in the RHP, more explicit than those typically presented in papers on Routh’s theorem. In the second case, the only case where there may be roots on the imaginary axis, use is made of the modified array introduced by Routh, often referred to as the Q-method, to determine the number of such roots, differentiating between simple and multiple roots. One can thus distinguish between exponential stability, marginal stability and polynomial instability, when there are no roots in the RHP, with these results.},
file = {/home/danesabo/Zotero/storage/M97ZF4UF/S2405896320307370.html}
}
@article{heDatadrivenDigitalTwin2019,
title = {Data-Driven Digital Twin Technology for Optimized Control in Process Systems},
author = {He, Rui and Chen, Guoming and Dong, Che and Sun, Shufeng and Shen, Xiaoyu},
date = {2019-12},
journaltitle = {ISA Transactions},
shortjournal = {ISA Transactions},
volume = {95},
pages = {221--234},
issn = {00190578},
doi = {10.1016/j.isatra.2019.05.011},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0019057819302332},
urldate = {2023-10-11},
abstract = {Due to the installation of various apparatus in process industries, both factors of complex structures and severe operating conditions could result in higher accident frequencies and maintenance challenges. Given the importance of security in process systems, this paper presents a data-driven digital twin system for automatic process applications by integrating virtual modeling, process monitoring, diagnosis, and optimized control into a cooperative architecture. For unknown model parameters, the adaptive system identification is proposed to model closed-loop virtual systems and residual signals with fault-free case data. Performance indices are improved to make the design of robust monitoring and diagnosis system to identify the apparatus status. Soft-sensor, parameterization control, and model-matching reconfiguration are ameliorated and incorporated into the optimized control configuration to guarantee stable and safe control performance under apparatus faults. The effectiveness and performance of the proposed digital twin system are evaluated by using different simulations on the Tennessee Eastman benchmark process in the presence of realistic fault scenarios. © 2019 Published by Elsevier Ltd on behalf of ISA.},
langid = {english},
file = {/home/danesabo/Zotero/storage/9WU6QA6X/He et al. - 2019 - Data-driven digital twin technology for optimized .pdf}
}
@book{hehenbergerMechatronicFutures2016,
title = {Mechatronic {{Futures}}},
editor = {Hehenberger, Peter and Bradley, David},
date = {2016},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-32156-1},
url = {http://link.springer.com/10.1007/978-3-319-32156-1},
urldate = {2023-10-11},
isbn = {978-3-319-32154-7 978-3-319-32156-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/Z9VARVAQ/Hehenberger and Bradley - 2016 - Mechatronic Futures.pdf}
}
@article{heiserSeL4MicrokernelIntroduction,
title = {The {{seL4 Microkernel}} – {{An Introduction}}},
author = {Heiser, Gernot},
langid = {english},
file = {/home/danesabo/Zotero/storage/4YPNWHUT/Heiser - The seL4 Microkernel – An Introduction.pdf}
}
@inproceedings{herencia-zapanaPVSLinearAlgebra2012,
title = {{{PVS Linear Algebra Libraries}} for {{Verification}} of {{Control Software Algorithms}} in {{C}}/{{ACSL}}},
booktitle = {{{NASA Formal Methods}}},
author = {Herencia-Zapana, Heber and Jobredeaux, Romain and Owre, Sam and Garoche, Pierre-Loïc and Feron, Eric and Perez, Gilberto and Ascariz, Pablo},
editor = {Goodloe, Alwyn E. and Person, Suzette},
date = {2012},
pages = {147--161},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-28891-3_15},
abstract = {The problem of ensuring control software properties hold on their actual implementation is rarely tackled. While stability proofs are widely used on models, they are never carried to the code. Using program verification techniques requires express these properties at the level of the code but also to have theorem provers that can manipulate the proof elements. We propose to address this challenge by following two phases: first we introduce a way to express stability proofs as C code annotations; second, we propose a PVS linear algebra library that is able to manipulate quadratic invariants, i.e., ellipsoids. Our framework achieves the translation of stability properties expressed on the code to the representation of an associated proof obligation (PO) in PVS. Our library allows us to discharge these POs within PVS.},
isbn = {978-3-642-28891-3},
langid = {english},
keywords = {Important},
file = {/home/danesabo/Zotero/storage/X93GMM59/Herencia-Zapana et al. - 2012 - PVS Linear Algebra Libraries for Verification of C.pdf}
}
@inproceedings{herlockerExplainingCollaborativeFiltering2000,
title = {Explaining Collaborative Filtering Recommendations},
booktitle = {Proceedings of the 2000 {{ACM}} Conference on {{Computer}} Supported Cooperative Work},
author = {Herlocker, Jonathan L. and Konstan, Joseph A. and Riedl, John},
date = {2000-12},
pages = {241--250},
publisher = {ACM},
location = {Philadelphia Pennsylvania USA},
doi = {10.1145/358916.358995},
url = {https://dl.acm.org/doi/10.1145/358916.358995},
urldate = {2023-10-11},
abstract = {Automated collaborative filtering (ACF) systems predict a person’s affinity for items or information by connecting that person’s recorded interests with the recorded interests of a community of people and sharing ratings between likeminded persons. However, current recommender systems are black boxes, providing no transparency into the working of the recommendation. Explanations provide that transparency, exposing the reasoning and data behind a recommendation. In this paper, we address explanation interfaces for ACF systems – how they should be implemented and why they should be implemented. To explore how, we present a model for explanations based on the user’s conceptual model of the recommendation process. We then present experimental results demonstrating what components of an explanation are the most compelling. To address why, we present experimental evidence that shows that providing explanations can improve the acceptance of ACF systems. We also describe some initial explorations into measuring how explanations can improve the filtering performance of users.},
eventtitle = {{{CSCW00}}: {{Computer Supported Cooperative Work}}},
isbn = {978-1-58113-222-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/LW84M7GS/Herlocker et al. - 2000 - Explaining collaborative filtering recommendations.pdf}
}
@article{hermansaSensorBasedPredictiveMaintenance2021,
title = {Sensor-{{Based Predictive Maintenance}} with {{Reduction}} of {{False Alarms}}—{{A Case Study}} in {{Heavy Industry}}},
author = {Hermansa, Marek and Kozielski, Michał and Michalak, Marcin and Szczyrba, Krzysztof and Wróbel, Łukasz and Sikora, Marek},
date = {2021-12-29},
journaltitle = {Sensors},
shortjournal = {Sensors},
volume = {22},
number = {1},
pages = {226},
issn = {1424-8220},
doi = {10.3390/s22010226},
url = {https://www.mdpi.com/1424-8220/22/1/226},
urldate = {2023-10-11},
abstract = {In this paper, the problem of the identification of undesirable events is discussed. Such events can be poorly represented in the historical data, and it is predominantly impossible to learn from past examples. The discussed issue is considered in the work in the context of two use cases in which vibration and temperature measurements collected by wireless sensors are analysed. These use cases include crushers at a coal-fired power plant and gantries in a steelworks converter. The awareness, resulting from the cooperation with industry, of the need for a system that works in cold start conditions and does not flood the machine operator with alarms was the motivation for proposing a new predictive maintenance method. The proposed solution is based on the methods of outlier identification. These methods are applied to the collected data that was transformed into a multidimensional feature vector. The novelty of the proposed solution stems from the creation of a methodology for the reduction of false positive alarms, which was applied to a system identifying undesirable events. This methodology is based on the adaptation of the system to the analysed data, the interaction with the dispatcher, and the use of the XAI (eXplainable Artificial Intelligence) method. The experiments performed on several data sets showed that the proposed method reduced false alarms by 90.25\% on average in relation to the performance of the stand-alone outlier detection method. The obtained results allowed for the implementation of the developed method to a system operating in a real industrial facility. The conducted research may be valuable for systems with a cold start problem where frequent alarms can lead to discouragement and disregard for the system by the user.},
langid = {english},
file = {/home/danesabo/Zotero/storage/C475KNYD/Hermansa et al. - 2021 - Sensor-Based Predictive Maintenance with Reduction.pdf}
}
@article{hespanhaHybridControlSwitched,
title = {Hybrid {{Control}} and {{Switched Systems}}},
author = {Hespanha, João P},
langid = {english},
file = {/home/danesabo/Zotero/storage/XAEA8D7P/Hespanha - Hybrid Control and Switched Systems.pdf}
}
@inproceedings{heunenConvenientCategoryHigherOrder2017,
title = {A {{Convenient Category}} for {{Higher-Order Probability Theory}}},
booktitle = {2017 32nd {{Annual ACM}}/{{IEEE Symposium}} on {{Logic}} in {{Computer Science}} ({{LICS}})},
author = {Heunen, Chris and Kammar, Ohad and Staton, Sam and Yang, Hongseok},
date = {2017-06},
eprint = {1701.02547},
eprinttype = {arXiv},
eprintclass = {cs, math},
pages = {1--12},
doi = {10.1109/LICS.2017.8005137},
url = {http://arxiv.org/abs/1701.02547},
urldate = {2024-04-21},
abstract = {Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory. Programs may use both higher-order functions and continuous distributions, or even define a probability distribution on functions. But standard probability theory does not handle higher-order functions well: the category of measurable spaces is not cartesian closed. Here we introduce quasi-Borel spaces. We show that these spaces: form a new formalization of probability theory replacing measurable spaces; form a cartesian closed category and so support higher-order functions; form a well-pointed category and so support good proof principles for equational reasoning; and support continuous probability distributions. We demonstrate the use of quasi-Borel spaces for higher-order functions and probability by: showing that a well-known construction of probability theory involving random functions gains a cleaner expression; and generalizing de Finetti's theorem, that is a crucial theorem in probability theory, to quasi-Borel spaces.},
file = {/home/danesabo/Zotero/storage/2YZFDBEG/Heunen et al. - 2017 - A Convenient Category for Higher-Order Probability.pdf;/home/danesabo/Zotero/storage/2LH7WEX8/1701.html}
}
@incollection{hincheyIntroductionFormalMethods2006,
title = {Introduction to {{Formal Methods}}},
booktitle = {Agent {{Technology}} from a {{Formal Perspective}}},
author = {Hinchey, Michael and Bowen, Jonathan P. and Rouff, Christopher A.},
editor = {Rouff, Christopher A. and Hinchey, Michael and Rash, James and Truszkowski, Walter and Gordon-Spears, Diana},
date = {2006},
pages = {25--64},
publisher = {Springer-Verlag},
location = {London},
doi = {10.1007/1-84628-271-3_2},
url = {http://link.springer.com/10.1007/1-84628-271-3_2},
urldate = {2024-07-09},
isbn = {978-1-85233-947-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/894UYUYD/Hinchey et al. - 2006 - Introduction to Formal Methods.pdf}
}
@book{hindleyLambdacalculusCombinatorsIntroduction2008,
title = {Lambda-Calculus and Combinators: An Introduction},
author = {Hindley, J. Roger and Seldin, Jonathan P.},
date = {2008},
publisher = {Cambridge University Press},
isbn = {1-139-47324-7}
}
@inreference{HoareLogic2023,
title = {Hoare Logic},
booktitle = {Wikipedia},
date = {2023-11-08T17:12:08Z},
url = {https://en.wikipedia.org/w/index.php?title=Hoare_logic&oldid=1184150662},
urldate = {2024-01-28},
abstract = {Hoare logic (also known as Floyd–Hoare logic or Hoare rules) is a formal system with a set of logical rules for reasoning rigorously about the correctness of computer programs. It was proposed in 1969 by the British computer scientist and logician Tony Hoare, and subsequently refined by Hoare and other researchers. The original ideas were seeded by the work of Robert W. Floyd, who had published a similar system for flowcharts.},
annotation = {Page Version ID: 1184150662}
}
@article{hoElementaryDerivationRouthHurwitz1998,
title = {An Elementary Derivation of the {{Routh-Hurwitz}} Criterion},
author = {Ho, Ming-Tzu and Datta, A. and Bhattacharyya, S.P.},
date = {1998-03},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {43},
number = {3},
pages = {405--409},
issn = {1558-2523},
doi = {10.1109/9.661607},
url = {https://ieeexplore.ieee.org/abstract/document/661607?casa_token=_ZTBBI78ASQAAAAA:bq5jusXOvFviT0kmkuMYTAYJQ0uAqdkmDTMjnEo03Q7KVhhp7azmgSqzIFK2r5bTMuIQNTTifg},
urldate = {2024-03-04},
abstract = {In most undergraduate texts on control systems, the Routh-Hurwitz criterion is usually introduced as a mechanical algorithm for determining the Hurwitz stability of a real polynomial. Unlike many other stability criteria, such as the Nyquist criterion, root locus, etc., no attempt whatsoever is made to even allude to a proof of the Routh-Hurwitz criterion. Recent results using the Hermite-Biehler theorem have, however, succeeded in providing a simple derivation of Routh's algorithm for determining the Hurwitz stability or otherwise of a given real polynomial. However, this derivation fails to capture the fact that Routh's algorithm can also be used to count the number of open right half-plane roots of a given polynomial. This paper shows that by using appropriately generalized versions of the Hermite-Biehler theorem, it is possible to provide a simple derivation of the Routh-Hurwitz criterion which also captures its unstable root counting capability.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
file = {/home/danesabo/Zotero/storage/LXDFETQM/Ho et al. - 1998 - An elementary derivation of the Routh-Hurwitz crit.pdf;/home/danesabo/Zotero/storage/2NANUARD/661607.html}
}
@book{hristu-varsakelisHandbookNetworkedEmbedded2005,
title = {Handbook of Networked and Embedded Control Systems},
author = {Hristu-Varsakelis, Dimitrios and Levine, William S.},
date = {2005},
series = {Control Engineering},
publisher = {Birkhäuser},
location = {Boston},
isbn = {978-0-8176-3239-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/482BIYI7/Hristu-Varsakelis and Levine - 2005 - Handbook of networked and embedded control systems.pdf}
}
@book{hsuCelltocellMappingMethod2013,
title = {Cell-to-Cell Mapping: A Method of Global Analysis for Nonlinear Systems},
author = {Hsu, Chieh Su},
date = {2013},
volume = {64},
publisher = {Springer Science \& Business Media},
isbn = {1-4757-3892-7}
}
@online{HttpsEnergysandiagovWpcontent,
title = {{{https://energy.sandia.gov/wp-content/uploads/2024/01/Maccarone\_DCSA-FY23-M2.pdf}}},
url = {https://energy.sandia.gov/wp-content/uploads/2024/01/Maccarone_DCSA-FY23-M2.pdf},
urldate = {2024-08-08}
}
@online{HttpsWwwwhitehousegovWpcontent,
title = {{{https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf}}},
url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
urldate = {2024-08-14}
}
@online{HttpsWwwwhitehousegovWpcontenta,
title = {{{https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf}}},
url = {https://www.whitehouse.gov/wp-content/uploads/2024/02/Final-ONCD-Technical-Report.pdf},
urldate = {2024-08-14}
}
@article{huangFuzzyModelPredictive2000,
title = {Fuzzy Model Predictive Control},
author = {Huang, Y.L. and Lou, H.H. and Gong, J.P. and Edgar, T.F.},
date = {2000-12},
journaltitle = {IEEE Transactions on Fuzzy Systems},
volume = {8},
number = {6},
pages = {665--678},
issn = {1941-0034},
doi = {10.1109/91.890326},
url = {https://ieeexplore.ieee.org/abstract/document/890326},
urldate = {2024-07-10},
abstract = {A fuzzy model predictive control (FMPC) approach is introduced to design a control system for a highly nonlinear process. In this approach, a process system is described by a fuzzy convolution model that consists of a number of quasi-linear fuzzy implications. In controller design, prediction errors and control energy are minimized through a two-layered iterative optimization process. At the lower layer, optimal local control policies are identified to minimize prediction errors in each subsystem. A near optimum is then identified through coordinating the subsystems to reach an overall minimum prediction error at the upper layer. The two-layered computing scheme avoids extensive online nonlinear optimization and permits the design of a controller based on linear control theory. The efficacy of the FMPC approach is demonstrated through three examples.},
eventtitle = {{{IEEE Transactions}} on {{Fuzzy Systems}}},
keywords = {Control system synthesis,Convolution,Design optimization,Error correction,Fuzzy control,Fuzzy systems,Nonlinear control systems,Optimal control,Predictive control,Predictive models},
file = {/home/danesabo/Zotero/storage/VGID38NW/Huang et al. - 2000 - Fuzzy model predictive control.pdf}
}
@article{hudakOverviewAADLToolsets2021,
title = {An {{Overview}} of {{AADL}} and {{Toolsets}} to {{Support}} the {{Engineering}} of {{Safety-critical Systems}}},
author = {Hudak, John and Hugues, Jerome},
date = {2021},
langid = {english},
file = {/home/danesabo/Zotero/storage/I5QBFXMS/Hudak and Hugues - 2021 - An Overview of AADL and Toolsets to Support the En.pdf}
}
@misc{huetInductionPrinciplesFormalized2015,
title = {Induction {{Principles Formalized}} in the {{Calculus}} of {{Constructions}}},
author = {Huet, Gérard},
date = {2015-07-01},
url = {https://web.archive.org/web/20150701130220/http://yquem.inria.fr/~huet/PUBLIC/induction.pdf},
urldate = {2024-02-22},
file = {/home/danesabo/Zotero/storage/AZYNMTNW/2015 - Wayback Machine.pdf}
}
@book{huetLogicalFoundationsFunctional1990,
title = {Logical Foundations of Functional Programming},
author = {family=Huet, given=Gérard., given-i={{Gérard}}},
date = {1990},
series = {The {{UT}} Year of Programming Series},
publisher = {Addison-Wesley},
location = {Reading, Mass},
isbn = {0-201-17234-8},
keywords = {Functional programming (Computer science)}
}
@article{humayedCyberPhysicalSystemsSecurity2017,
title = {Cyber-{{Physical Systems Security}}—{{A Survey}}},
author = {Humayed, Abdulmalik and Lin, Jingqiang and Li, Fengjun and Luo, Bo},
date = {2017-12},
journaltitle = {IEEE Internet of Things Journal},
shortjournal = {IEEE Internet Things J.},
volume = {4},
number = {6},
pages = {1802--1831},
issn = {2327-4662},
doi = {10.1109/JIOT.2017.2703172},
url = {http://ieeexplore.ieee.org/document/7924372/},
urldate = {2023-10-11},
abstract = {With the exponential growth of cyber-physical systems (CPSs), new security challenges have emerged. Various vulnerabilities, threats, attacks, and controls have been introduced for the new generation of CPS. However, there lacks a systematic review of the CPS security literature. In particular, the heterogeneity of CPS components and the diversity of CPS systems have made it difficult to study the problem with one generalized model. In this paper, we study and systematize existing research on CPS security under a unified framework. The framework consists of three orthogonal coordinates: 1) from the security perspective, we follow the well-known taxonomy of threats, vulnerabilities, attacks and controls; 2) from the CPS components perspective, we focus on cyber, physical, and cyberphysical components; and 3) from the CPS systems perspective, we explore general CPS features as well as representative systems (e.g., smart grids, medical CPS, and smart cars). The model can be both abstract to show general interactions of components in a CPS application, and specific to capture any details when needed. By doing so, we aim to build a model that is abstract enough to be applicable to various heterogeneous CPS applications; and to gain a modular view of the tightly coupled CPS components. Such abstract decoupling makes it possible to gain a systematic understanding of CPS security, and to highlight the potential sources of attacks and ways of protection. With this intensive literature review, we attempt to summarize the state-of-the-art on CPS security, provide researchers with a comprehensive list of references, and also encourage the audience to further explore this emerging field.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DBK4L5AG/Humayed et al. - 2017 - Cyber-Physical Systems Security—A Survey.pdf}
}
@article{hwangESFDExplainableSensor2021,
title = {E-{{SFD}}: {{Explainable Sensor Fault Detection}} in the {{ICS Anomaly Detection System}}},
shorttitle = {E-{{SFD}}},
author = {Hwang, Chanwoong and Lee, Taejin},
date = {2021},
journaltitle = {IEEE Access},
shortjournal = {IEEE Access},
volume = {9},
pages = {140470--140486},
issn = {2169-3536},
doi = {10.1109/ACCESS.2021.3119573},
url = {https://ieeexplore.ieee.org/document/9568906/},
urldate = {2023-10-11},
abstract = {Industrial Control Systems (ICS) are evolving into smart environments with increased interconnectivity by being connected to the Internet. These changes increase the likelihood of security vulnerabilities and accidents. As the risk of cyberattacks on ICS has increased, various anomaly detection studies are being conducted to detect abnormal situations in industrial processes. However, anomaly detection in ICS suffers from numerous false alarms. When false alarms occur, multiple sensors need to be checked, which is impractical. In this study, when an anomaly is detected, sensors displaying abnormal behavior are visually presented through XAI-based analysis to support quick practical actions and operations. Anomaly Detection has designed and applied better anomaly detection technology than the first prize at HAICon2020, an ICS security threat detection AI contest hosted by the National Security Research Institute last year, and explains the anomalies detected in its model. To the best of our knowledge, our work is at the forefront of explainable anomaly detection research in ICS. Therefore, it is expected to increase the utilization of anomaly detection technology in ICS.},
langid = {english},
file = {/home/danesabo/Zotero/storage/SYTBDVYV/Hwang and Lee - 2021 - E-SFD Explainable Sensor Fault Detection in the I.pdf}
}
@online{IEC6113132013,
title = {{{IEC}} 61131-3:2013},
shorttitle = {{{IEC}} 61131-3},
url = {https://webstore.iec.ch/en/publication/4552},
urldate = {2024-08-13},
langid = {english},
file = {/home/danesabo/Zotero/storage/9DCM4B6F/4552.html}
}
@online{IEEEXploreFullText,
title = {{{IEEE Xplore Full-Text PDF}}:},
url = {https://ieeexplore-ieee-org.pitt.idm.oclc.org/stamp/stamp.jsp?tp=&arnumber=8107024},
urldate = {2023-11-20},
file = {/home/danesabo/Zotero/storage/WLYLUPG2/stamp.html}
}
@inproceedings{immlerNumericalAnalysisOrdinary2012,
title = {Numerical {{Analysis}} of {{Ordinary Differential Equations}} in {{Isabelle}}/{{HOL}}},
booktitle = {Interactive {{Theorem Proving}}},
author = {Immler, Fabian and Hölzl, Johannes},
editor = {Beringer, Lennart and Felty, Amy},
date = {2012},
pages = {377--392},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-32347-8_26},
abstract = {Many ordinary differential equations (ODEs) do not have a closed solution, therefore approximating them is an important problem in numerical analysis. This work formalizes a method to approximate solutions of ODEs in Isabelle/HOL.},
isbn = {978-3-642-32347-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/2DSV7HJE/Immler and Hölzl - 2012 - Numerical Analysis of Ordinary Differential Equati.pdf}
}
@online{ImpossibleAsylum,
title = {An {{Impossible Asylum}}},
issn = {0002-9890},
url = {https://www.tandfonline.com/doi/epdf/10.1080/00029890.2023.2176668?needAccess=true},
urldate = {2024-04-21},
langid = {english},
file = {/home/danesabo/Zotero/storage/YXH6RCU8/An Impossible Asylum.pdf;/home/danesabo/Zotero/storage/XSLV4JNS/00029890.2023.html}
}
@book{instituteofelectricalandelectronicsengineers2014IEEE53rd2014,
title = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}} 2014): {{Los Angeles}}, {{California}}, {{USA}}, 15 - 17 {{December}} 2014},
shorttitle = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}} 2014)},
editor = {Institute of Electrical {and} Electronics Engineers and IEEE Control Systems Society},
date = {2014},
publisher = {IEEE},
location = {Piscataway, NJ},
isbn = {978-1-4673-6090-6 978-1-4673-6089-0},
langid = {english}
}
@book{instituteofelectricalandelectronicsengineersProceedings35thIEEE1996,
title = {Proceedings of the 35th {{IEEE Conference}} on {{Decision}} and {{Control}}: {{December}} 11 - 13, 1996, {{Portopia Hotel}} and {{International Convention Center}}, {{Kobe}}, {{Japan}}},
shorttitle = {Proceedings of the 35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
editor = {Institute of Electrical {and} Electronics Engineers and IEEE Control Systems Society},
date = {1996},
publisher = {IEEE Service Center},
location = {Piscataway, NJ},
eventtitle = {Conference on {{Decision}} and {{Control}}},
isbn = {978-0-7803-3590-5 978-0-7803-3591-2 978-0-7803-3592-9 978-0-7803-3593-6},
langid = {english}
}
@online{InteractionRoundoffNoise,
title = {On the {{Interaction}} of {{Roundoff Noise}} and {{Dynamic Range}} in {{Digital Filters}}* - {{Jackson}} - 1970 - {{Bell System Technical Journal}} - {{Wiley Online Library}}},
url = {https://onlinelibrary-wiley-com.pitt.idm.oclc.org/doi/abs/10.1002/j.1538-7305.1970.tb01763.x},
urldate = {2024-02-08},
file = {/home/danesabo/Zotero/storage/QGRVUY42/j.1538-7305.1970.tb01763.html}
}
@online{IntroductionDiffusionModels2022,
title = {Introduction to {{Diffusion Models}} for {{Machine Learning}}},
date = {2022-05-12T15:19:03},
url = {https://www.assemblyai.com/blog/diffusion-models-for-machine-learning-introduction/},
urldate = {2024-07-23},
abstract = {The meteoric rise of Diffusion Models is one of the biggest developments in Machine Learning in the past several years. Learn everything you need to know about Diffusion Models in this easy-to-follow guide.},
langid = {english},
organization = {News, Tutorials, AI Research},
file = {/home/danesabo/Zotero/storage/YRRXJPJQ/diffusion-models-for-machine-learning-introduction.html}
}
@article{ioannouAutonomousIntelligentCruise1993,
title = {Autonomous Intelligent Cruise Control},
author = {Ioannou, P.A. and Chien, C.C.},
date = {1993-11},
journaltitle = {IEEE Transactions on Vehicular Technology},
volume = {42},
number = {4},
pages = {657--672},
issn = {1939-9359},
doi = {10.1109/25.260745},
url = {https://ieeexplore.ieee.org/document/260745},
urldate = {2023-11-20},
abstract = {Vehicle following and its effects on traffic flow has been an active area of research. Human driving involves reaction times, delays, and human errors that affect traffic flow adversely. One way to eliminate human errors and delays in vehicle following is to replace the human driver with a computer control system and sensors. The purpose of this paper is to develop an autonomous intelligent cruise control (AICC) system for automatic vehicle following, examine its effect on traffic flow, and compare its performance with that of the human driver models. The AICC system developed is not cooperative; i.e., it does not exchange information with other vehicles and yet is not susceptible to oscillations and "slinky" effects. The elimination of the "slinky" effect is achieved by using a safety distance separation rule that is proportional to the vehicle velocity (constant time headway) and by designing the control system appropriately. The performance of the AICC system is found to be superior to that of the human driver models considered. It has a faster and better transient response that leads to a much smoother and faster traffic flow. Computer simulations are used to study the performance of the proposed AICC system and analyze vehicle following in a single lane, without passing, under manual and automatic control. In addition, several emergency situations that include emergency stopping and cut-in cases were simulated. The simulation results demonstrate the effectiveness of the AICC system and its potentially beneficial effects on traffic flow.{$<>$}},
eventtitle = {{{IEEE Transactions}} on {{Vehicular Technology}}},
file = {/home/danesabo/Zotero/storage/AM6D6UCR/Ioannou and Chien - 1993 - Autonomous intelligent cruise control.pdf}
}
@online{IsabelleUTP,
title = {Isabelle/{{UTP}}},
url = {https://isabelle-utp.york.ac.uk/},
urldate = {2024-04-29},
abstract = {Isabelle/UTP is a collection of tools, built on top of the Isabelle/HOL proof assistant, for building practical verification tools. It applies the principles of Hoare and He's Unifying Theories of Programming semantic framework to support formal semantics for a host of heterogeneous languages and},
langid = {american},
file = {/home/danesabo/Zotero/storage/RUPKZ4JG/isabelle-utp.york.ac.uk.html}
}
@online{ISAIEC62443,
title = {{{ISA}}/{{IEC}} 62443 {{Series}} of {{Standards}} - {{ISA}}},
url = {https://www.isa.org/standards-and-publications/isa-standards/isa-iec-62443-series-of-standards},
urldate = {2024-02-29},
abstract = {The ISA/IEC 62443 standards set best practices for cybersecurity and provide a way to assess the level of security performance.},
langid = {english},
organization = {isa.org},
file = {/home/danesabo/Zotero/storage/VQYZ7YWF/isa-iec-62443-series-of-standards.html}
}
@inproceedings{jackyPyModelModelbasedTesting2011,
title = {{{PyModel}}: {{Model-based}} Testing in {{Python}}},
shorttitle = {{{PyModel}}},
author = {Jacky, Jonathan},
date = {2011},
pages = {48--52},
location = {Austin, Texas},
doi = {10.25080/Majora-ebaa42b7-008},
url = {https://conference.scipy.org/proceedings/scipy2011/jacky.html},
urldate = {2023-11-27},
abstract = {In unit testing, the programmer codes the test cases, and also codes assertions that check whether each test case passed. In model-based testing, the programmer codes a "model" that generates as many test cases as desired and also acts as the oracle that checks the cases. Model-based testing is recommended where so many test cases are needed that it is not feasible to code them all by hand. This need arises when testing behaviors that exhibit history-dependence and nondeterminism, so that many variations (data values, interleavings, etc.) should be tested for each scenario (or use case). Examples include communication protocols, web applications, control systems, and user interfaces. PyModel is a model-based testing framework in Python. PyModel supports on-the-fly testing, which can generate indefinitely long nonrepeating tests as the test run executes. PyModel can focus test cases on scenarios of interest by composition, a versatile technique that combines models by synchronizing shared actions and interleaving unshared actions. PyModel can guide test coverage according to programmable strategies coded by the programmer.},
eventtitle = {Python in {{Science Conference}}},
langid = {english},
file = {/home/danesabo/Zotero/storage/QGZYQVCE/Jacky - 2011 - PyModel Model-based testing in Python.pdf}
}
@article{jagvaralUnifiedFrameworkDiffusion2024,
title = {Unified {{Framework}} for {{Diffusion Generative Models}} in {{SO}}(3): {{Applications}} in {{Computer Vision}} and {{Astrophysics}}},
shorttitle = {Unified {{Framework}} for {{Diffusion Generative Models}} in {{SO}}(3)},
author = {Jagvaral, Yesukhei and Lanusse, Francois and Mandelbaum, Rachel},
date = {2024-03-24},
journaltitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
shortjournal = {AAAI},
volume = {38},
number = {11},
pages = {12754--12762},
issn = {2374-3468, 2159-5399},
doi = {10.1609/aaai.v38i11.29171},
url = {https://ojs.aaai.org/index.php/AAAI/article/view/29171},
urldate = {2024-05-20},
abstract = {Diffusion-based generative models represent the current state-of-the-art for image generation. However, standard diffusion models are based on Euclidean geometry and do not translate directly to manifold-valued data. In this work, we develop extensions of both score-based generative models (SGMs) and Denoising Diffusion Probabilistic Models (DDPMs) to the Lie group of 3D rotations, SO(3). SO(3) is of particular interest in many disciplines such as robotics, biochemistry and astronomy/cosmology science. Contrary to more general Riemannian manifolds, SO(3) admits a tractable solution to heat diffusion, and allows us to implement efficient training of diffusion models. We apply both SO(3) DDPMs and SGMs to synthetic densities on SO(3) and demonstrate state-of-the-art results. Additionally, we demonstrate the practicality of our model on pose estimation tasks and in predicting correlated galaxy orientations for astrophysics/cosmology.},
file = {/home/danesabo/Zotero/storage/IIZ4QAYT/Jagvaral et al. - 2024 - Unified Framework for Diffusion Generative Models .pdf}
}
@article{jenkinsUseResidueNumber1977,
title = {The Use of Residue Number Systems in the Design of Finite Impulse Response Digital Filters},
author = {Jenkins, W. and Leon, B.},
date = {1977-04},
journaltitle = {IEEE Transactions on Circuits and Systems},
volume = {24},
number = {4},
pages = {191--201},
issn = {1558-1276},
doi = {10.1109/TCS.1977.1084321},
url = {https://ieeexplore.ieee.org/abstract/document/1084321?casa_token=XdjpccSTFRAAAAAA:9ru-8Uhyn9WqOU4VH0OlAEYlffdomoTZs2ktv-lTXPPeMi8w3_JXeS8dd5pZwLxapTQdLb0Q9A},
urldate = {2024-02-08},
abstract = {A technique is presented for implementing a finite impulse response (FIR) digital filter in a residue number system (RNS). For many years residue number coding has been recognized as a system which provides a capability for the implementation of high speed multiplication and addition. The advantages of residue coding for the design of high speed FIR filters result from the fact that an FIR requires only the high speed residue operations, i.e., addition and multiplication, while not requiring the slower RNS operations of division or sign detection. A new hardware implementation of the Chinese Remainder Theorem is proposed for an efficient translation of residue coded outputs into natural numbers. A numerical example illustrates the principles of residue encoding, residue arithmetic, and residue decoding for FIR filters. An RNS implementation of a 64th-order dual bandpass filter is compared with several alternative filter structures to illustrate tradeoffs between speed and hardware complexity.},
eventtitle = {{{IEEE Transactions}} on {{Circuits}} and {{Systems}}},
file = {/home/danesabo/Zotero/storage/QXLHCVRK/Jenkins and Leon - 1977 - The use of residue number systems in the design of.pdf;/home/danesabo/Zotero/storage/4LS9LL59/1084321.html}
}
@inproceedings{jinModelingPROFINETActions2015,
title = {Modeling \{\vphantom\}{{PROFINET}}\vphantom\{\} Actions with Timing Pi-Calculus},
booktitle = {First {{International Conference}} on {{Information Sciences}}, {{Machinery}}, {{Materials}} and {{Energy}}},
author = {Jin, Wei and Gao, Xin and Li, Jing},
date = {2015},
pages = {397--402},
publisher = {Atlantis Press},
isbn = {94-6252-067-4},
file = {/home/danesabo/Zotero/storage/4ARXNH3I/Jin et al. - Modeling PROFINET actions with timing pi-calculus.pdf}
}
@article{joExplorationZeroKnowledgeProofs,
title = {An {{Exploration}} of {{Zero-Knowledge Proofs}} and Zk-{{SNARKs}}},
author = {Jo, Terrence},
langid = {english},
file = {/home/danesabo/Zotero/storage/RGPBR2H4/Jo - An Exploration of Zero-Knowledge Proofs and zk-SNA.pdf}
}
@inproceedings{jonesAnomalyDetectionCyberphysical2014,
title = {Anomaly Detection in Cyber-Physical Systems: {{A}} Formal Methods Approach},
shorttitle = {Anomaly Detection in Cyber-Physical Systems},
booktitle = {53rd {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Jones, Austin and Kong, Zhaodan and Belta, Calin},
date = {2014-12},
pages = {848--853},
publisher = {IEEE},
location = {Los Angeles, CA, USA},
doi = {10.1109/CDC.2014.7039487},
url = {http://ieeexplore.ieee.org/document/7039487/},
urldate = {2023-11-03},
eventtitle = {2014 {{IEEE}} 53rd {{Annual Conference}} on {{Decision}} and {{Control}} ({{CDC}})},
isbn = {978-1-4673-6090-6 978-1-4799-7746-8 978-1-4799-7745-1}
}
@article{jyotishPerformanceMeasurementSafetycritical2023,
title = {Performance Measurement of Safety-Critical Systems Based on Ordinary Differential Equations and {{Petri}} Nets: {{A}} Case Study of Nuclear Power Plant},
shorttitle = {Performance Measurement of Safety-Critical Systems Based on Ordinary Differential Equations and {{Petri}} Nets},
author = {Jyotish, Nand Kumar and Singh, Lalit Kumar and Kumar, Chiranjeev},
date = {2023-03},
journaltitle = {Nuclear Engineering and Technology},
shortjournal = {Nuclear Engineering and Technology},
volume = {55},
number = {3},
pages = {861--869},
issn = {17385733},
doi = {10.1016/j.net.2022.11.015},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573322005411},
urldate = {2024-02-15},
abstract = {This article proposes a novel approach to measure the performance of Safety-Critical Systems (SCS). Such systems contain multiple processing nodes that communicate with each other is modeled by a Petri nets (PN). The paper uses the PN for the performance evaluation of SCS. A set of ordinary differential equations (ODEs) is derived from the Petri net model that represent the state of the system, and the solutions can be used to measure the system's performance. The proposed method can avoid the state space explosion problem and also introduces new metrics of performance, along with their measurement: deadlock, liveness, stability, boundedness, and steady state. The proposed technique is applied to Shutdown System (SDS) of Nuclear Power Plant (NPP). We obtained 99.887\% accuracy of performance measurement, which proves the effectiveness of our approach.},
langid = {english},
file = {/home/danesabo/Zotero/storage/QIQWIAJ6/Jyotish et al. - 2023 - Performance measurement of safety-critical systems.pdf}
}
@article{kamwaBuzzwordSolutionsDigital2024,
title = {From {{Buzzword To Solutions}}: {{Digital Twins}} in {{Power Systems}} [{{Editor}}’s {{Voice}}]},
shorttitle = {From {{Buzzword To Solutions}}},
author = {Kamwa, Innocent and Badrzadeh, Babak},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {4--11},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3331189},
url = {https://ieeexplore.ieee.org/document/10398547/},
urldate = {2024-03-13},
abstract = {The digital twin concept has been around for a while—as early as 2002, according to Wikipedia and the authors in this issue. However, my first encounter with this concept was just about five or six years ago. Around that time, Gartner reported the entering of digital twins into mainstream use: 75\% of companies implementing the Internet of Things were already using digital twins or planned to within a year. My organization was contemplating digital twins as an enabling technology for grid modernization. During the process of road mapping the strategic innovation, we were asked how/where to position and prioritize this emerging research field in the transmission portfolio. We had two camps: networks versus assets. In the end, upper management, advised probably by consulting firms, such as McKinsey or Gartner, assigned the digital twin track to the asset group and excluded it from network research activities. Applying the digital twin buzzword to “networks” was deemed an abuse of language—a source of confusion in use case definitions and business value analyses of digital twins.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/5F638YMS/Kamwa and Badrzadeh - 2024 - From Buzzword To Solutions Digital Twins in Power.pdf;/home/danesabo/Zotero/storage/ZDQ6X7RG/10398547.html}
}
@inproceedings{kapinskiSimulationguidedApproachesVerification2015,
title = {Simulation-Guided Approaches for Verification of Automotive Powertrain Control Systems},
booktitle = {2015 {{American Control Conference}} ({{ACC}})},
author = {Kapinski, James and Deshmukh, Jyotirmoy and Jin, Xiaoqing and Ito, Hisahiro and Butts, Ken},
date = {2015-07},
pages = {4086--4095},
issn = {2378-5861},
doi = {10.1109/ACC.2015.7171968},
url = {https://ieeexplore.ieee.org/abstract/document/7171968},
urldate = {2024-07-10},
abstract = {Automotive embedded control systems are a vital aspect of modern automotive development, but the considerable complexity of these systems has made quality checking a challenging endeavor. Simulation-based checking approaches are attractive, as they often scale well with the complexity of the system design. This paper presents an overview of simulation-guided techniques that can be used to increase the confidence in the quality of an automotive powertrain control system design. We discuss the relationship between simulation-based approaches and the broader areas of verification and powertrain control design. Also, we discuss new software tools that use simulation-guided approaches to address various aspects of automotive powertrain control design verification. We conclude by considering ongoing challenges in developing new simulation-guided tools and applying them in a powertrain control development context.},
eventtitle = {2015 {{American Control Conference}} ({{ACC}})},
keywords = {Automotive engineering,Computational modeling,Control systems,Engines,Mathematical model,Numerical models,Testing},
file = {/home/danesabo/Zotero/storage/WGJ4F98E/Kapinski et al. - 2015 - Simulation-guided approaches for verification of a.pdf;/home/danesabo/Zotero/storage/9AR9TXRT/7171968.html}
}
@inproceedings{kapinskiSimulationguidedLyapunovAnalysis2014,
title = {Simulation-Guided Lyapunov Analysis for Hybrid Dynamical Systems},
booktitle = {Proceedings of the 17th International Conference on {{Hybrid}} Systems: Computation and Control},
author = {Kapinski, James and Deshmukh, Jyotirmoy V. and Sankaranarayanan, Sriram and Arechiga, Nikos},
date = {2014-04-15},
series = {{{HSCC}} '14},
pages = {133--142},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/2562059.2562139},
url = {https://doi.org/10.1145/2562059.2562139},
urldate = {2024-07-10},
abstract = {Lyapunov functions are used to prove stability and to obtain performance bounds on system behaviors for nonlinear and hybrid dynamical systems, but discovering Lyapunov functions is a difficult task in general. We present a technique for discovering Lyapunov functions and barrier certificates for nonlinear and hybrid dynamical systems using a search-based approach. Our approach uses concrete executions, such as those obtained through simulation, to formulate a series of linear programming (LP) optimization problems; the solution to each LP creates a candidate Lyapunov function. Intermediate candidates are iteratively improved using a global optimizer guided by the Lie derivative of the candidate Lyapunov function. The analysis is refined using counterexamples from a Satisfiability Modulo Theories (SMT) solver. When no counterexamples are found, the soundness of the analysis is verified using an arithmetic solver. The technique can be applied to a broad class of nonlinear dynamical systems, including hybrid systems and systems with polynomial and even transcendental dynamics. We present several examples illustrating the efficacy of the technique, including two automotive powertrain control examples.},
isbn = {978-1-4503-2732-9},
file = {/home/danesabo/Zotero/storage/CHU4P2B4/Kapinski et al. - 2014 - Simulation-guided lyapunov analysis for hybrid dyn.pdf}
}
@online{kapteynPhysicsBasedModelsPredictive2020,
title = {From {{Physics-Based Models}} to {{Predictive Digital Twins}} via {{Interpretable Machine Learning}}},
author = {Kapteyn, Michael G. and Willcox, Karen E.},
date = {2020-04-28},
eprint = {2004.11356},
eprinttype = {arXiv},
eprintclass = {cs},
url = {http://arxiv.org/abs/2004.11356},
urldate = {2023-10-11},
abstract = {This work develops a methodology for creating a data-driven digital twin from a library of physics-based models representing various asset states. The digital twin is updated using interpretable machine learning. Specifically, we use optimal trees---a recently developed scalable machine learning method---to train an interpretable data-driven classifier. Training data for the classifier are generated offline using simulated scenarios solved by the library of physics-based models. These data can be further augmented using experimental or other historical data. In operation, the classifier uses observational data from the asset to infer which physics-based models in the model library are the best candidates for the updated digital twin. The approach is demonstrated through the development of a structural digital twin for a 12ft wingspan unmanned aerial vehicle. This digital twin is built from a library of reduced-order models of the vehicle in a range of structural states. The data-driven digital twin dynamically updates in response to structural damage or degradation and enables the aircraft to replan a safe mission accordingly. Within this context, we study the performance of the optimal tree classifiers and demonstrate how their interpretability enables explainable structural assessments from sparse sensor measurements, and also informs optimal sensor placement.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/ACPJQ3GN/Kapteyn and Willcox - 2020 - From Physics-Based Models to Predictive Digital Tw.pdf}
}
@article{karatzasSystemTheoreticProcessAnalysis2020,
title = {System-{{Theoretic Process Analysis}} ({{STPA}}) for {{Hazard Analysis}} in {{Complex Systems}}: {{The Case}} of “{{Demand-Side Management}} in a {{Smart Grid}}”},
shorttitle = {System-{{Theoretic Process Analysis}} ({{STPA}}) for {{Hazard Analysis}} in {{Complex Systems}}},
author = {Karatzas, Stylianos and Chassiakos, Athanasios},
date = {2020-09-18},
journaltitle = {Systems},
shortjournal = {Systems},
volume = {8},
number = {3},
pages = {33},
issn = {2079-8954},
doi = {10.3390/systems8030033},
url = {https://www.mdpi.com/2079-8954/8/3/33},
urldate = {2023-11-03},
abstract = {Inelasticity of demand along with the distributed energy sources and energy market democratization pose significant challenges which have considerable negative impacts on overall grid balance. The need for increased capacity and flexibility in the era of energy market digitalization has introduced new requirements in the energy supply network which could not be satisfied without continuous and costly local power network upgrades. Additionally, with the emergence of Smart Homes (SHs) and Home Energy Management (HEM) systems for monitoring and operating household appliances, opportunities have arisen for automated Demand Response (DR). DR is exploited for the modification of the consumer energy demand, in response to the specific conditions within the electricity system (e.g., peak period network congestion). In order to optimally integrate DR in the broader Smart Grid (SG) system, modelling of the system parameters and safety analysis is required. In this paper, the implementation of STPA (System-Theoretic Process Analysis) structured method, as a relatively new hazard analysis technique for complex systems is presented and the feasibility of STPA implementation for loss prevention on a Demand Response system for home energy management, and within the complex SG context, is examined. The applied method delivers a mechanism useful in understanding where gaps in current operational risk structures may exist. The STPA findings in terms of loss scenarios can be used to generate a variety of safeguards to ensure secure operational control and in implementing targeted strategies through standard approaches of risk assessment.},
langid = {english},
file = {/home/danesabo/Zotero/storage/82RCGKD8/Karatzas and Chassiakos - 2020 - System-Theoretic Process Analysis (STPA) for Hazar.pdf}
}
@article{kaysDigitalTwinNew2024,
title = {The Digital Twin: {{New}} Species, Evolution, or Revolution? [{{In}} My View]},
shorttitle = {The Digital Twin},
author = {Kays, Jan},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {90--92},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3328292},
url = {https://ieeexplore.ieee.org/document/10398573/},
urldate = {2024-03-13},
abstract = {In studying the agendas of conferences and listening to research institutes or consultants, a new phrase has arisen in recent years: the digital twin. Assuming an answer to some everyday challenges, this topic made me curious. There are many interpretations and definitions of a digital twin in the research as well as the professional community. Depending on the individual focus, people assume that a digital twin is a dynamic model of a power grid, an energy management system simulation of a high-voltage dc converter station, or a 3D model of substations, and so on. In general, it is seen as a digital representation of the reality. My own picture of a digital twin got sharper after spending time on research and listening to interesting talks and presentations.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/TMGV4GSA/Kays - 2024 - The digital twin New species, evolution, or revol.pdf;/home/danesabo/Zotero/storage/BV39AE4U/10398573.html}
}
@article{kennedyBayesianCalibrationComputer2001,
title = {Bayesian {{Calibration}} of {{Computer Models}}},
author = {Kennedy, Marc C. and O'Hagan, Anthony},
date = {2001-09-01},
journaltitle = {Journal of the Royal Statistical Society Series B: Statistical Methodology},
shortjournal = {Journal of the Royal Statistical Society Series B: Statistical Methodology},
volume = {63},
number = {3},
pages = {425--464},
issn = {1369-7412},
doi = {10.1111/1467-9868.00294},
url = {https://doi.org/10.1111/1467-9868.00294},
urldate = {2024-05-21},
abstract = {We consider prediction and uncertainty analysis for systems which are approximated using complex mathematical models. Such models, implemented as computer codes, are often generic in the sense that by a suitable choice of some of the model's input parameters the code can be used to predict the behaviour of the system in a variety of specific applications. However, in any specific application the values of necessary parameters may be unknown. In this case, physical observations of the system in the specific context are used to learn about the unknown parameters. The process of fitting the model to the observed data by adjusting the parameters is known as calibration. Calibration is typically effected by ad hoc fitting, and after calibration the model is used, with the fitted input values, to predict the future behaviour of the system. We present a Bayesian calibration technique which improves on this traditional approach in two respects. First, the predictions allow for all sources of uncertainty, including the remaining uncertainty over the fitted parameters. Second, they attempt to correct for any inadequacy of the model which is revealed by a discrepancy between the observed data and the model predictions from even the best-fitting parameter values. The method is illustrated by using data from a nuclear radiation release at Tomsk, and from a more complex simulated nuclear accident exercise.},
file = {/home/danesabo/Zotero/storage/2E45R2EF/Kennedy and O'Hagan - 2001 - Bayesian Calibration of Computer Models.pdf;/home/danesabo/Zotero/storage/VUNWFU89/7083367.html}
}
@article{kernFormalVerificationHardware1999,
title = {Formal Verification in Hardware Design: A Survey},
shorttitle = {Formal Verification in Hardware Design},
author = {Kern, Christoph and Greenstreet, Mark R.},
date = {1999-04-01},
journaltitle = {ACM Transactions on Design Automation of Electronic Systems},
shortjournal = {ACM Trans. Des. Autom. Electron. Syst.},
volume = {4},
number = {2},
pages = {123--193},
issn = {1084-4309},
doi = {10.1145/307988.307989},
url = {https://dl.acm.org/doi/10.1145/307988.307989},
urldate = {2024-02-17},
abstract = {In recent years, formal methods have emerged as an alternative approach to ensuring the quality and correctness of hardware designs, overcoming some of the limitations of traditional validation techniques such as simulation and testing. There are two main aspects to the application of formal methods in a design process: the formal framework used to specify desired properties of a design and the verification techniques and tools used to reason about the relationship between a specification and a corresponding implementation. We survey a variety of frameworks and techniques proposed in the literature and applied to actual designs. The specification frameworks we describe include temporal logics, predicate logic, abstraction and refinement, as well as containment between ω-regular languages. The verification techniques presented include model checking, automata-theoretic techniques, automated theorem proving, and approaches that integrate the above methods. In order to provide insight into the scope and limitations of currently available techniques, we present a selection of case studies where formal methods were applied to industrial-scale designs, such as microprocessors, floating-point hardware, protocols, memory subsystems, and communications hardware.},
file = {/home/danesabo/Zotero/storage/ZE4R2AF4/Kern and Greenstreet - 1999 - Formal verification in hardware design a survey.pdf}
}
@article{khattakReviewCyberSecurity2017,
title = {Review of Cyber Security Applications in Nuclear Power Plants},
author = {Khattak, Muhammad Adil and Shaharuddin, Muhammad Khairy Harmaini and Haris, Muhammad Saiful Islam and Aminuddin, Muhammad Zuhaili Mohammad and Azhar, Nik Mohamad Amirul Nik and Ahmad, Nik Muhammad Hakimi Nik},
date = {2017},
journaltitle = {Journal of Advanced Research in Applied Sciences and Engineering Technology},
volume = {7},
number = {1},
pages = {43--54},
isbn = {2462-1943},
file = {/home/danesabo/Zotero/storage/22SMP5EI/Review of cyber security applications in nuclear power plants.pdf}
}
@online{kimInterpretabilityFeatureAttribution2018,
title = {Interpretability {{Beyond Feature Attribution}}: {{Quantitative Testing}} with {{Concept Activation Vectors}} ({{TCAV}})},
shorttitle = {Interpretability {{Beyond Feature Attribution}}},
author = {Kim, Been and Wattenberg, Martin and Gilmer, Justin and Cai, Carrie and Wexler, James and Viegas, Fernanda and Sayres, Rory},
date = {2018-06-07},
eprint = {1711.11279},
eprinttype = {arXiv},
eprintclass = {stat},
url = {http://arxiv.org/abs/1711.11279},
urldate = {2023-10-11},
abstract = {The interpretation of deep learning models is a challenge due to their size, complexity, and often opaque internal state. In addition, many systems, such as image classifiers, operate on low-level features rather than high-level concepts. To address these challenges, we introduce Concept Activation Vectors (CAVs), which provide an interpretation of a neural net’s internal state in terms of human-friendly concepts. The key idea is to view the high-dimensional internal state of a neural net as an aid, not an obstacle. We show how to use CAVs as part of a technique, Testing with CAVs (TCAV), that uses directional derivatives to quantify the degree to which a user-defined concept is important to a classification result–for example, how sensitive a prediction of zebra is to the presence of stripes. Using the domain of image classification as a testing ground, we describe how CAVs may be used to explore hypotheses and generate insights for a standard image classification network as well as a medical application.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/QYN2BG7D/Kim et al. - 2018 - Interpretability Beyond Feature Attribution Quant.pdf}
}
@article{kimNuDE20Formal2017,
title = {{{NuDE}} 2.0: {{A Formal Method-based Software Development}}, {{Verification}} and {{Safety Analysis Environment}} for {{Digital I}}\&{{Cs}} in {{NPPs}}},
shorttitle = {{{NuDE}} 2.0},
author = {Kim, Eui-Sub and Lee, Dong-Ah and Jung, Sejin and Yoo, Junbeom and Choi, Jong-Gyun and Lee, Jang-Soo},
date = {2017-03-30},
journaltitle = {Journal of Computing Science and Engineering},
shortjournal = {Journal of Computing Science and Engineering},
volume = {11},
number = {1},
pages = {9--23},
issn = {1976-4677},
doi = {10.5626/JCSE.2017.11.1.9},
url = {http://koreascience.or.kr/journal/view.jsp?kj=E1EIKI&py=2017&vnc=v11n1&sp=9},
urldate = {2023-11-03},
langid = {english},
file = {/home/danesabo/Zotero/storage/3SUWT244/Kim et al. - 2017 - NuDE 2.0 A Formal Method-based Software Developme.pdf}
}
@article{kimNuDE20Formal2017a,
title = {{{NuDE}} 2.0: {{A Formal Method-based Software Development}}, {{Verification}} and {{Safety Analysis Environment}} for {{Digital I}}\&{{Cs}} in {{NPPs}}},
shorttitle = {{{NuDE}} 2.0},
author = {Kim, Eui-Sub and Lee, Dong-Ah and Jung, Sejin and Yoo, Junbeom and Choi, Jong-Gyun and Lee, Jang-Soo},
date = {2017-03-30},
journaltitle = {Journal of Computing Science and Engineering},
shortjournal = {Journal of Computing Science and Engineering},
volume = {11},
number = {1},
pages = {9--23},
issn = {1976-4677},
doi = {10.5626/JCSE.2017.11.1.9},
url = {http://koreascience.or.kr/journal/view.jsp?kj=E1EIKI&py=2017&vnc=v11n1&sp=9},
urldate = {2023-10-10},
abstract = {NuDE 2.0 (Nuclear Development Environment 2.0) is a formal-method-based software development, verification and safety analysis environment for safety-critical digital I\&Cs implemented with programmable logic controller (PLC) and field-programmable gate array (FPGA). It simultaneously develops PLC/FPGA software implementations from one requirement/design specification and also helps most of the development, verification, and safety analysis to be performed mechanically and in sequence. The NuDE 2.0 now consists of 25 CASE tools and also includes an in-depth solution for indirect commercial off-the-shelf (COTS) software dedication of new FPGA-based digital I\&Cs. We expect that the NuDE 2.0 will be widely used as a means of diversifying software design/implementation and model-based software development methodology.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DCL886HK/Kim et al. - 2017 - NuDE 2.0 A Formal Method-based Software Developme.pdf}
}
@inproceedings{kimSignoffBoundedFormal2014,
title = {Sign-off with {{Bounded Formal Verification Proofs}}},
booktitle = {Design and {{Verification Conference}}},
author = {Kim, NamDo and Park, Junhyuk and Singh, HarGovind and Singhal, Vigyan},
date = {2014},
file = {/home/danesabo/Zotero/storage/MWZM2L3R/Kim et al. - Sign-off with Bounded Formal Verification Proofs.pdf}
}
@article{kleinComprehensiveFormalVerification2014,
title = {Comprehensive {{Formal Verification}} of an {{OS Microkernel}}},
author = {Klein, Gerwin and Andronick, June and Elphinstone, Kevin and Murray, Toby and Sewell, Thomas and Kolanski, Rafal and Heiser, Gernot},
date = {2014-02},
journaltitle = {ACM TRANSACTIONS ON COMPUTER SYSTEMS},
shortjournal = {ACM Trans. Comput. Syst.},
volume = {32},
number = {1},
pages = {2},
publisher = {Assoc Computing Machinery},
location = {New York},
issn = {0734-2071, 1557-7333},
doi = {10.1145/2560537},
url = {https://www.webofscience.com/api/gateway?GWVersion=2&SrcAuth=DOISource&SrcApp=WOS&KeyAID=10.1145%2F2560537&DestApp=DOI&SrcAppSID=USW2EC0EC1PuWMCSXOYkyOwTcd6Fm&SrcJTitle=ACM+TRANSACTIONS+ON+COMPUTER+SYSTEMS&DestDOIRegistrantName=Association+for+Computing+Machinery},
urldate = {2023-12-13},
abstract = {We present an in-depth coverage of the comprehensive machine-checked formal verification of seL4, a general-purpose operating system microkernel. We discuss the kernel design we used to make its verification tractable. We then describe the functional correctness proof of the kernel's C implementation and we cover further steps that transform this result into a comprehensive formal verification of the kernel: a formally verified IPC fastpath, a proof that the binary code of the kernel correctly implements the C semantics, a proof of correct access-control enforcement, a proof of information-flow noninterference, a sound worst-case execution time analysis of the binary, and an automatic initialiser for user-level systems that connects kernel-level access-control enforcement with reasoning about system behaviour. We summarise these results and show how they integrate to form a coherent overall analysis, backed by machine-checked, end-to-end theorems. The seL4 microkernel is currently not just the only general-purpose operating system kernel that is fully formally verified to this degree. It is also the only example of formal proof of this scale that is kept current as the requirements, design and implementation of the system evolve over almost a decade. We report on our experience in maintaining this evolving formally verified code base.},
langid = {english},
pagetotal = {70},
annotation = {Web of Science ID: WOS:000332125400002},
file = {/home/danesabo/Zotero/storage/8WDLRDB8/Klein et al. - 2014 - Comprehensive Formal Verification of an OS Microke.pdf}
}
@article{kleinFormallyVerifiedSoftware2018,
title = {Formally Verified Software in the Real World},
author = {Klein, Gerwin and Andronick, June and Fernandez, Matthew and Kuz, Ihor and Murray, Toby and Heiser, Gernot},
date = {2018-09-26},
journaltitle = {Commun. ACM},
volume = {61},
number = {10},
pages = {68--77},
issn = {0001-0782},
doi = {10.1145/3230627},
url = {https://dl.acm.org/doi/10.1145/3230627},
urldate = {2024-08-12},
abstract = {Verified software secures the Unmanned Little Bird autonomous helicopter against mid-flight cyber attacks.},
keywords = {Control systems,Cybersecurity,Formal methods,formal verification,penetration testing},
file = {/home/danesabo/Zotero/storage/XNCF39K8/Klein et al. - 2018 - Formally verified software in the real world.pdf}
}
@inproceedings{kleinSeL4FormalVerification2009,
title = {{{seL4}}: Formal Verification of an {{OS}} Kernel},
shorttitle = {{{seL4}}},
booktitle = {Proceedings of the {{ACM SIGOPS}} 22nd Symposium on {{Operating}} Systems Principles},
author = {Klein, Gerwin and Elphinstone, Kevin and Heiser, Gernot and Andronick, June and Cock, David and Derrin, Philip and Elkaduwe, Dhammika and Engelhardt, Kai and Kolanski, Rafal and Norrish, Michael and Sewell, Thomas and Tuch, Harvey and Winwood, Simon},
date = {2009-10-11},
pages = {207--220},
publisher = {ACM},
location = {Big Sky Montana USA},
doi = {10.1145/1629575.1629596},
url = {https://dl.acm.org/doi/10.1145/1629575.1629596},
urldate = {2023-11-03},
eventtitle = {{{SOSP09}}: {{ACM SIGOPS}} 22nd {{Symposium}} on {{Operating Systems Principles}}},
isbn = {978-1-60558-752-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/P6TTYKPW/Klein et al. - 2009 - seL4 formal verification of an OS kernel.pdf}
}
@article{kohlerCloudBasedDigitalTwin2024,
title = {Cloud-{{Based Digital Twin}} for {{Distribution Grids}}: {{What Is Already Available Today}}},
shorttitle = {Cloud-{{Based Digital Twin}} for {{Distribution Grids}}},
author = {Köhler, Christian and Kersten, René and Schöpf, Michael},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {72--80},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3336255},
url = {https://ieeexplore.ieee.org/document/10398568/},
urldate = {2024-03-13},
abstract = {The increase in decentralized fluctuating feed-in at low-, medium-, and high-voltage levels associated with the expansion of renewable energies and the emergence of new volatile loads and storage systems is increasingly influencing the overall system behavior of the energy supply and therefore requires a more proactive role for the distribution system operator (DSO). Low and medium grid voltage levels in particular have a pivotal role here, as a significant part of renewable energy feed-in, and almost any new volatile loads, such as heat pumps and electric vehicles, are connected on these levels. Thus far, especially on the low-voltage level, most grid operators encounter a lack of transparency and controllability. It is essential for the integration of renewable energies and volatile loads to have information on power flows and power quality. Hence, massive investments in grid, measurement, and telecontrol infrastructure would be necessary. Using intelligent software technology for grid management can significantly decrease these necessary investments.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/VSNPRAN8/Köhler et al. - 2024 - Cloud-Based Digital Twin for Distribution Grids W.pdf;/home/danesabo/Zotero/storage/LWGT8HRD/10398568.html}
}
@online{kongDiffWaveVersatileDiffusion2020,
title = {{{DiffWave}}: {{A Versatile Diffusion Model}} for {{Audio Synthesis}}},
shorttitle = {{{DiffWave}}},
author = {Kong, Zhifeng and Ping, Wei and Huang, Jiaji and Zhao, Kexin and Catanzaro, Bryan},
date = {2020},
doi = {10.48550/ARXIV.2009.09761},
url = {https://arxiv.org/abs/2009.09761},
urldate = {2024-05-20},
abstract = {In this work, we propose DiffWave, a versatile diffusion probabilistic model for conditional and unconditional waveform generation. The model is non-autoregressive, and converts the white noise signal into structured waveform through a Markov chain with a constant number of steps at synthesis. It is efficiently trained by optimizing a variant of variational bound on the data likelihood. DiffWave produces high-fidelity audios in different waveform generation tasks, including neural vocoding conditioned on mel spectrogram, class-conditional generation, and unconditional generation. We demonstrate that DiffWave matches a strong WaveNet vocoder in terms of speech quality (MOS: 4.44 versus 4.43), while synthesizing orders of magnitude faster. In particular, it significantly outperforms autoregressive and GAN-based waveform models in the challenging unconditional generation task in terms of audio quality and sample diversity from various automatic and human evaluations.},
pubstate = {prepublished},
version = {3},
keywords = {Audio and Speech Processing (eess.AS),Computation and Language (cs.CL),FOS: Computer and information sciences,FOS: Electrical engineering electronic engineering information engineering,Machine Learning (cs.LG),Machine Learning (stat.ML),Sound (cs.SD)}
}
@incollection{kongDReachDReachabilityAnalysis2015,
title = {{{dReach}}: δ-{{Reachability Analysis}} for {{Hybrid Systems}}},
shorttitle = {{{dReach}}},
booktitle = {Tools and {{Algorithms}} for the {{Construction}} and {{Analysis}} of {{Systems}}},
author = {Kong, Soonho and Gao, Sicun and Chen, Wei and Clarke, Edmund},
editor = {Baier, Christel and Tinelli, Cesare},
date = {2015},
volume = {9035},
pages = {200--205},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-662-46681-0_15},
url = {http://link.springer.com/10.1007/978-3-662-46681-0_15},
urldate = {2023-11-02},
isbn = {978-3-662-46680-3 978-3-662-46681-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/PC3HFWNV/Kong et al. - 2015 - dReach δ-Reachability Analysis for Hybrid Systems.pdf}
}
@inproceedings{kottlerFormalVerificationLadder2017,
title = {Formal Verification of Ladder Logic Programs Using {{NuSMV}}},
booktitle = {{{SoutheastCon}} 2017},
author = {Kottler, Sam and Khayamy, Mehdy and Hasan, Syed Rafay and Elkeelany, Omar},
date = {2017-03},
pages = {1--5},
publisher = {IEEE},
location = {Concord, NC, USA},
doi = {10.1109/SECON.2017.7925390},
url = {http://ieeexplore.ieee.org/document/7925390/},
urldate = {2023-10-10},
abstract = {Programmable logic controllers (PLCs) are heavyduty computers used to control industrial systems. For many years these systems were physically separated from any other network making attacks extremely difficult. However, these increasingly connected systems have not improved much in terms of security, leaving them vulnerable to attacks. This paper attempts to show that ladder logic programs for PLCs can be modeled in NuSMV and verified using computational tree logic (CTL) specifications. This paper also shows how simple changes to the ladder logic program can cause catastrophic damage to the PLC system. This intruded code can be difficult to detect by looking at the ladder logic program because the change is so small. However, the intruded code can be modeled in NuSMV and identified by properly written CTL specifications.},
eventtitle = {{{SoutheastCon}} 2017},
isbn = {978-1-5386-1539-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/FSKKZK3C/Kottler et al. - 2017 - Formal verification of ladder logic programs using.pdf}
}
@online{Kry10TechnicalOverview,
title = {Kry10 {{Technical Overview}}},
url = {https://uploads-ssl.webflow.com/635675151c946163c2012450/66395a8a675c74f82097a749_kry10-technical-overview.pdf},
urldate = {2024-08-12},
abstract = {Kry10 provides a secure operating system and other software for smart machines and other connected industrial systems. Built on a secure foundation which is mathematically proven to be functionally correct, the OS removes many classes of vulnerabilities that most common operating systems are susceptible to. While software backed by formal methods has been available for several decades, formal methods have not been adopted at scale because they weren’t usable. The Kry10 suite of developer tools and libraries has solved the usability problem. Developers can now code on a secure OS easily and efficiently. The Kry10 tools include familiar languages and development tools: • Support common languages such as Rust and C • Include build systems and libraries of reusable, attestable code.}
}
@online{Kry10TechnicalOverviewa,
title = {Kry10 {{Technical Overview}}},
url = {https://uploads-ssl.webflow.com/635675151c946163c2012450/66395a8a675c74f82097a749_kry10-technical-overview.pdf},
urldate = {2024-08-12},
file = {/home/danesabo/Zotero/storage/LEU7QMKH/66395a8a675c74f82097a749_kry10-technical-overview.pdf}
}
@online{kulikSurveyPracticalFormal2021,
title = {A {{Survey}} of {{Practical Formal Methods}} for {{Security}}},
author = {Kulik, Tomas and Dongol, Brijesh and Larsen, Peter Gorm and Macedo, Hugo Daniel and Schneider, Steve and Tran-Jørgensen, Peter Würtz Vinther and Woodcock, Jim},
date = {2021-09-03},
eprint = {2109.01362},
eprinttype = {arXiv},
eprintclass = {cs},
url = {http://arxiv.org/abs/2109.01362},
urldate = {2023-10-10},
abstract = {In today’s world, critical infrastructure is often controlled by computing systems. This introduces new risks for cyber attacks, which can compromise the security and disrupt the functionality of these systems. It is therefore necessary to build such systems with strong guarantees of resiliency against cyber attacks. One way to achieve this level of assurance is using formal verification, which provides proofs of system compliance with desired cyber security properties. The use of Formal Methods (FM) in aspects of cyber security and safety-critical systems are reviewed in this article. We split FM into the three main classes: theorem proving, model checking and lightweight FM. To allow the different uses of FM to be compared, we define a common set of terms. We further develop categories based on the type of computing system FM are applied in. Solutions in each class and category are presented, discussed, compared and summarised. We describe historical highlights and developments and present a state-of-the-art review in the area of FM in cyber security. This review is presented from the point of view of FM practitioners and researchers, commenting on the trends in each of the classes and categories. This is achieved by considering all types of FM, several types of security and safety critical systems and by structuring the taxonomy accordingly. The article hence provides a comprehensive overview of FM and techniques available to system designers of security-critical systems, simplifying the process of choosing the right tool for the task. The article concludes by summarising the discussion of the review, focusing on best practices, challenges, general future trends and directions of research within this field.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/DE5L3BKT/Kulik et al. - 2021 - A Survey of Practical Formal Methods for Security.pdf}
}
@inproceedings{kumarModelingVerificationTimed2016,
title = {Modeling and Verification of Timed Automaton Based Hybrid Systems Using Spin Model Checker},
booktitle = {2016 {{IEEE Annual India Conference}} ({{INDICON}})},
author = {Kumar, N Suresh and Kumar, G Santhosh},
date = {2016-12},
pages = {1--8},
publisher = {IEEE},
location = {Bangalore, India},
doi = {10.1109/INDICON.2016.7839011},
url = {http://ieeexplore.ieee.org/document/7839011/},
urldate = {2023-10-10},
abstract = {Cyber Physical Systems are composition of physical processes and discrete computational elements. Modeling and verification of such systems require mechanisms that incorporate continuos behaviour for monitoring physical events and descrete behaviour for computational elements. Passage of time is a fundamental property to be modelled and hybrid systems incorporate this aspect directly in the automaton of the model. In this paper a validation model for a timed automata is modeled using PROMELA and is verified using Spin model checker. The novelty of the proposed work is an attempt to model timed automata based hybrid systems using the basic constructs of PROMELA. Verification of safety and correctness properties of a traffic controller modeled as a hybrid system is attempted. Further a traffic light controller protocol consisting of four such controllers are introduced,their interactions and properties were verified. The proposed work provide an easy and effective way to build protocols for timed automaton based systems using Spin Model Checker.},
eventtitle = {2016 {{IEEE Annual India Conference}} ({{INDICON}})},
isbn = {978-1-5090-3646-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/QNFRW5ZK/Kumar and Kumar - 2016 - Modeling and verification of timed automaton based.pdf}
}
@article{kunzFormalMethodologyAccomplishing2017,
title = {A {{Formal Methodology}} for {{Accomplishing IEC}} 61850 {{Real-Time Communication Requirements}}},
author = {Kunz, Guilherme and Machado, Jose and Perondi, Eduardo and Vyatkin, Valeriy},
date = {2017-08},
journaltitle = {IEEE Transactions on Industrial Electronics},
shortjournal = {IEEE Trans. Ind. Electron.},
volume = {64},
number = {8},
pages = {6582--6590},
issn = {0278-0046, 1557-9948},
doi = {10.1109/TIE.2017.2682042},
url = {http://ieeexplore.ieee.org/document/7878522/},
urldate = {2023-10-10},
abstract = {Reliability is extremely important for control systems of energy distribution and generation. The IEC 61850 standard specifies an open architecture and communication protocols for such applications. The standard defines an open control architecture for networked control systems composed by intelligent electronic devices, stating some requirements that must be accomplished when developing reliable controllers for such systems. In this paper, we present a systematic and formal methodology to be adopted to achieve the correct implementation of the communication requirements of this standard. The methodology consists in five steps: modeling of real-time communication requirements defined by the standard; simulation of the obtained model; formal verification of the model, improved in the previous step; translation of the global model (simulated and verified) into the input language of the real controller; and finally, application of conformance testing technique to the computational routine implemented in the real controller. Presented research deals with the proposition of a strategy to synthesize and validate models of systems developed under IEC61850 real-time requirements (GOOSE and SMV) through simple operational conditions cases that, once validated, can be used in performance and conformance testing of more complex systems. The proposed methodology allows designers to synthesize reliable systems under IEC61850 real-time communication requirements.},
langid = {english},
file = {/home/danesabo/Zotero/storage/LK3YVJ4H/Kunz et al. - 2017 - A Formal Methodology for Accomplishing IEC 61850 R.pdf}
}
@article{kushnerRealStoryStuxnet2013,
title = {The Real Story of Stuxnet},
author = {Kushner, David},
date = {2013-03},
journaltitle = {IEEE Spectrum},
volume = {50},
number = {3},
pages = {48--53},
issn = {1939-9340},
doi = {10.1109/MSPEC.2013.6471059},
url = {https://ieeexplore.ieee.org/document/6471059},
urldate = {2024-08-13},
abstract = {The paper discusses how Kaspersky Lab tracked down the malware that stymied Iran's nuclear-fuel enrichment program.},
eventtitle = {{{IEEE Spectrum}}},
keywords = {Companies,Computer hacking,Computer security,Computer viruses,Cryptography,Malware},
file = {/home/danesabo/Zotero/storage/EITGZ842/Kushner - 2013 - The real story of stuxnet.pdf;/home/danesabo/Zotero/storage/EYIA8T2A/6471059.html}
}
@incollection{kusmenkoModelingArchitecturesCyberPhysical2017,
title = {Modeling {{Architectures}} of {{Cyber-Physical Systems}}},
booktitle = {Modelling {{Foundations}} and {{Applications}}},
author = {Kusmenko, Evgeny and Roth, Alexander and Rumpe, Bernhard and Von Wenckstern, Michael},
editor = {Anjorin, Anthony and Espinoza, Huáscar},
date = {2017},
volume = {10376},
pages = {34--50},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-61482-3_3},
url = {http://link.springer.com/10.1007/978-3-319-61482-3_3},
urldate = {2023-11-08},
abstract = {Cyber-physical systems (CPS) in automotive or robotics industry comprise many different specific features, e.g., trajectory planning, lane correction, battery management or engine control, requiring a steady interaction with their environment over sensors and actuators. Assembling all these different features is one of the key challenges in the development of such complex systems. Component and connector (C\&C) models are widely used for the design and development of CPS to represent features and their logical interaction. An advantage of C\&C models is that complex features can be hierarchically decomposed into subfeatures, developed and managed by different domain experts. In this paper, we present the textual modeling family MontiCAR, Modeling and Testing of Cyber-Physical Architectures. It is based on the C\&C paradigm and increases development efficiency of CPS by incorporating (i) component and connector arrays, (ii) name and index based autoconnections, (iii) a strict type system with unit and accuracy support, as well as (iv) an advanced Math language supporting BLAS operations and matrix classifications. Arrays and their autoconnection modes allow an efficient way of modeling redundant components such as front and rear park sensors or an LED matrix system containing hundreds of single dimmable lights. The strict type system and matrix classification provide means for integrated static verification of C\&C architectures at compile time minimizing bug-fixing related costs. The capabilities and benefits of the proposed language family are demonstrated by a running example of a parking assistance system.},
isbn = {978-3-319-61481-6 978-3-319-61482-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/EBGSC6L2/Kusmenko et al. - 2017 - Modeling Architectures of Cyber-Physical Systems.pdf}
}
@article{kwonReachabilityAnalysisSafety2018,
title = {Reachability {{Analysis}} for {{Safety Assurance}} of {{Cyber-Physical Systems Against Cyber Attacks}}},
author = {Kwon, Cheolhyeon and Hwang, Inseok},
date = {2018-07},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {63},
number = {7},
pages = {2272--2279},
issn = {0018-9286, 1558-2523, 2334-3303},
doi = {10.1109/TAC.2017.2761762},
url = {https://ieeexplore.ieee.org/document/8063959/},
urldate = {2023-11-03}
}
@article{langFormalVerificationApplied,
title = {Formal {{Verification Applied}} to {{Autonomous Spacecraft Attitude Control}}},
author = {Lang, Kendra and Klett, Corbin and Hawkins, Kelsey and Feron, Eric and Tsiotras, Panagiotis and Phillips, Sean},
langid = {english},
file = {/home/danesabo/Zotero/storage/3QW8ACK8/Lang et al. - Formal Verification Applied to Autonomous Spacecraf.pdf}
}
@article{langFormalVerificationApplied2021,
title = {Formal Verification Applied to Autonomous Spacecraft Attitude Control},
author = {Lang, Kendra and Klett, Corbin and Hawkins, Kelsey and Feron, Eric and Tsiotras, Panagiotis and Phillips, Sean},
date = {2021-01-01},
journaltitle = {AIAA Scitech 2021 Forum},
pages = {1--14},
publisher = {{American Institute of Aeronautics and Astronautics Inc, AIAA}},
issn = {9781624106095},
doi = {10.2514/6.2021-1126},
url = {https://arc.aiaa.org/doi/10.2514/6.2021-1126},
urldate = {2023-11-03},
abstract = {Formal verification tools are cited as an essential component to enable more widespread development and adoption of advanced autonomous systems. While numerous techniques and tools exist, the applicability of these tools to actual systems under development is currently uncertain. There are myriad reasons for such uncertainty, mostly stemming from assumptions necessary for such tools to work, such as: 1) The assumption that an underlying dynamics model or Simulink model is available, 2) The assumption that the dynamics are low-dimensional, 3) The assumption that the dynamics are linear or linearizable without sacrificing accuracy, and 4) The assumption that the underlying controllers and autonomy algorithms are available and easily modeled. This paper first presents a novel satellite benchmark that incorporates autonomous switching between multiple modes of operation related to attitude control. The result is a hybrid system with nonlinear rotational dynamics restricted to a manifold within each mode. Several open source verification tools are then applied to this benchmark to determine any results that can be drawn about the stability of the overall system. We provide a thorough comparison and discussion of the benefits and drawbacks of those tools we tested, none of which were capable of completely verifying stability requirements over the entire benchmark to the best of our efforts. We also discuss the significant hurdles that remain to implementing these tools on realistic autonomous systems, and the techniques we have found to be the most applicable. The contributions of this paper are: 1) a challenging benchmark on which developers can test their verification tools, and 2) a useful starting point to anyone who wants to apply formal methods to autonomous aerospace systems and to advance the conversation on what remains to be accomplished for these tools to be of practical use.},
file = {/home/danesabo/Zotero/storage/3VGFTA43/Lang et al. - 2021 - Formal verification applied to autonomous spacecra.pdf}
}
@online{LangleyFormalMethods,
title = {Langley {{Formal Methods}}},
url = {https://shemesh.larc.nasa.gov/fm/index.html},
organization = {Langley Formal Methods}
}
@inproceedings{lattmannComponentbasedModelingDynamic2012,
title = {Component-Based Modeling of Dynamic Systems Using Heterogeneous Composition},
booktitle = {Proceedings of the 6th {{International Workshop}} on {{Multi-Paradigm Modeling}}},
author = {Lattmann, Zsolt and Nagel, Adam and Levendovszky, Tihamer and Bapty, Ted and Neema, Sandeep and Karsai, Gabor},
date = {2012-10},
pages = {73--78},
publisher = {ACM},
location = {Innsbruck Austria},
doi = {10.1145/2508443.2508456},
url = {https://dl.acm.org/doi/10.1145/2508443.2508456},
urldate = {2023-11-08},
abstract = {Cyber-Physical Systems (CPS) are composed of computational and physical components, which includes various types of physical phenomena such as electrical and mechanical domains. Many modeling paradigms exist to model the static properties and dynamic behavior of such components. However, there is no unified modeling framework to compose components that use different paradigms and/or tools. In this paper, we present the syntax and semantics of such an integration language and its component-based design, where components can embed models from different tools, formalisms, and paradigms such as Bond Graphs and Modelica models. Our framework is built around common set of interface concepts to support heterogeneous composition and interchangeability among modeling paradigms.},
eventtitle = {{{MODELS}} '12: {{ACM}}/{{IEEE}} 15th {{International Conference}} on {{Model Driven Engineering Languages}} and {{Systems}}},
isbn = {978-1-4503-1805-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/KZ967K4F/Lattmann et al. - 2012 - Component-based modeling of dynamic systems using .pdf}
}
@online{LeanCuriousMathematician,
title = {Lean for the {{Curious Mathematician}} 2020 - {{YouTube}}},
url = {https://www.youtube.com/playlist?list=PLlF-CfQhukNlxexiNJErGJd2dte_J1t1N},
urldate = {2024-01-27}
}
@online{LeanGameServer,
title = {Lean {{Game Server}}},
url = {https://adam.math.hhu.de/},
urldate = {2024-03-20},
file = {/home/danesabo/Zotero/storage/KW86DCFW/adam.math.hhu.de.html}
}
@online{LearnYouHaskell,
title = {Learn {{You}} a {{Haskell}} for {{Great Good}}!},
url = {http://learnyouahaskell.com/},
organization = {Learn You a Haskell for Great Good!}
}
@article{leeCyberPhysicalSystems,
title = {Cyber {{Physical Systems}}: {{Design Challenges}}},
author = {Lee, Edward A},
abstract = {Cyber-Physical Systems (CPS) are integrations of computation and physical processes. Embedded computers and networks monitor and control the physical processes, usually with feedback loops where physical processes affect computations and vice versa. The economic and societal potential of such systems is vastly greater than what has been realized, and major investments are being made worldwide to develop the technology. There are considerable challenges, particularly because the physical components of such systems introduce safety and reliability requirements qualitatively different from those in generalpurpose computing. Moreover, physical components are qualitatively different from object-oriented software components. Standard abstractions based on method calls and threads do not work. This paper examines the challenges in designing such systems, and in particular raises the question of whether today’s computing and networking technologies provide an adequate foundation for CPS. It concludes that it will not be sufficient to improve design processes, raise the level of abstraction, or verify (formally or otherwise) designs that are built on today’s abstractions. To realize the full potential of CPS, we will have to rebuild computing and networking abstractions. These abstractions will have to embrace physical dynamics and computation in a unified way.},
langid = {english},
file = {/home/danesabo/Zotero/storage/LQPU663P/Lee - Cyber Physical Systems Design Challenges.pdf}
}
@article{leeExplainableAIDomain2021,
title = {Explainable {{AI}} for Domain Experts: A Post {{Hoc}} Analysis of Deep Learning for Defect Classification of {{TFT}}–{{LCD}} Panels},
author = {Lee, Minyoung and Jeon, Joohyoung and Lee, Hongchul},
date = {2021},
journaltitle = {Journal of Intelligent Manufacturing},
pages = {1--13},
publisher = {Springer},
isbn = {0956-5515},
file = {/home/danesabo/Zotero/storage/9IRNBAQZ/storage:storage:Explainable AI for domain experts: a post Hoc analysis of deep learning
for defect classification of TFT–LCD panels.pdf}
}
@article{leePresentFutureCyberPhysical2015,
title = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}: {{A Focus}} on {{Models}}},
shorttitle = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}},
author = {Lee, Edward},
date = {2015-02-26},
journaltitle = {Sensors},
shortjournal = {Sensors},
volume = {15},
number = {3},
pages = {4837--4869},
issn = {1424-8220},
doi = {10.3390/s150304837},
url = {http://www.mdpi.com/1424-8220/15/3/4837},
urldate = {2023-11-08},
abstract = {This paper is about better engineering of cyber-physical systems (CPSs) through better models. Deterministic models have historically proven extremely useful and arguably form the kingpin of the industrial revolution and the digital and information technology revolutions. Key deterministic models that have proven successful include differential equations, synchronous digital logic and single-threaded imperative programs. Cyber-physical systems, however, combine these models in such a way that determinism is not preserved. Two projects show that deterministic CPS models with faithful physical realizations are possible and practical. The first project is PRET, which shows that the timing precision of synchronous digital logic can be practically made available at the software level of abstraction. The second project is Ptides (programming temporally-integrated distributed embedded systems), which shows that deterministic models for distributed cyber-physical systems have practical faithful realizations. These projects are existence proofs that deterministic CPS models are possible and practical.},
langid = {english},
file = {/home/danesabo/Zotero/storage/KQQY8C38/Lee - 2015 - The Past, Present and Future of Cyber-Physical Sys.pdf}
}
@article{leePresentFutureCyberPhysical2015a,
title = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}: {{A Focus}} on {{Models}}},
shorttitle = {The {{Past}}, {{Present}} and {{Future}} of {{Cyber-Physical Systems}}},
author = {Lee, Edward A.},
date = {2015-03},
journaltitle = {Sensors},
volume = {15},
number = {3},
pages = {4837--4869},
publisher = {Multidisciplinary Digital Publishing Institute},
issn = {1424-8220},
doi = {10.3390/s150304837},
url = {https://www.mdpi.com/1424-8220/15/3/4837},
urldate = {2025-03-31},
abstract = {This paper is about better engineering of cyber-physical systems (CPSs) through better models. Deterministic models have historically proven extremely useful and arguably form the kingpin of the industrial revolution and the digital and information technology revolutions. Key deterministic models that have proven successful include differential equations, synchronous digital logic and single-threaded imperative programs. Cyber-physical systems, however, combine these models in such a way that determinism is not preserved. Two projects show that deterministic CPS models with faithful physical realizations are possible and practical. The first project is PRET, which shows that the timing precision of synchronous digital logic can be practically made available at the software level of abstraction. The second project is Ptides (programming temporally-integrated distributed embedded systems), which shows that deterministic models for distributed cyber-physical systems have practical faithful realizations. These projects are existence proofs that deterministic CPS models are possible and practical.},
issue = {3},
langid = {english},
keywords = {clock synchronization,cyber-physical systems,distributed systems,PRET machines,real-time systems,time synchronization},
file = {/home/danesabo/Zotero/storage/ZDNEDCIX/Lee - 2015 - The Past, Present and Future of Cyber-Physical Systems A Focus on Models.pdf}
}
@online{leeQuantifyingGeneralizingCAP2021,
title = {Quantifying and {{Generalizing}} the {{CAP Theorem}}},
author = {Lee, Edward A. and Bateni, Soroush and Lin, Shaokai and Lohstroh, Marten and Menard, Christian},
date = {2021-09-16},
eprint = {2109.07771},
eprinttype = {arXiv},
eprintclass = {cs},
url = {http://arxiv.org/abs/2109.07771},
urldate = {2023-11-08},
abstract = {In distributed applications, Brewer’s CAP theorem tells us that when networks become partitioned, there is a tradeoff between consistency and availability. Consistency is agreement on the values of shared variables across a system, and availability is the ability to respond to reads and writes accessing those shared variables. We quantify these concepts, giving numerical values to inconsistency and unavailability. Recognizing that network partitioning is not an all-or-nothing proposition, we replace the P in CAP with L, a numerical measure of apparent latency, and derive the CAL theorem, an algebraic relation between inconsistency, unavailability, and apparent latency. This relation shows that if latency becomes unbounded (e.g., the network becomes partitioned), then one of inconsistency and unavailability must also become unbounded, and hence the CAP theorem is a special case of the CAL theorem. We describe two distributed coordination mechanisms, which we have implemented as an extension of the Lingua Franca coordination language, that support arbitrary tradeoffs between consistency and availability as apparent latency varies. With centralized coordination, inconsistency remains bounded by a chosen numerical value at the cost that unavailability becomes unbounded under network partitioning. With decentralized coordination, unavailability remains bounded by a chosen numerical quantity at the cost that inconsistency becomes unbounded under network partitioning. Our centralized coordination mechanism is an extension of techniques that have historically been used for distributed simulation, an application where consistency is paramount. Our decentralized coordination mechanism is an extension of techniques that have been used in distributed databases when availability is paramount.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/UJTW62B6/Lee et al. - 2021 - Quantifying and Generalizing the CAP Theorem.pdf}
}
@inproceedings{lernerUsingHighlevelSynthesis2014,
title = {Using High-Level Synthesis and Formal Analysis to Predict and Preempt Attacks on Industrial Control Systems},
booktitle = {Proceedings of the 2014 {{ACM}}/{{SIGDA}} International Symposium on {{Field-programmable}} Gate Arrays},
author = {Lerner, Lee W. and Franklin, Zane R. and Baumann, William T. and Patterson, Cameron D.},
date = {2014-02-26},
pages = {209--212},
publisher = {ACM},
location = {Monterey California USA},
doi = {10.1145/2554688.2554759},
url = {https://dl.acm.org/doi/10.1145/2554688.2554759},
urldate = {2023-10-10},
abstract = {Industrial control systems (ICSes) have the conflicting requirements of security and network access. In the event of large-scale hostilities, factories and infrastructure would more likely be targeted by computer viruses than the bomber squadrons used in WWII. ICS zero-day exploits are now a commodity sold on brokerages to interested parties including nations. We mitigate these threats not by bolstering perimeter security, but rather by assuming that potentially all layers of ICS software have already been compromised and are capable of launching a latent attack while reporting normal system status to human operators. In our approach, application-specific configurable hardware is the final authority for scrutinizing controller commands and process sensors, and can monitor and override operations at the lowest (I/O pin) level of a configurable system-on-chip platform. The process specifications, stability-preserving backup controller, and switchover logic are specified and formally verified as C code, and synthesized into hardware to resist software reconfiguration attacks. To provide greater assurance that the backup controller can be invoked before the physical process becomes unstable, copies of the production controller task and plant model are accelerated to preview the controller’s behavior in the near future.},
eventtitle = {{{FPGA}}'14: {{The}} 2014 {{ACM}}/{{SIGDA International Symposium}} on {{Field-Programmable Gate Arrays}}},
isbn = {978-1-4503-2671-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/9RA66F7I/Lerner et al. - 2014 - Using high-level synthesis and formal analysis to .pdf}
}
@inproceedings{leroyFormalCertificationCompiler2006,
title = {Formal Certification of a Compiler Back-End or: Programming a Compiler with a Proof Assistant},
shorttitle = {Formal Certification of a Compiler Back-End Or},
booktitle = {Conference Record of the 33rd {{ACM SIGPLAN-SIGACT}} Symposium on {{Principles}} of Programming Languages},
author = {Leroy, Xavier},
date = {2006-01-11},
series = {{{POPL}} '06},
pages = {42--54},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/1111037.1111042},
url = {https://dl.acm.org/doi/10.1145/1111037.1111042},
urldate = {2024-03-25},
abstract = {This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a C-like imperative language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a certified compiler is useful in the context of formal methods applied to the certification of critical software: the certification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well.},
isbn = {978-1-59593-027-9},
file = {/home/danesabo/Zotero/storage/4U4QE9F7/Leroy - 2006 - Formal certification of a compiler back-end or pr.pdf}
}
@online{LevelSetMethods,
title = {Level Set Methods for Computing Reachable Sets of Systems with Differential Algebraic Equation Dynamics | {{IEEE Conference Publication}} | {{IEEE Xplore}}},
url = {https://ieeexplore-ieee-org.pitt.idm.oclc.org/document/4586828},
urldate = {2023-10-27}
}
@inproceedings{levesonHighpressureSteamEngines1992,
title = {High-Pressure Steam Engines and Computer Software},
booktitle = {Proceedings of the 14th International Conference on {{Software}} Engineering},
author = {Leveson, Nancy G.},
date = {1992},
pages = {2--14},
file = {/home/danesabo/Zotero/storage/78F7AYKB/steam.pdf}
}
@book{lewisOptimalControl2012,
title = {Optimal Control},
author = {Lewis, Frank L. and Vrabie, Draguna L. and Syrmos, Vassilis L.},
date = {2012},
edition = {3rd ed},
publisher = {Wiley},
location = {Hoboken},
isbn = {978-0-470-63349-6},
pagetotal = {540},
keywords = {DAS Get from Library}
}
@article{lionsHamiltonJacobiBellmanEquations1983,
title = {On the {{Hamilton-Jacobi-Bellman}} Equations},
author = {Lions, P. L.},
date = {1983-03},
journaltitle = {Acta Applicandae Mathematicae},
shortjournal = {Acta Appl Math},
volume = {1},
number = {1},
pages = {17--41},
issn = {0167-8019, 1572-9036},
doi = {10.1007/BF02433840},
url = {http://link.springer.com/10.1007/BF02433840},
urldate = {2023-11-22},
langid = {english}
}
@inproceedings{liStochasticContractsCyberphysical2017,
title = {Stochastic Contracts for Cyber-Physical System Design under Probabilistic Requirements},
booktitle = {Proceedings of the 15th {{ACM-IEEE International Conference}} on {{Formal Methods}} and {{Models}} for {{System Design}}},
author = {Li, Jiwei and Nuzzo, Pierluigi and Sangiovanni-Vincentelli, Alberto and Xi, Yugeng and Li, Dewei},
date = {2017-09-29},
pages = {5--14},
publisher = {ACM},
location = {Vienna Austria},
doi = {10.1145/3127041.3127045},
url = {https://dl.acm.org/doi/10.1145/3127041.3127045},
urldate = {2023-11-08},
abstract = {We develop an assume-guarantee contract framework for the design of cyber-physical systems, modeled as closed-loop control systems, under probabilistic requirements. We use a variant of signal temporal logic, namely, Stochastic Signal Temporal Logic (StSTL) to specify system behaviors as well as contract assumptions and guarantees, thus enabling automatic reasoning about requirements of stochastic systems. Given a stochastic linear system representation and a set of requirements captured by bounded StSTL contracts, we propose algorithms that can check contract compatibility, consistency, and refinement, and generate a controller to guarantee that a contract is satisfied, following a stochastic model predictive control approach. Our algorithms leverage encodings of the verification and control synthesis tasks into mixed integer optimization problems, and conservative approximations of probabilistic constraints that produce both sound and tractable problem formulations. We illustrate the effectiveness of our approach on a few examples, including the design of embedded controllers for aircraft power distribution networks.},
eventtitle = {{{MEMOCODE}} '17: 15th {{ACM-IEEE International Conference}} on {{Formal Methods}} and {{Models}} for {{System Design}}},
isbn = {978-1-4503-5093-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/QYRP483B/Li et al. - 2017 - Stochastic contracts for cyber-physical system des.pdf}
}
@article{liSyntheticLagrangianTurbulence2024,
title = {Synthetic {{Lagrangian}} Turbulence by Generative Diffusion Models},
author = {Li, T. and Biferale, L. and Bonaccorso, F. and Scarpolini, M. A. and Buzzicotti, M.},
date = {2024-04-17},
journaltitle = {Nature Machine Intelligence},
shortjournal = {Nat Mach Intell},
volume = {6},
number = {4},
pages = {393--403},
issn = {2522-5839},
doi = {10.1038/s42256-024-00810-0},
url = {https://www.nature.com/articles/s42256-024-00810-0},
urldate = {2024-05-20},
abstract = {Abstract Lagrangian turbulence lies at the core of numerous applied and fundamental problems related to the physics of dispersion and mixing in engineering, biofluids, the atmosphere, oceans and astrophysics. Despite exceptional theoretical, numerical and experimental efforts conducted over the past 30 years, no existing models are capable of faithfully reproducing statistical and topological properties exhibited by particle trajectories in turbulence. We propose a machine learning approach, based on a state-of-the-art diffusion model, to generate single-particle trajectories in three-dimensional turbulence at high Reynolds numbers, thereby bypassing the need for direct numerical simulations or experiments to obtain reliable Lagrangian data. Our model demonstrates the ability to reproduce most statistical benchmarks across time scales, including the fat-tail distribution for velocity increments, the anomalous power law and the increased intermittency around the dissipative scale. Slight deviations are observed below the dissipative scale, particularly in the acceleration and flatness statistics. Surprisingly, the model exhibits strong generalizability for extreme events, producing events of higher intensity and rarity that still match the realistic statistics. This paves the way for producing synthetic high-quality datasets for pretraining various downstream applications of Lagrangian turbulence.},
langid = {english},
keywords = {Diffusion,Turbulence},
file = {/home/danesabo/Zotero/storage/A6FPHV6L/Li et al. - 2024 - Synthetic Lagrangian turbulence by generative diff.pdf}
}
@incollection{liuMultiobjectiveNonlinearIdentification2001,
title = {Multiobjective {{Nonlinear Identification}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {77--100},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_4},
url = {https://doi.org/10.1007/978-1-4471-0345-5_4},
urldate = {2025-04-07},
abstract = {The identification of nonlinear systems can be posed as a nonlinear functional approximation problem. From the Weierstrass Theorem (Powell, 1981) and the Kolmogorov theorem (Sprecher, 1965) in approximation theory, it is shown that the polynomial and many other approximation schemes can approximate a continuous function arbitrarily well. In recent years, a number of nonlinear system identification approaches, particularly identification using neural networks, based on the universal approximation theorem (Cybenko, 1989), are applications of a similar mathematical approach.},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuNeuralControlApplication2001,
title = {Neural {{Control Application}} to {{Combustion Processes}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {179--192},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_9},
url = {https://doi.org/10.1007/978-1-4471-0345-5_9},
urldate = {2025-04-07},
abstract = {Combustion processes exist in many applications related to power generation, heating and propulsion; for example, steam and gas turbines, domestic and industrial burners, and jet and ramjet engines. The characteristics of these processes include not only several interacting physical phenomena but also a wide variety of dynamic behaviour. In terms of their impact on system performance, pressure oscillations are of most significance. In some applications, pressure oscillations are undesirable since they result in excessive vibration, causing high levels of acoustic noise and in extreme cases mechanical failure. In the frequency domain, the pressure is characterised by dominant peaks at discrete frequencies which correspond to the acoustic modes of the combustion chamber.},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuNeuralNetworks2001,
title = {Neural {{Networks}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {1--25},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_1},
url = {https://doi.org/10.1007/978-1-4471-0345-5_1},
urldate = {2025-04-07},
abstract = {The field of neural networks has its roots in neurobiology. The structure and functionality of neural networks has been motivated by the architecture of the human brain. Following the complex neural architecture, a neural network consists of layers of simple processing units coupled by weighted interconnections. With the development of computer technology, significant progress in neural network research has been made. A number of neural networks have been proposed in recent years.},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuNonlinearAdaptiveNeural2001,
title = {Nonlinear {{Adaptive Neural Control}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {125--141},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_6},
url = {https://doi.org/10.1007/978-1-4471-0345-5_6},
urldate = {2025-04-07},
abstract = {Neural networks are capable of learning and reconstructing complex nonlinear mappings and have been widely studied by control researchers in the design of control systems. A large number of control structures have been proposed, including supervised control (Werbos, 1990), direct inverse control (Miller et al., 1990), model reference control (Narendra and Parthasarathy, 1990), internal model control (Hunt and Sbararo, 1991), predictive control (Hunt et al., 1992; Willis et al., 1992), gain scheduling (Guez et al., 1988), optimal decision control (Fu, 1970), adaptive linear control (Chi et al., 1990), reinforcement learning control (Anderson, 1989; Barto, 1990), indirect adaptive control (Narendra and Parthasarathy, 1990; Liu et al., 1999a) and direct adaptive control (Polycarpou and Ioannou, 1991; Sanner and Slotine, 1992; Karakasoglu et al., 1993; Sadegh, 1993; Lee and Tan, 1993). The principal types of neural networks used for control problems are the multilayer perceptron neural networks with sigmoidal units (Psaltis et al., 1988; Miller et al., 1990; Narendra and Parthasarathy, 1990) and the radial basis function neural networks (Powell, 1987; Niranjan and Fallside, 1990; Poggio and Girosi, 1990a).},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@book{liuNonlinearIdentificationControl2001,
title = {Nonlinear {{Identification}} and {{Control}}},
author = {Liu, G. P.},
editor = {Grimble, Michael J. and Johnson, Michael A.},
editortype = {redactor},
date = {2001},
series = {Advances in {{Industrial Control}}},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5},
url = {http://link.springer.com/10.1007/978-1-4471-0345-5},
urldate = {2025-04-07},
isbn = {978-1-4471-1076-7 978-1-4471-0345-5},
keywords = {Adaptive control,artificial intelligence,complexity,Control,Control Engineering,development,genetic algorithms,Identification,learning,model,Modelling,Neural Networks,Nonlinear control,Wavelets},
file = {/home/danesabo/Zotero/storage/GB2UZ6SZ/(Advances in Industrial Control) G. P. Liu BEng, MEng, PhD (auth.) - Nonlinear Identification and Control_ A Neural Network Approach-Springer-Verlag London (2001).pdf;/home/danesabo/Zotero/storage/UNUL6UKU/Liu - 2001 - Nonlinear Identification and Control.pdf}
}
@incollection{liuNonlinearPredictiveNeural2001,
title = {Nonlinear {{Predictive Neural Control}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {143--161},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_7},
url = {https://doi.org/10.1007/978-1-4471-0345-5_7},
urldate = {2025-04-07},
abstract = {Predictive control is now widely used by industry and a large number of implementation algorithms, including generalised predictive control (Clarke et al., 1987), dynamic matrix control (Cutler and Ramaker, 1980), extended prediction self-adaptive control (Keyser and Cauwenberghe, 1985), predictive function control (Richalet et al., 1987), extended horizon adaptive control (Ydstie, 1984) and unified predictive control (Soeterboek et al., 1990), have appeared in the literature. Most predictive control algorithms are based on a linear model of the process. However, industrial processes usually contain complex nonlinearities and a linear model may be acceptable only when the process is operating around an equilibrium point. If the process is highly nonlinear, a nonlinear model will be necessary to describe the behaviour of the process.},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuRecursiveNonlinearIdentification2001,
title = {Recursive {{Nonlinear Identification}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {53--76},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_3},
url = {https://doi.org/10.1007/978-1-4471-0345-5_3},
urldate = {2025-04-07},
abstract = {The system identification procedure mainly consists of model structure selection and parameter estimation. The former is concerned with selecting which class of mathematical operator is to be used as a model. The latter is concerned with an estimation algorithm and usually requires input output data from the process, a class of models to be identified and a suitable identification criterion. A number of techniques have been developed in recent years for model selection and parameter estimation of nonlinear systems. Forward and backward regression algorithms were analysed in Leontaritis and Billings (1987). Stepwise regression was used in Billings and Voon (1986) and a class of orthogonal estimators were discussed in Korenberg et al. (1988). Algorithms with the objective of saving memory and allowing fast computation have been proposed in Chen and Wigger (1995). Methods to determine the a priori structural identifiability of a model have also been studied (Ljung and Glad, 1994). A survey of existing techniques of nonlinear system identification prior to the 1980s is given in Billings (1980), a survey of the structure detection of input output nonlinear systems is given in Haber and Unbehauen (1990) and a survey of nonlinear black-box modelling in system identification can be found in Sjoberg et al. (1995).},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@online{liuSecurebyConstructionSynthesisCyberPhysical2022,
title = {Secure-by-{{Construction Synthesis}} of {{Cyber-Physical Systems}}},
author = {Liu, Siyuan and Trivedi, Ashutosh and Yin, Xiang and Zamani, Majid},
date = {2022-02-14},
eprint = {2202.06677},
eprinttype = {arXiv},
eprintclass = {cs, eess},
url = {http://arxiv.org/abs/2202.06677},
urldate = {2023-10-10},
abstract = {Correct-by-construction synthesis is a cornerstone of the confluence of formal methods and control theory towards designing safety-critical systems. Instead of following the time-tested, albeit laborious (re)design-verify-validate loop, correct-by-construction methodology advocates the use of continual refinements of formal requirements—connected by chains of formal proofs—to build a system that assures the correctness by design. A remarkable progress has been made in scaling the scope of applicability of correct-byconstruction synthesis—with a focus on cyber-physical systems that tie discrete-event control with continuous environment—to enlarge control systems by combining symbolic approaches with principled state-space reduction techniques. Unfortunately, in the security-critical control systems, the security properties are verified ex post facto the design process in a way that undermines the correct-by-construction paradigm. We posit that, to truly realize the dream of correct-by-construction synthesis for security-critical systems, security considerations must take center-stage with the safety considerations. Moreover, catalyzed by the recent progress on the opacity sub-classes of security properties and the notion of hyperproperties capable of combining security with safety properties, we believe that the time is ripe for the research community to holistically target the challenge of secure-by-construction synthesis. This paper details our vision by highlighting the recent progress and open challenges that may serve as bricks for providing a solid foundation for secure-by-construction synthesis of cyber-physical systems.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/9XUH6A6I/Liu et al. - 2022 - Secure-by-Construction Synthesis of Cyber-Physical.pdf}
}
@incollection{liuSequentialNonlinearIdentification2001,
title = {Sequential {{Nonlinear Identification}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {27--52},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_2},
url = {https://doi.org/10.1007/978-1-4471-0345-5_2},
urldate = {2025-04-07},
abstract = {The identification of nonlinear systems using neural networks has become a widely studied research area in recent years. System identification mainly consists of two steps: the first is to choose an appropriate identification model and the second is to adjust the parameters of the model according to some adaptive laws so that the response of the model to an input signal can approximate the response of the real system to the same input. Since neural networks have good approximation capabilities and inherent adaptivity features, they provide a powerful tool for identification of systems with unknown nonlinearities (Antsaklis, 1990; Miller et al. 1990).},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuVariableStructureNeural2001,
title = {Variable {{Structure Neural Control}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {163--178},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_8},
url = {https://doi.org/10.1007/978-1-4471-0345-5_8},
urldate = {2025-04-07},
abstract = {Variable structure control with sliding modes was first proposed in the early 1950s (Utkin, 1964; Ernelyanov, 1967; Itkis, 1976) and has subsequently been used in the design of a wide spectrum of system types including linear and nonlinear systems, large-scale and infinite-dimensional systems, and stochastic systems. It has also been applied to a wide variety of engineering systems. The most distinguished feature of variable structure control based on sliding modes is the ability to improve the robustness of systems which are subject to uncertainty. If, however, the uncertainty exceeds the values allowed for the design, the sliding mode cannot be attained and this results in an undesirable response (Utkin, 1964). In the continuous-time case this problem was solved by combining variable structure and adaptive control (Slotine and Li, 1991), but this requires that all the system variables are available and can be measured. This case has also been discussed for linear discrete systems using input output plant models (Furuta, 1990, 1993; Hung et al., 1993; Pan and Furuta, 1995) and for nonlinear discrete systems where the input output model is unknown (Liu et al., 1997b. 1999b).},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@incollection{liuWaveletBasedNonlinear2001,
title = {Wavelet {{Based Nonlinear Identification}}},
booktitle = {Nonlinear {{Identification}} and {{Control}}: {{A Neural Network Approach}}},
author = {Liu, G. P.},
editor = {Liu, G. P.},
date = {2001},
pages = {101--124},
publisher = {Springer},
location = {London},
doi = {10.1007/978-1-4471-0345-5_5},
url = {https://doi.org/10.1007/978-1-4471-0345-5_5},
urldate = {2025-04-07},
abstract = {The approximation of general continuous functions by nonlinear networks has been widely applied to system modelling and identification. Such approximation methods are particularly useful in the black-box identification of nonlinear systems where very little a priori knowledge is available. For example, neural networks have been established as a general approximation tool for fitting nonlinear models from input output data on the basis of the universal approximation property of such networks. There has also been considerable recent interest in identification of general nonlinear systems based on radial basis networks (Poggio and Girosi, 1990a,b), fuzzy sets and rules (Zadeh, 1994), neural-fuzzy networks (Brown and Harris, 1994; Wang et al., 1995) and hining hyperplanes (Breiman, 1993).},
isbn = {978-1-4471-0345-5},
langid = {english}
}
@article{lopez-miguelPLCverifStatusFormal2022,
title = {{{PLCverif}}: {{Status}} of a {{Formal Verification Tool}} for {{Programmable Logic Controller}}},
shorttitle = {{{PLCverif}}},
author = {Lopez-Miguel, Ignacio D. and Tournier, Jean-Charles and Adiego, Borja Fernandez},
date = {2022},
journaltitle = {Proceedings of the 18th International Conference on Accelerator and Large Experimental Physics Control Systems},
volume = {ICALEPCS2021},
eprint = {2203.17253},
eprinttype = {arXiv},
eprintclass = {cs},
pages = {5 pages, 0.147 MB},
issn = {2226-0358},
doi = {10.18429/JACoW-ICALEPCS2021-MOPV042},
url = {http://arxiv.org/abs/2203.17253},
urldate = {2024-08-08},
abstract = {Programmable Logic Controllers (PLC) are widely used for industrial automation including safety systems at CERN. The incorrect behaviour of the PLC control system logic can cause significant financial losses by damage of property or the environment or even injuries in some cases, therefore ensuring their correct behaviour is essential. While testing has been for many years the traditional way of validating the PLC control system logic, CERN developed a model checking platform to go one step further and formally verify PLC logic. This platform, called PLCverif, first released internally for CERN usage in 2019, is now available to anyone since September 2020 via an open source licence. In this paper, we will first give an overview of the PLCverif platform capabilities before focusing on the improvements done since 2019 such as the larger support coverage of the Siemens PLC programming languages, the better support of the C Bounded Model Checker backend (CBMC) and the process of releasing PLCverif as an open-source software.},
keywords = {Computer Science - Software Engineering},
file = {/home/danesabo/Zotero/storage/XAG39WDC/Lopez-Miguel et al. - 2022 - PLCverif Status of a Formal Verification Tool for.pdf;/home/danesabo/Zotero/storage/AKP5GGFY/2203.html}
}
@online{lundbergConsistentIndividualizedFeature2019,
title = {Consistent {{Individualized Feature Attribution}} for {{Tree Ensembles}}},
author = {Lundberg, Scott M. and Erion, Gabriel G. and Lee, Su-In},
date = {2019-03-06},
eprint = {1802.03888},
eprinttype = {arXiv},
eprintclass = {cs, stat},
url = {http://arxiv.org/abs/1802.03888},
urldate = {2023-10-11},
abstract = {Interpreting predictions from tree ensemble methods such as gradient boosting machines and random forests is important, yet feature attribution for trees is often heuristic and not individualized for each prediction. Here we show that popular feature attribution methods are inconsistent, meaning they can lower a feature’s assigned importance when the true impact of that feature actually increases. This is a fundamental problem that casts doubt on any comparison between features. To address it we turn to recent applications of game theory and develop fast exact tree solutions for SHAP (SHapley Additive exPlanation) values, which are the unique consistent and locally accurate attribution values. We then extend SHAP values to interaction effects and define SHAP interaction values. We propose a rich visualization of individualized feature attributions that improves over classic attribution summaries and partial dependence plots, and a unique “supervised” clustering (clustering based on feature attributions). We demonstrate better agreement with human intuition through a user study, exponential improvements in run time, improved clustering performance, and better identification of influential features. An implementation of our algorithm has also been merged into XGBoost and LightGBM, see http://github.com/slundberg/shap for details.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/IX57CTJX/Lundberg et al. - 2019 - Consistent Individualized Feature Attribution for .pdf}
}
@online{lundbergUnifiedApproachInterpreting2017,
title = {A {{Unified Approach}} to {{Interpreting Model Predictions}}},
author = {Lundberg, Scott and Lee, Su-In},
date = {2017-11-24},
eprint = {1705.07874},
eprinttype = {arXiv},
eprintclass = {cs, stat},
url = {http://arxiv.org/abs/1705.07874},
urldate = {2023-10-11},
abstract = {Understanding why a model makes a certain prediction can be as crucial as the prediction’s accuracy in many applications. However, the highest accuracy for large modern datasets is often achieved by complex models that even experts struggle to interpret, such as ensemble or deep learning models, creating a tension between accuracy and interpretability. In response, various methods have recently been proposed to help users interpret the predictions of complex models, but it is often unclear how these methods are related and when one method is preferable over another. To address this problem, we present a unified framework for interpreting predictions, SHAP (SHapley Additive exPlanations). SHAP assigns each feature an importance value for a particular prediction. Its novel components include: (1) the identification of a new class of additive feature importance measures, and (2) theoretical results showing there is a unique solution in this class with a set of desirable properties. The new class unifies six existing methods, notable because several recent methods in the class lack the proposed desirable properties. Based on insights from this unification, we present new methods that show improved computational performance and/or better consistency with human intuition than previous approaches.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/NGGDHXKJ/Lundberg and Lee - 2017 - A Unified Approach to Interpreting Model Predictio.pdf}
}
@article{maccaroneADVANCEDREACTORCYBER,
title = {{{ADVANCED REACTOR CYBER ANALYSIS AND DEVELOPMENT ENVIRONMENT}} ({{ARCADE}}) {{FOR UNIVERSITY RESEARCH}}},
author = {Maccarone, L T and Hahn, A S and Valme, R and Rowland, M T and Kapuria, A and Zhang, Y and Cole, D G},
langid = {english},
file = {/home/danesabo/Zotero/storage/UKVJXBAU/Maccarone et al. - ADVANCED REACTOR CYBER ANALYSIS AND DEVELOPMENT EN.pdf}
}
@book{mackenzieMechanizingProofComputing2004,
title = {Mechanizing Proof: Computing, Risk, and Trust},
author = {MacKenzie, Donald},
date = {2004},
publisher = {MIT Press},
isbn = {0-262-63295-0}
}
@article{magerPreparingInstructionalObjectives1962,
title = {Preparing Instructional Objectives.},
author = {Mager, Robert F.},
date = {1962},
publisher = {ERIC}
}
@article{mahboubiFormallyVerifiedApproximations2019,
title = {Formally {{Verified Approximations}} of {{Definite Integrals}}},
author = {Mahboubi, Assia and Melquiond, Guillaume and Sibut-Pinote, Thomas},
date = {2019},
journaltitle = {Journal of Automated Reasoning},
volume = {62},
number = {2},
pages = {281},
doi = {10.1007/s10817-018-9463-7},
url = {https://inria.hal.science/hal-01630143},
urldate = {2024-01-16},
abstract = {Finding an elementary form for an antiderivative is often a difficult task, so numerical integration has become a common tool when it comes to making sense of a definite integral. Some of the numerical integration methods can even be made rigorous: not only do they compute an approximation of the integral value but they also bound its inaccuracy. Yet numerical integration is still missing from the toolbox when performing formal proofs in analysis. This paper presents an efficient method for automatically computing and proving bounds on some definite integrals inside the Coq formal system. Our approach is not based on traditional quadrature methods such as Newton-Cotes formulas. Instead, it relies on computing and evaluating antiderivatives of rigorous polynomial approximations, combined with an adaptive domain splitting. Our approach also handles improper integrals, provided that a factor of the integrand belongs to a catalog of identified integrable functions. This work has been integrated to the CoqInterval library.},
langid = {english},
file = {/home/danesabo/Zotero/storage/WN8BJBC6/Mahboubi et al. - 2019 - Formally Verified Approximations of Definite Integ.pdf}
}
@inproceedings{malechaFoundationalVerificationCyberphysical2016,
title = {Towards Foundational Verification of Cyber-Physical Systems},
booktitle = {2016 {{Science}} of {{Security}} for {{Cyber-Physical Systems Workshop}} ({{SOSCYPS}})},
author = {Malecha, Gregory and Ricketts, Daniel and Alvarez, Mario M. and Lerner, Sorin},
date = {2016-04},
pages = {1--5},
doi = {10.1109/SOSCYPS.2016.7580000},
url = {https://ieeexplore.ieee.org/document/7580000},
urldate = {2024-03-19},
abstract = {The safety-critical aspects of cyber-physical systems motivate the need for rigorous analysis of these systems. In the literature this work is often done using idealized models of systems where the analysis can be carried out using high-level reasoning techniques such as Lyapunov functions and model checking. In this paper we present VERIDRONE, a foundational framework for reasoning about cyber-physical systems at all levels from high-level models to C code that implements the system. VERIDRONE is a library within the Coq proof assistant enabling us to build on its foundational implementation, its interactive development environments, and its wealth of libraries capturing interesting theories ranging from real numbers and differential equations to verified compilers and floating point numbers. These features make proof assistants in general, and Coq in particular, a powerful platform for unifying foundational results about safety-critical systems and ensuring interesting properties at all levels of the stack.},
eventtitle = {2016 {{Science}} of {{Security}} for {{Cyber-Physical Systems Workshop}} ({{SOSCYPS}})},
file = {/home/danesabo/Zotero/storage/K8QCKAMR/Malecha et al. - 2016 - Towards foundational verification of cyber-physica.pdf;/home/danesabo/Zotero/storage/JSRG9GY2/7580000.html}
}
@inproceedings{marinoDesignWorldFIPsIndustrial1999,
title = {Design of {{WorldFIP}}'s Industrial Communication Systems Based on Formal Methods},
booktitle = {{{ISIE}} '99. {{Proceedings}} of the {{IEEE International Symposium}} on {{Industrial Electronics}} ({{Cat}}. {{No}}.{{99TH8465}})},
author = {Marino, P. and Poza, F. and Dominguez, M.A. and Nogueira, J.B.},
date = {1999},
volume = {3},
pages = {1427--1432},
publisher = {IEEE},
location = {Bled, Slovenia},
doi = {10.1109/ISIE.1999.796924},
url = {http://ieeexplore.ieee.org/document/796924/},
urldate = {2023-10-10},
eventtitle = {{{ISIE}} '99. {{IEEE International Symposium}} on {{Industrial Electronics}}},
isbn = {978-0-7803-5662-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/TTWPVD64/Marino et al. - 1999 - Design of WorldFIP's industrial communication syst.pdf}
}
@article{marinoPROFIBUSFormalSpecification2001,
title = {The {{PROFIBUS}} Formal Specification: A Comparison between Two {{FDTs}}},
author = {Marino, P and Nogueira, J and Sigu, C},
date = {2001},
journaltitle = {Computer Networks},
abstract = {Formal description languages, like ESTELLE [7], Language Temporary Of Ordering Speci®cation (LOTOS) [8] or Speci®cation Description Language (SDL) [9], allow us to specify complex system requirements in an ambiguities free and complete way [26]. The choice of what formal language to use in a particular system speci®cation must be taken a priori by the system designer [5]. It would be useful to have comparative information about systems described with some of these languages, to know which one would ®t better to that system. The literature published on this topic [1,14,22] compares too simple systems. This paper deals with this aspect and compares the formal speci®cation of the PROcess FIeld BUS (PROFIBUS) communications protocol in both languages LOTOS and SDL. Ó 2001 Elsevier Science B.V. All rights reserved.},
langid = {english},
file = {/home/danesabo/Zotero/storage/NI2HU9JG/Marino et al. - 2001 - The PROFIBUS formal speci®cation a comparison bet.pdf}
}
@article{martin-dorelEnablingFloatingPointArithmetic2023,
title = {Enabling {{Floating-Point Arithmetic}} in the {{Coq Proof Assistant}}},
author = {Martin-Dorel, Érik and Melquiond, Guillaume and Roux, Pierre},
date = {2023-09-16},
journaltitle = {Journal of Automated Reasoning},
shortjournal = {J Autom Reasoning},
volume = {67},
number = {4},
pages = {33},
issn = {1573-0670},
doi = {10.1007/s10817-023-09679-x},
url = {https://doi.org/10.1007/s10817-023-09679-x},
urldate = {2024-01-16},
abstract = {Floating-point arithmetic is a well-known and extremely efficient way of performing approximate computations over the real numbers. Although it requires some careful considerations, floating-point numbers are nowadays routinely used to prove mathematical theorems. Numerical computations have been applied in the context of formal proofs too, as illustrated by the CoqInterval library. But these computations do not benefit from the powerful floating-point units available in modern processors, since they are emulated inside the logic of the formal system. This paper experiments with the use of hardware floating-point numbers for numerically intensive proofs verified by the Coq proof assistant. This gives rise to various questions regarding the formalization, the implementation, the usability, and the level of trust. This approach has been applied to the CoqInterval and ValidSDP libraries, which demonstrates a speedup of at least one order of magnitude.},
langid = {english},
file = {/home/danesabo/Zotero/storage/82P2G29A/Martin-Dorel et al. - 2023 - Enabling Floating-Point Arithmetic in the Coq Proo.pdf}
}
@article{martinFormalMethodsScale2022,
title = {Formal {{Methods}} at {{Scale}}},
author = {Martin, William and Lincoln, Patrick and Scherlis, William},
date = {2022-05},
journaltitle = {IEEE Security \& Privacy},
shortjournal = {IEEE Secur. Privacy},
volume = {20},
number = {3},
pages = {22--23},
issn = {1540-7993, 1558-4046},
doi = {10.1109/MSEC.2022.3158842},
url = {https://ieeexplore.ieee.org/document/9782881/},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/X7F3C93K/Martin et al. - 2022 - Formal Methods at Scale.pdf}
}
@article{massotWhyFormalizeMathematics,
title = {Why Formalize Mathematics?},
author = {Massot, Patrick},
abstract = {We’ve been doing mathematics for more than two thousand years with remarkable success. Hence it is natural to be puzzled by people investing a lot of time and energy into a very new and weird way of doing mathematics: the formalized way where human beings explain mathematical definitions and proofs to computers. Beyond puzzlement, some people are wary. They think the traditional way may disappear, or maybe even mathematicians may disappear, being replaced by AI agents. These events are extremely unlikely and they are not the goals of the mathematical formalization community. We want to add to our tool set, without loosing anything we already have. In this text I’ll explain what we want to add, distinguishing what already partially exists and what is currently science fiction. Examples will use Lean, a proof assistant software developed mostly by Leonardo de Moura at Microsoft Research, but everything I’ll write applies to other proof assistants such as Coq or Isabelle.},
langid = {english},
file = {/home/danesabo/Zotero/storage/J6A3C387/Massot - Why formalize mathematics.pdf}
}
@online{MathlibStatistics,
title = {Mathlib Statistics},
url = {https://leanprover-community.github.io/mathlib_stats.html},
urldate = {2024-01-28}
}
@inproceedings{mclaughlinControllerawareFalseData2014,
title = {Controller-Aware False Data Injection against Programmable Logic Controllers},
booktitle = {2014 {{IEEE International Conference}} on {{Smart Grid Communications}} ({{SmartGridComm}})},
author = {McLaughlin, Stephen and Zonouz, Saman},
date = {2014-11},
pages = {848--853},
doi = {10.1109/SmartGridComm.2014.7007754},
url = {https://ieeexplore.ieee.org/abstract/document/7007754?casa_token=5fHXmr3Mw0gAAAAA:MwJ9mQcpKC7sgnJWqqUnn8wpx4Xs3qWnul5Vmski8Q9Key0ZrsnuqOPyxXKzONdiNpv7Dc_Oews},
urldate = {2024-08-08},
abstract = {Control systems rely on accurate sensor measurements to safely regulate physical processes. In False Data Injection (FDI) attacks, adversaries inject forged sensor measurements into a control system in hopes of misguiding control algorithms into taking dangerous actions. Traditional FDI attacks mostly require adversaries to know the full system topology, i.e., hundreds or thousands of lines and buses, while having unpredictable consequences. In this paper, we present a new class of FDI attacks directly against individual Programmable Logic Controllers (PLCs), which are ubiquitous in power generation and distribution. Our attack allows the adversary to have only partial information about the victim subsystem, and produces a predictable malicious result. Our attack tool analyzes an I/O trace of the compromised PLCs to produce a set of inputs to achieve the desired PLC outputs, i.e., the system behavior. It proceeds in two steps. First, our tool constructs a model of the PLC's internal logic from the I/O traces. Second, it searches for a set of inputs that cause the model to calculate the desired malicious behavior. We evaluate our tool against a set of representative control systems and show that it is a practical threat against insecure sensor configurations.},
eventtitle = {2014 {{IEEE International Conference}} on {{Smart Grid Communications}} ({{SmartGridComm}})},
keywords = {Automata,Control systems,Power systems,Process control,Servers,State estimation,Vectors},
file = {/home/danesabo/Zotero/storage/XRHNBS62/McLaughlin and Zonouz - 2014 - Controller-aware false data injection against prog.pdf;/home/danesabo/Zotero/storage/Q2LEVUCB/7007754.html}
}
@online{mehravariKotletPersianGround,
title = {Kotlet ({{Persian Ground Meat}} and {{Potato Patties}})},
author = {Mehravari, Nader},
url = {https://www.seriouseats.com/kotlet-persian-ground-meat-and-potato-patties-recipe-8421664},
urldate = {2025-03-31},
abstract = {These versatile pan-fried patties are made from a mixture of ground meat, eggs, and finely mashed (or riced) boiled potatoes.},
langid = {english},
organization = {Serious Eats},
file = {/home/danesabo/Zotero/storage/SEUYPVRI/kotlet-persian-ground-meat-and-potato-patties-recipe-8421664.html}
}
@article{meinsmaElementaryProofRouthHurwitz1995,
title = {Elementary Proof of the {{Routh-Hurwitz}} Test},
author = {Meinsma, Gjerrit},
date = {1995-07},
journaltitle = {Systems \& Control Letters},
shortjournal = {Systems \& Control Letters},
volume = {25},
number = {4},
pages = {237--242},
issn = {01676911},
doi = {10.1016/0167-6911(94)00089-E},
url = {https://linkinghub.elsevier.com/retrieve/pii/016769119400089E},
urldate = {2024-03-04},
abstract = {This note presents an elementary proof of the familiar Routh-Hurwitz test. The proof is basically one continuity argument, it does not rely on Sturm chains, Cauchy index and the principle of the argument and it is fully self-contained. In the same style an extended Routh-Hurwitz test is derived, which finds the inertia of polynomials.},
langid = {english},
file = {/home/danesabo/Zotero/storage/MBKYJJGI/Meinsma - 1995 - Elementary proof of the Routh-Hurwitz test.pdf}
}
@article{mendelsonIntroductionMathematicalLogic,
title = {Introduction to {{Mathematical Logic}}, {{Sixth Edition}}},
author = {Mendelson, Elliott},
langid = {english},
file = {/home/danesabo/Zotero/storage/D6ICBWW3/Mendelson - Introduction to Mathematical Logic, Sixth Edition.pdf}
}
@article{mengODERUDynamicalSystem2022,
title = {{{ODE-RU}}: A Dynamical System View on Recurrent Neural Networks},
shorttitle = {{{ODE-RU}}},
author = {Meng, Pinchao and Wang, Xinyu and Yin, Weishi},
date = {2022},
journaltitle = {Electronic Research Archive},
shortjournal = {era},
volume = {30},
number = {1},
pages = {257--271},
issn = {2688-1594},
doi = {10.3934/era.2022014},
url = {http://www.aimspress.com/article/doi/10.3934/era.2022014},
urldate = {2024-01-30},
abstract = {{$<$}abstract{$><$}p{$>$}The core of the demonstration of this paper is to interpret the forward propagation process of machine learning as a parameter estimation problem of nonlinear dynamical systems. This process is to establish a connection between the Recurrent Neural Network and the discrete differential equation, so as to construct a new network structure: ODE-RU. At the same time, under the inspiration of the theory of ordinary differential equations, we propose a new forward propagation mode. In a large number of simulations and experiments, the forward propagation not only shows the trainability of the new architecture, but also achieves a low training error on the basis of main-taining the stability of the network. For the problem requiring long-term memory, we specifically study the obstacle shape reconstruction problem using the backscattering far-field features data set, and demonstrate the effectiveness of the proposed architecture using the data set. The results show that the network can effectively reduce the sensitivity to small changes in the input feature. And the error generated by the ordinary differential equation cyclic unit network in inverting the shape and position of obstacles is less than \$ 10\textasciicircum\{-2\} \$.{$<$}/p{$><$}/abstract{$>$}}
}
@inproceedings{mercaldoRealTimeSCADAAttack2019,
title = {Real-{{Time SCADA Attack Detection}} by {{Means}} of {{Formal Methods}}},
booktitle = {2019 {{IEEE}} 28th {{International Conference}} on {{Enabling Technologies}}: {{Infrastructure}} for {{Collaborative Enterprises}} ({{WETICE}})},
author = {Mercaldo, Francesco and Martinelli, Fabio and Santone, Antonella},
date = {2019-06},
pages = {231--236},
publisher = {IEEE},
location = {Napoli, Italy},
doi = {10.1109/WETICE.2019.00057},
url = {https://ieeexplore.ieee.org/document/8795430/},
urldate = {2023-10-10},
abstract = {SCADA control systems use programmable logic controller to interface with critical machines. SCADA systems are used in critical infrastructures, for instance, to control smart grid, oil pipelines, water distribution and chemical manufacturing plants: an attacker taking control of a SCADA system could cause various damages, both to the infrastructure but also to people (for instance, adding chemical substances into a water distribution systems). In this paper we propose a method to detect attacks targeting SCADA systems. We exploit model checking, in detail we model logs from SCADA systems into a network of timed automata and, through timed temporal logic, we characterize the behaviour of a SCADA system under attack. Experiments performed on a SCADA water distribution system confirmed the effectiveness of the proposed method.},
eventtitle = {2019 {{IEEE}} 28th {{International Conference}} on {{Enabling Technologies}}: {{Infrastructure}} for {{Collaborative Enterprises}} ({{WETICE}})},
isbn = {978-1-72810-676-2},
langid = {english},
file = {/home/danesabo/Zotero/storage/VRHTCPS3/Mercaldo et al. - 2019 - Real-Time SCADA Attack Detection by Means of Forma.pdf}
}
@article{mercerSynthesizingVerifiedComponents2023,
title = {Synthesizing Verified Components for Cyber Assured Systems Engineering},
author = {Mercer, Eric and Slind, Konrad and Amundson, Isaac and Cofer, Darren and Babar, Junaid and Hardin, David},
date = {2023-10},
journaltitle = {SOFTWARE AND SYSTEMS MODELING},
shortjournal = {Softw. Syst. Model.},
volume = {22},
number = {5},
pages = {1451--1471},
publisher = {Springer Heidelberg},
location = {Heidelberg},
issn = {1619-1366, 1619-1374},
doi = {10.1007/s10270-023-01096-3},
url = {https://www.webofscience.com/api/gateway?GWVersion=2&SrcAuth=DynamicDOIArticle&SrcApp=UA&KeyAID=10.1007%2Fs10270-023-01096-3&DestApp=DOI&SrcAppSID=USW2EC0EC1PuWMCSXOYkyOwTcd6Fm&SrcJTitle=SOFTWARE+AND+SYSTEMS+MODELING&DestDOIRegistrantName=Springer-Verlag},
urldate = {2023-12-13},
abstract = {Safety-critical systems such as avionics need to be engineered to be cyber resilient meaning that systems are able to detect and recover from attacks or safely shutdown. As there are few development tools for cyber resiliency, designers rely on guidelines and checklists, sometimes missing vulnerabilities until late in the process where remediation is expensive. Our solution is a model-based approach with cyber resilience-improving transforms that insert high-assurance components such as filters to block malicious data or monitors to detect and alarm anomalous behavior. Novel is our use of model checking and a verified compiler to specify, verify, and synthesize these components. We define code contracts as formal specifications that designers write for high-assurance components, and test contracts as tests to validate their behavior. A model checker proves whether or not code contracts satisfy test contracts in an iterative development cycle. The same model checker also proves whether or not a system with the inserted components, assuming they adhere to their code contracts, provides the desired cyber resiliency for the system. We define an algorithm to synthesize implementations for code contracts in a semantics-preserving way that is backed by a verified compiler. The entire workflow is implemented as part of the open source BriefCASE toolkit. We report on our experience using BriefCASE with a case study on a UAV system that is transformed to be cyber resilient to communication and supply chain cyber attacks. Our case study demonstrates that writing code contracts and then synthesizing correct implementations from them are feasible in real-world systems engineering for cyber resilience.},
langid = {english},
pagetotal = {21},
keywords = {Important},
annotation = {Web of Science ID: WOS:000953658900001}
}
@online{MethodQuantifyingProgram,
title = {A {{Method}} of {{Quantifying Program}} and {{Course Performances}} against {{ABET Criteria}} - {{Knovel}}},
url = {https://app-knovel-com.pitt.idm.oclc.org/web/view/khtml/show.v/rcid:kpANTECPS4/cid:kt003RZTC2/viewerType:khtml//root_slug:antec-2005-plastics-annual/url_slug:method-quantifying-program?b-q=designing%20and%20teaching%20courses%20to%20satisfy%20the%20abet%20engineering%20criteria&include_synonyms=no&s_page_no=0&sort_on=default&view=collapsed&zoom=1&page=1&q=designing%20and%20teaching%20courses%20to%20satisfy%20the%20abet%20engineering%20criteria},
urldate = {2024-01-30},
file = {/home/danesabo/Zotero/storage/RL3C8W53/A Method of Quantifying Program and Course Perform.pdf;/home/danesabo/Zotero/storage/JU5QLJ9F/url_slugmethod-quantifying-program.html}
}
@online{micaliCompactCertificatesCollective2020,
title = {Compact {{Certificates}} of {{Collective Knowledge}}},
author = {Micali, Silvio and Reyzin, Leonid and Vlachos, Georgios and Wahby, Riad S. and Zeldovich, Nickolai},
date = {2020},
number = {2020/1568},
url = {https://eprint.iacr.org/2020/1568},
urldate = {2024-04-01},
abstract = {We introduce compact certificate schemes, which allow any party to take a large number of signatures on a message M, by many signers of different weights, and compress them to a much shorter certificate. This certificate convinces the verifiers that signers with sufficient total weight signed M, even though the verifier will not see---let alone verify---all of the signatures. Thus, for example, a compact certificate can be used to prove that parties who jointly have a sufficient total account balance have attested to a given block in a blockchain. After defining compact certificates, we demonstrate an efficient compact certificate scheme. We then show how to implement such a scheme in a decentralized setting over an unreliable network and in the presence of adversarial parties who wish to disrupt certificate creation. Our evaluation shows that compact certificates are 50-280× smaller and 300-4000× cheaper to verify than a natural baseline approach.},
pubstate = {prepublished},
annotation = {Publication info: Published elsewhere. IEEE S\&P 2021},
file = {/home/danesabo/Zotero/storage/WPMWJK8Q/Micali et al. - 2020 - Compact Certificates of Collective Knowledge.pdf}
}
@article{michaelFormalMethodsCyberphysical2021,
title = {Formal {{Methods}} in {{Cyberphysical Systems}}},
author = {Michael, James Bret and Drusinsky, Doron and Wijesekera, Duminda},
date = {2021-09},
journaltitle = {Computer},
shortjournal = {Computer},
volume = {54},
number = {9},
pages = {25--29},
issn = {0018-9162, 1558-0814},
doi = {10.1109/MC.2021.3089267},
url = {https://ieeexplore.ieee.org/document/9524651/},
urldate = {2023-10-10},
langid = {english},
file = {/home/danesabo/Zotero/storage/7B6RY3FU/Michael et al. - 2021 - Formal Methods in Cyberphysical Systems.pdf}
}
@book{michelStabilityDynamicalSystems2008,
title = {Stability of Dynamical Systems: Continuous, Discontinuous, and Discrete Systems},
shorttitle = {Stability of Dynamical Systems},
author = {Michel, Anthony N. and Hou, Ling and Liu, Derong},
date = {2008},
series = {Systems \& Control: Foundations \& Applications},
publisher = {Birkhäuser},
location = {Boston Basel Berlin},
isbn = {978-0-8176-4486-4},
langid = {english},
pagetotal = {501},
keywords = {DAS Get from Library},
file = {/home/danesabo/Zotero/storage/LRYF79TY/Michel et al. - 2008 - Stability of dynamical systems continuous, discon.pdf}
}
@article{mihalicHardwareintheLoopSimulationsHistorical2022,
title = {Hardware-in-the-{{Loop Simulations}}: {{A Historical Overview}} of {{Engineering Challenges}}},
shorttitle = {Hardware-in-the-{{Loop Simulations}}},
author = {Mihalič, Franc and Truntič, Mitja and Hren, Alenka},
date = {2022-01},
journaltitle = {Electronics},
volume = {11},
number = {15},
pages = {2462},
publisher = {Multidisciplinary Digital Publishing Institute},
issn = {2079-9292},
doi = {10.3390/electronics11152462},
url = {https://www.mdpi.com/2079-9292/11/15/2462},
urldate = {2024-08-08},
abstract = {The design of modern industrial products is further improved through the hardware-in-the-loop (HIL) simulation. Realistic simulation is enabled by the closed loop between the hardware under test (HUT) and real-time simulation. Such a system involves a field programmable gate array (FPGA) and digital signal processor (DSP). An HIL model can bypass serious damage to the real object, reduce debugging cost, and, finally, reduce the comprehensive effort during the testing. This paper provides a historical overview of HIL simulations through different engineering challenges, i.e., within automotive, power electronics systems, and different industrial drives. Various platforms, such as National Instruments, dSPACE, Typhoon HIL, or MATLAB Simulink Real-Time toolboxes and Speedgoat hardware systems, offer a powerful tool for efficient and successful investigations in different fields. Therefore, HIL simulation practice must begin already during the university’s education process to prepare the students for professional engagements in the industry, which was also verified experimentally at the end of the paper.},
issue = {15},
langid = {english},
keywords = {automotive,controller-in-the-loop (CIL),DC-DC converters,electric drives,grid applications,hardware-in-the-loop (HIL),inverter systems,power hardware-in-the-loop (PHIL),railway systems},
file = {/home/danesabo/Zotero/storage/NBUPXUBL/Mihalič et al. - 2022 - Hardware-in-the-Loop Simulations A Historical Ove.pdf}
}
@inproceedings{millerDistributedTrustedWeb2020,
title = {A {{Distributed}} and {{Trusted Web}} of~{{Formal Proofs}}},
booktitle = {Distributed {{Computing}} and {{Internet Technology}}},
author = {Miller, Dale},
editor = {Hung, Dang Van and D´Souza, Meenakshi},
date = {2020},
pages = {21--40},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-36987-3_2},
abstract = {Most computer checked proofs are tied to the particular technology of a prover’s software. While sharing results between proof assistants is a recognized and desirable goal, the current organization of theorem proving tools makes such sharing an exception instead of the rule. In this talk, I argue that we need to turn the current architecture of proof assistants and formal proofs inside-out. That is, instead of having a few mature theorem provers include within them their formally checked theorems and proofs, I propose that proof assistants should sit on the edge of a web of formal proofs and that proof assistant should be exporting their proofs so that they can exist independently of any theorem prover. While it is necessary to maintain the dependencies between definitions, theories, and theorems, no explicit library structure should be imposed on this web of formal proofs. Thus a theorem and its proofs should not necessarily be located at a particular URL or within a particular prover’s library. While the world of symbolic logic and proof theory certainly allows for proofs to be seen as global and permanent objects, there is a lot of research and engineering work that is needed to make this possible. I describe some of the required research and development that must be done to achieve this goal.},
isbn = {978-3-030-36987-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/URRHF3FX/Miller et al. - 2020 - A Distributed and Trusted Web of Formal Proofs.pdf}
}
@article{millerExplanationArtificialIntelligence2019,
title = {Explanation in Artificial Intelligence: {{Insights}} from the Social Sciences},
author = {Miller, Tim},
date = {2019},
journaltitle = {Artificial intelligence},
volume = {267},
pages = {1--38},
publisher = {Elsevier},
isbn = {0004-3702},
file = {/home/danesabo/Zotero/storage/87FCQ2AA/storage:storage:Explanation in Artificial Intelligence:
Insights from the Social Sciences.pdf}
}
@video{mitcbmmDiffusionScoreBasedGenerative2023,
entrysubtype = {video},
title = {Diffusion and {{Score-Based Generative Models}}},
editor = {{MITCBMM}},
editortype = {director},
date = {2023-01-17},
url = {https://www.youtube.com/watch?v=wMmqCMwuM2Q},
urldate = {2023-10-10},
abstract = {Yang Song, Stanford University Generating data with complex patterns, such as images, audio, and molecular structures, requires fitting very flexible statistical models to the data distribution. Even in the age of deep neural networks, building such models is difficult because they typically require an intractable normalization procedure to represent a probability distribution. To address this challenge, we consider modeling the vector field of gradients of the data distribution (known as the score function), which does not require normalization and therefore can take full advantage of the flexibility of deep neural networks. I will show how to (1) estimate the score function from data with flexible deep neural networks and efficient statistical methods, (2) generate new data using stochastic differential equations and Markov chain Monte Carlo, and even (3) evaluate probability values accurately as in a traditional statistical model. The resulting method, called score-based generative modeling or diffusion modeling, achieves record performance in applications including image synthesis, text-to-speech generation, time series prediction, and point cloud generation, challenging the long-time dominance of generative adversarial networks (GANs) on many of these tasks. Furthermore, score-based generative models are particularly suitable for Bayesian reasoning tasks such as solving ill-posed inverse problems, yielding superior performance on several tasks in medical image reconstruction.}
}
@article{mitchellFlexibleExtensibleEfficient2008,
title = {The {{Flexible}}, {{Extensible}} and {{Efficient Toolbox}} of~{{Level~Set Methods}}},
author = {Mitchell, Ian M.},
date = {2008-06-01},
journaltitle = {Journal of Scientific Computing},
shortjournal = {J Sci Comput},
volume = {35},
number = {2},
pages = {300--329},
issn = {1573-7691},
doi = {10.1007/s10915-007-9174-4},
url = {https://doi.org/10.1007/s10915-007-9174-4},
urldate = {2023-10-12},
abstract = {Level set methods are a popular and powerful class of numerical algorithms for dynamic implicit surfaces and solution of Hamilton-Jacobi PDEs. While the advanced level set schemes combine both efficiency and accuracy, their implementation complexity makes it difficult for the community to reproduce new results and make quantitative comparisons between methods. This paper describes the Toolbox of Level Set Methods, a collection of Matlab routines implementing the basic level set algorithms on fixed Cartesian grids for rectangular domains in arbitrary dimension. The Toolbox’s code and interface are designed to permit flexible combinations of different schemes and PDE forms, allow easy extension through the addition of new algorithms, and achieve efficient execution despite the fact that the code is entirely written as m-files. The current contents of the Toolbox and some coding patterns important to achieving its flexibility, extensibility and efficiency are briefly explained, as is the process of adding two new algorithms. Code for both the Toolbox and the new algorithms is available from the Web.},
langid = {english},
file = {/home/danesabo/Zotero/storage/EVFD54ZF/Mitchell - 2008 - The Flexible, Extensible and Efficient Toolbox of .pdf}
}
@article{mitchellOverapproximatingReachableSets2003,
title = {Overapproximating {{Reachable Sets}} by {{Hamilton-Jacobi Projections}}},
author = {Mitchell, Ian M and Tomlin, Claire J},
date = {2003},
journaltitle = {Journal of Scientific Computing},
volume = {19},
number = {1--3},
langid = {english},
file = {/home/danesabo/Zotero/storage/DYQGKXFC/Mitchell and Tomlin - Overapproximating Reachable Sets by Hamilton-Jacob.pdf}
}
@article{mitchellTimedependentHamiltonJacobiFormulation2005,
title = {A Time-Dependent {{Hamilton-Jacobi}} Formulation of Reachable Sets for Continuous Dynamic Games},
author = {Mitchell, I.M. and Bayen, A.M. and Tomlin, C.J.},
date = {2005-07},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {50},
number = {7},
pages = {947--957},
issn = {0018-9286},
doi = {10.1109/TAC.2005.851439},
url = {http://ieeexplore.ieee.org/document/1463302/},
urldate = {2023-10-27},
abstract = {We describe and implement an algorithm for computing the set of reachable states of a continuous dynamic game. The algorithm is based on a proof that the reachable set is the zero sublevel set of the viscosity solution of a particular time-dependent Hamilton–Jacobi–Isaacs partial differential equation. While alternative techniques for computing the reachable set have been proposed, the differential game formulation allows treatment of nonlinear systems with inputs and uncertain parameters. Because the time-dependent equation’s solution is continuous and defined throughout the state space, methods from the level set literature can be used to generate more accurate approximations than are possible for formulations with potentially discontinuous solutions. A numerical implementation of our formulation is described and has been released on the web. Its correctness is verified through a two vehicle, three dimensional collision avoidance example for which an analytic solution is available.},
langid = {english},
file = {/home/danesabo/Zotero/storage/HAFH38LK/Mitchell et al. - 2005 - A time-dependent Hamilton-Jacobi formulation of re.pdf}
}
@inproceedings{mitchellToolboxHamiltonJacobiSolvers2005,
title = {A {{Toolbox}} of {{Hamilton-Jacobi Solvers}} for {{Analysis}} of {{Nondeterministic Continuous}} and {{Hybrid Systems}}},
booktitle = {A {{Toolbox}} of {{Hamilton-Jacobi Solvers}} for {{Analysis}} of {{Nondeterministic Continuous}} and {{Hybrid Systems}}",},
author = {Mitchell, Ian M. and Templeton, Jeremy A.},
date = {2005},
pages = {480--494},
publisher = {Springer Berlin Heidelberg},
isbn = {978-3-540-31954-2},
file = {/home/danesabo/Zotero/storage/RVKB6TAB/_.pdf}
}
@article{mitchellToolboxLevelSet2005,
title = {A {{Toolbox}} of {{Level Set Methods}}},
author = {Mitchell, Ian},
date = {2005},
langid = {english},
file = {/home/danesabo/Zotero/storage/NMEYXZEP/Mitchell - 2005 - A Toolbox of Level Set Methods.pdf}
}
@inproceedings{mitraFormalizedTheoryVerifying2008,
title = {A {{Formalized Theory}} for {{Verifying Stability}} and {{Convergence}} of {{Automata}} in {{PVS}}},
booktitle = {Theorem {{Proving}} in {{Higher Order Logics}}},
author = {Mitra, Sayan and Chandy, K. Mani},
editor = {Mohamed, Otmane Ait and Muñoz, César and Tahar, Sofiène},
date = {2008},
pages = {230--245},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-540-71067-7_20},
abstract = {Correctness of many hybrid and distributed systems require stability and convergence guarantees. Unlike the standard induction principle for verifying invariance, a theory for verifying stability or convergence of automata is currently not available. In this paper, we formalize one such theory proposed by Tsitsiklis [27]. We build on the existing PVS metatheory for untimed, timed, and hybrid input/output automata, and incorporate the concepts about fairness, stability, Lyapunov-like functions, and convergence. The resulting theory provides two sets of sufficient conditions, which when instantiated and verified for particular automata, guarantee convergence and stability, respectively.},
isbn = {978-3-540-71067-7},
langid = {english},
keywords = {Important},
file = {/home/danesabo/Zotero/storage/JBSEDF23/Mitra and Chandy - 2008 - A Formalized Theory for Verifying Stability and Co.pdf}
}
@online{MizarHomePage,
title = {Mizar {{Home Page}}},
url = {http://mizar.org/},
urldate = {2024-03-20},
file = {/home/danesabo/Zotero/storage/W9TGRJZ9/mizar.org.html}
}
@online{ModelFreePlantTuning,
title = {Model-{{Free Plant Tuning}} | {{IEEE Journals}} \& {{Magazine}} | {{IEEE Xplore}}},
url = {https://ieeexplore.ieee.org/abstract/document/7586127},
urldate = {2024-07-10}
}
@article{molnarInterpretableMachineLearning,
title = {Interpretable {{Machine Learning}}},
author = {Molnar, Christoph},
langid = {english},
file = {/home/danesabo/Zotero/storage/TB28329T/Molnar - Interpretable Machine Learning.pdf}
}
@online{Montreat360degApp2022,
title = {Montreat 360° | {{App}} for {{Students}} at {{Montreat College}}},
date = {2022-09-29T12:14:19-04:00},
url = {https://www.montreat.edu/student-life/montreat-360/},
urldate = {2023-11-07},
abstract = {Montreat 360° is an app for Montreat College students that helps track experiential learning - real-life experience - through campus involvement.},
langid = {american},
file = {/home/danesabo/Zotero/storage/9FJP5RP9/montreat-360.html}
}
@article{morrisTOPOLOGYTEARS,
title = {{{TOPOLOGY WITHOUT TEARS}}},
author = {Morris, Sidney A},
langid = {english},
file = {/home/danesabo/Zotero/storage/XW2TWDNT/Morris - TOPOLOGY WITHOUT TEARS.pdf}
}
@incollection{mouraLean4Theorem2021,
title = {The {{Lean}} 4 {{Theorem Prover}} and {{Programming Language}}},
booktitle = {Automated {{Deduction}} – {{CADE}} 28},
author = {Moura, Leonardo De and Ullrich, Sebastian},
editor = {Platzer, André and Sutcliffe, Geoff},
date = {2021},
volume = {12699},
pages = {625--635},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-030-79876-5_37},
url = {https://link.springer.com/10.1007/978-3-030-79876-5_37},
urldate = {2024-03-28},
abstract = {Lean 4 is a reimplementation of the Lean interactive theorem prover (ITP) in Lean itself. It addresses many shortcomings of the previous versions and contains many new features. Lean 4 is fully extensible: users can modify and extend the parser, elaborator, tactics, decision procedures, pretty printer, and code generator. The new system has a hygienic macro system custom-built for ITPs. It contains a new typeclass resolution procedure based on tabled resolution, addressing significant performance problems reported by the growing user base. Lean 4 is also an efficient functional programming language based on a novel programming paradigm called functional but in-place. Efficient code generation is crucial for Lean users because many write custom proof automation procedures in Lean itself.},
isbn = {978-3-030-79875-8 978-3-030-79876-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/3T2YF7EE/Moura and Ullrich - 2021 - The Lean 4 Theorem Prover and Programming Language.pdf}
}
@article{murakamiRecursiveRealizationFinite1977,
title = {Recursive Realization of Finite Impulse Filters Using Finite Field Arithmetic},
author = {Murakami, H. and Reed, I.},
date = {1977-03},
journaltitle = {IEEE Transactions on Information Theory},
volume = {23},
number = {2},
pages = {232--242},
issn = {1557-9654},
doi = {10.1109/TIT.1977.1055697},
url = {https://ieeexplore.ieee.org/abstract/document/1055697?casa_token=WxaCaYsb6t0AAAAA:sIXU77P4LJE4QYM_kf0nh2-nMmhNE1hRY63bzbXShn4DLd3XMuXZDv3t-wUU7VU3bV9rrEsVAQ},
urldate = {2024-02-08},
abstract = {Recursive filter design techniques are described and developed for finite impulse filters using finite field arithmetic. The finite fields considered have the formGF(q\textasciicircum 2), the Galois field ofq\textasciicircum 2elements, and are analogous to the field of complex numbers whenqis a prime such that(-1)is not a quadratic residue. These filters can be designed to yield either a desired finite impulse or finite frequency response function. This filtering technique has other possible applications, including the encoding or decoding of information and signal design. Infinite signal trains can be decomposed naturally into orthogonal sequences which may be useful in the encoding and decoding process and may provide another approach to convolutional coding. Since the recursive filters developed here do not have the accumulation of round-off or truncation error that one might expect in recursive computations, such filters are noise-free transducers in the sense of Shannon.},
eventtitle = {{{IEEE Transactions}} on {{Information Theory}}},
file = {/home/danesabo/Zotero/storage/LMURGEVV/Murakami and Reed - 1977 - Recursive realization of finite impulse filters us.pdf;/home/danesabo/Zotero/storage/KXMXCNTI/1055697.html}
}
@article{murataStateEquationControllability1977,
title = {State Equation, Controllability, and Maximal Matchings of Petri Nets},
author = {Murata, T.},
date = {1977-06},
journaltitle = {IEEE Transactions on Automatic Control},
volume = {22},
number = {3},
pages = {412--416},
issn = {1558-2523},
doi = {10.1109/TAC.1977.1101509},
url = {https://ieeexplore.ieee.org/abstract/document/1101509?casa_token=6Kx_Rj-ypzoAAAAA:FZk0V_DlefIBBBex-k6BgT11teKCHnusMDOVUOQCcYM_ABsm9Zn7DyDnzTwyo9X_TN-5QFJwAg},
urldate = {2024-02-15},
abstract = {Petri nets are a versatile modeling device for studying the structure and control of concurrent systems. Petri nets and related graph models have been used for modeling a wide variety of systems from computers to social systems. In order to introduce this interesting modeling device to the researcher in control theory, this paper discusses Petri nets in the context of the state equation for a linear discrete-time system. The controllability concept of dynamic systems is applied to Petri nets for the first time. It is also shown that the controllability and reachability of a Petri net are related to maximal matchings of its bipartite graph.},
eventtitle = {{{IEEE Transactions}} on {{Automatic Control}}},
file = {/home/danesabo/Zotero/storage/TZXPTX4X/Murata - 1977 - State equation, controllability, and maximal match.pdf}
}
@article{murdochDefinitionsMethodsApplications2019,
title = {Definitions, Methods, and Applications in Interpretable Machine Learning},
author = {Murdoch, W. James and Singh, Chandan and Kumbier, Karl and Abbasi-Asl, Reza and Yu, Bin},
date = {2019-10-29},
journaltitle = {Proceedings of the National Academy of Sciences},
shortjournal = {Proc. Natl. Acad. Sci. U.S.A.},
volume = {116},
number = {44},
pages = {22071--22080},
issn = {0027-8424, 1091-6490},
doi = {10.1073/pnas.1900654116},
url = {https://pnas.org/doi/full/10.1073/pnas.1900654116},
urldate = {2023-10-11},
abstract = {Significance The recent surge in interpretability research has led to confusion on numerous fronts. In particular, it is unclear what it means to be interpretable and how to select, evaluate, or even discuss methods for producing interpretations of machine-learning models. We aim to clarify these concerns by defining interpretable machine learning and constructing a unifying framework for existing methods which highlights the underappreciated role played by human audiences. Within this framework, methods are organized into 2 classes: model based and post hoc. To provide guidance in selecting and evaluating interpretation methods, we introduce 3 desiderata: predictive accuracy, descriptive accuracy, and relevancy. Using our framework, we review existing work, grounded in real-world studies which exemplify our desiderata, and suggest directions for future work. , Machine-learning models have demonstrated great success in learning complex patterns that enable them to make predictions about unobserved data. In addition to using models for prediction, the ability to interpret what a model has learned is receiving an increasing amount of attention. However, this increased focus has led to considerable confusion about the notion of interpretability. In particular, it is unclear how the wide array of proposed interpretation methods are related and what common concepts can be used to evaluate them. We aim to address these concerns by defining interpretability in the context of machine learning and introducing the predictive, descriptive, relevant (PDR) framework for discussing interpretations. The PDR framework provides 3 overarching desiderata for evaluation: predictive accuracy, descriptive accuracy, and relevancy, with relevancy judged relative to a human audience. Moreover, to help manage the deluge of interpretation methods, we introduce a categorization of existing techniques into model-based and post hoc categories, with subgroups including sparsity, modularity, and simulatability. To demonstrate how practitioners can use the PDR framework to evaluate and understand interpretations, we provide numerous real-world examples. These examples highlight the often underappreciated role played by human audiences in discussions of interpretability. Finally, based on our framework, we discuss limitations of existing methods and directions for future work. We hope that this work will provide a common vocabulary that will make it easier for both practitioners and researchers to discuss and choose from the full range of interpretation methods.},
langid = {english},
file = {/home/danesabo/Zotero/storage/XDEBM7CF/Murdoch et al. - 2019 - Definitions, methods, and applications in interpre.pdf}
}
@inproceedings{nardoneFormalSecurityAssessment2016,
title = {Formal Security Assessment of {{Modbus}} Protocol},
booktitle = {2016 11th {{International Conference}} for {{Internet Technology}} and {{Secured Transactions}} ({{ICITST}})},
author = {Nardone, Roberto and Rodriguez, Ricardo J. and Marrone, Stefano},
date = {2016-12},
pages = {142--147},
publisher = {IEEE},
location = {Barcelona, Spain},
doi = {10.1109/ICITST.2016.7856685},
url = {http://ieeexplore.ieee.org/document/7856685/},
urldate = {2023-10-10},
abstract = {Critical infrastructures as water treatment, power distribution, or telecommunications, provide daily services essential to our lifestyle. Any service discontinuity can have a high impact into our society and even into our safety. Thus, security of these systems against intentional threats must be guaranteed. However, many of these systems are based on protocols initially designed to operate on closed, unroutable networks, making them an easy target for cybercriminals. In this regard, Modbus is a widely adopted protocol in control systems. Modbus protocol, however, lacks for security properties and is vulnerable to plenty of attacks (as spoofing, flooding, or replay, to name a few). In this paper, we propose a formal modeling of Modbus protocol using an extension of hierarchical state-machines that is automatically transformed to a Promela model. This model allows us to find counterexamples of security properties by model-checking. In particular, the original contribution of this paper is the formal demonstration of the existence of man-inthe-middle attacks in Modbus-based systems. Our approach also allows to formally evaluate security properties in future extensions of Modbus protocols.},
eventtitle = {2016 11th {{International Conference}} for {{Internet Technology}} and {{Secured Transactions}} ({{ICITST}})},
isbn = {978-1-908320-73-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/QRG7CDE9/Nardone et al. - 2016 - Formal security assessment of Modbus protocol.pdf}
}
@online{natashaSimpleMongolianBeef2023,
title = {Simple {{Mongolian Beef}}},
author = {Natasha},
date = {2023-09-15T10:35:31+00:00},
url = {https://www.saltandlavender.com/mongolian-beef/},
urldate = {2025-04-02},
abstract = {Just a few pantry staples, and this easy Mongolian beef recipe is ready in 30 minutes! It has a fantastic sauce from scratch, and it's way healthier than takeout and budget friendly too!},
langid = {american},
organization = {Salt \& Lavender},
file = {/home/danesabo/Zotero/storage/8ULJA8RX/mongolian-beef.html}
}
@online{NationalCentersAcademic,
title = {National {{Centers}} of {{Academic Excellence}}},
url = {https://www.nsa.gov/Academics/Centers-of-Academic-Excellence/},
urldate = {2023-11-07},
file = {/home/danesabo/Zotero/storage/RR2T9T7R/Centers-of-Academic-Excellence.html}
}
@misc{NationalCyberInformedEngineering2022,
title = {National {{Cyber-Informed Engineering Strategy}}},
date = {2022-06},
url = {https://inl.gov/content/uploads/2023/07/FINAL-DOE-National-CIE-Strategy-June-2022_0.pdf},
file = {/home/danesabo/Zotero/storage/NZCYT7EW/FINAL DOE National CIE Strategy - June 2022_0.pdf}
}
@misc{NationalCyberSecurity2023,
title = {National {{Cyber Security Strategy}}},
date = {2023-03},
url = {https://www.whitehouse.gov/wp-content/uploads/2023/03/National-Cybersecurity-Strategy-2023.pdf},
file = {/home/danesabo/Zotero/storage/QMSLB5F7/National-Cybersecurity-Strategy-2023.pdf}
}
@book{nationalmaterialsandmanufacturingboardVisionFutureCenterBased2016,
title = {A {{Vision}} for the {{Future}} of {{Center-Based Multidisciplinary Engineering Research}}: {{Proceedings}} of a {{Symposium}}},
shorttitle = {A {{Vision}} for the {{Future}} of {{Center-Based Multidisciplinary Engineering Research}}},
author = {{National Materials and Manufacturing Board} and {Division on Engineering and Physical Sciences} and {National Academy of Engineering} and {National Academies of Sciences, Engineering, and Medicine}},
editor = {Alper, Joe},
date = {2016},
pages = {23645},
publisher = {National Academies Press},
location = {Washington, D.C.},
doi = {10.17226/23645},
url = {http://www.nap.edu/catalog/23645},
urldate = {2024-01-26},
isbn = {978-0-309-44970-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/NXSJH9UD/National Materials and Manufacturing Board et al. - 2016 - A Vision for the Future of Center-Based Multidisci.pdf}
}
@report{NCEES2022Annual2022,
title = {{{NCEES}} 2022 {{Annual Report}}},
date = {2022},
institution = {National Council of Examiners for Engineering an Surveying},
file = {/home/danesabo/Zotero/storage/2DSKLL2B/Annual-report-2022-flip.pdf}
}
@report{neemaCyPhyMLLanguageMETA,
title = {{{CyPhyML Language}} in the {{META Toolchain}}.Pdf},
author = {Neema, Sandeep and Scott, Jason and Bapty, Ted},
number = {ISIS-15-104},
file = {/home/danesabo/Zotero/storage/J9AQG6EV/CyPhyML Language in the META Toolchain.pdf}
}
@book{nekrashevychGroupsTopologicalDynamics2022,
title = {Groups and {{Topological Dynamics}}},
author = {Nekrashevych, Volodymyr},
date = {2022},
publisher = {American Mathematical Society},
location = {Providence, UNITED STATES},
url = {http://ebookcentral.proquest.com/lib/pitt-ebooks/detail.action?docID=29731920},
urldate = {2024-01-17},
isbn = {978-1-4704-7119-4},
file = {/home/danesabo/Zotero/storage/YAM3TMUI/reader.html}
}
@article{nemouchiFormallyVerifiedZTA2023,
title = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}: {{Preprint}}},
author = {Nemouchi, Yakoub and Etigowni, Sriharsha and Zolan, Alexander and Macwan, Richard},
date = {2023},
journaltitle = {Renewable Energy},
abstract = {The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons – improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.},
langid = {english},
file = {/home/danesabo/Zotero/storage/63N6XVPW/Nemouchi et al. - 2023 - Formally Verified ZTA Requirements for OTICS Envi.pdf}
}
@report{nemouchiFormallyVerifiedZTA2023a,
title = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}: {{Preprint}}},
shorttitle = {Formally {{Verified ZTA Requirements}} for {{OT}}/{{ICS Environments}} with {{Isabelle}}/{{HOL}}},
author = {Nemouchi, Yakoub and Etigowni, Sriharsha and Zolan, Alexander and Macwan, Richard},
date = {2023-11-29},
number = {NREL/CP-5R00-86154},
institution = {National Renewable Energy Laboratory (NREL), Golden, CO (United States)},
url = {https://www.osti.gov/biblio/2228660},
urldate = {2024-04-29},
abstract = {The clean energy transformation led to the integration of distributed energy resources on a top of the grid, and so a substantial increase in the complexity of power grids infrastructure and the underlying operational technology environment. Operational technology environments are becoming a system of systems, integrating heterogeneous devices which are software/hardware intensive, have ever increasing demands to exploit advances in commodity of software/hardware infrastructures, and this for good reasons - improving energy systems requirements such as cybersecurity and resilience. In such a setting, system requirements at different levels mix, thus undesirable outcomes will surely happen. The use of formal methods will remove ambiguity, increase automation and provide high levels of assurance and reliability. In this paper, we contribute a methodology and a framework for the system level verification of zero trust architecture requirements in operational technology environments. We define a formal specification for the core functionalities of operational technology environments, the corresponding invariants, and security proofs. Of particular note is our modular approach for the formal verification of asynchronous interactions in operational technology environments. The formal specification and the proofs have been mechanized using the interactive theorem proving environment Isabelle/HOL.},
langid = {english},
file = {/home/danesabo/Zotero/storage/MFCB2KR9/Nemouchi et al. - 2023 - Formally Verified ZTA Requirements for OTICS Envi.pdf}
}
@article{nestlerCompetencyCybersecurityEducation,
title = {Competency in {{Cybersecurity Education}}:},
author = {Nestler, Vincent and Fowler, Zoe},
langid = {english},
file = {/home/danesabo/Zotero/storage/GSD9XMAQ/Nestler and Fowler - Competency in Cybersecurity Education.pdf}
}
@article{newellTranslationIEC6113132018,
title = {Translation of {{IEC}} 61131-3 {{Function Block Diagrams}} to {{PVS}} for {{Formal Verification}} with {{Real-Time Nuclear Application}}},
author = {Newell, Josh and Pang, Linna and Tremaine, David and Wassyng, Alan and Lawford, Mark},
date = {2018-01},
journaltitle = {Journal of Automated Reasoning},
shortjournal = {J Autom Reasoning},
volume = {60},
number = {1},
pages = {63--84},
issn = {0168-7433, 1573-0670},
doi = {10.1007/s10817-017-9415-7},
url = {http://link.springer.com/10.1007/s10817-017-9415-7},
urldate = {2023-10-10},
abstract = {The trip computers for the two reactor shutdown systems of the Ontario Power Generation (OPG) Darlington Nuclear Power Generating Station are being refurbished due to hardware obsolescence. For one of the systems, the general purpose computer originally used is being replaced by a programmable logic controller (PLC). The trip computer application software has been rewritten using function block diagrams (FBDs), a commonly used PLC programming language defined in the IEC 61131-3 standard. The replacement project’s quality assurance program requires that formal verification be performed to compare the FBDs against a formal software requirements specification written using tabular expressions (TEs). The PVS theorem proving tool is used in formal verification. Custom tools developed for OPG are used to translate TEs and FBDs into PVS code. In this paper, we present a method to rigorously translate the graphical FBD language to a mathematical model in PVS using an abstract syntax to represent the FBD constructs. We use an example from the replacement project to demonstrate the use of the model to translate a FBD module into a PVS specification. We then extend that example to demonstrate the method’s applicability to a Simulink-based design.},
langid = {english},
file = {/home/danesabo/Zotero/storage/67NML3RN/Newell et al. - 2018 - Translation of IEC 61131-3 Function Block Diagrams.pdf}
}
@article{newmanWidespreadLogicController,
entrysubtype = {magazine},
title = {A {{Widespread Logic Controller Flaw Raises}} the {{Specter}} of {{Stuxnet}}},
author = {Newman, Lily Hay},
journaltitle = {Wired},
issn = {1059-1028},
url = {https://www.wired.com/story/siemens-s7-1500-logic-controller-flaw/},
urldate = {2024-04-04},
abstract = {More than 120 models of Siemens' S7-1500 PLCs contain a serious vulnerability—and no fix is on the way.},
langid = {american}
}
@inproceedings{nghiemMontecarloTechniquesFalsification2010,
title = {Monte-Carlo Techniques for Falsification of Temporal Properties of Non-Linear Hybrid Systems},
booktitle = {Proceedings of the 13th {{ACM}} International Conference on {{Hybrid}} Systems: Computation and Control},
author = {Nghiem, Truong and Sankaranarayanan, Sriram and Fainekos, Georgios and Ivancić, Franjo and Gupta, Aarti and Pappas, George J.},
date = {2010-04-12},
series = {{{HSCC}} '10},
pages = {211--220},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/1755952.1755983},
url = {https://dl.acm.org/doi/10.1145/1755952.1755983},
urldate = {2023-11-03},
abstract = {We present a Monte-Carlo optimization technique for finding inputs to a system that falsify a given Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of inputs guided by a robustness metric defined by the MTL property. Robustness can be used to guide our search for a falsifying trajectory by exploring trajectories with smaller robustness values. We show that the notion of robustness can be generalized to consider hybrid system trajectories. The resulting testing framework can be applied to non-linear hybrid systems with external inputs. We show through numerous experiments on complex systems that using our framework can help automatically falsify properties with more consistency as compared to other means such as uniform sampling.},
isbn = {978-1-60558-955-8},
file = {/home/danesabo/Zotero/storage/XQEMQJB8/Nghiem et al. - 2010 - Monte-carlo techniques for falsification of tempor.pdf}
}
@article{nguyenDigitalTwinApproach2022,
title = {A Digital Twin Approach to System-Level Fault Detection and Diagnosis for Improved Equipment Health Monitoring},
author = {Nguyen, Tat Nghia and Ponciroli, Roberto and Bruck, Paul and Esselman, Thomas C. and Rigatti, Joseph A. and Vilim, Richard B.},
date = {2022-06},
journaltitle = {Annals of Nuclear Energy},
shortjournal = {Annals of Nuclear Energy},
volume = {170},
pages = {109002},
issn = {03064549},
doi = {10.1016/j.anucene.2022.109002},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0306454922000378},
urldate = {2023-10-11},
abstract = {Automating the task of fault detection and diagnosis is crucial in the effort to reduce the operation and maintenance cost in the nuclear industry. This paper describes a physics-based approach for system-level diagnosis in thermal–hydraulic systems in nuclear power plants. The inclusion of physics information allows for the creation of virtual sensors, which provide improved fault diagnosis capability. The physics information also serves to better constrain diagnostic solutions to the physical domain. As a demonstration, various test cases for fault diagnosis in a high-pressure feedwater system were considered. The use of virtual sensors allows constructing performance models for two first-point feedwater heaters which would not have been possible otherwise due to the limited sensor set. Real-time plant data provided by a utility partner were used to assess the diagnostic approach. The detection of an abnormal event immediate after a plant startup pointed to faulty behaviors in the two first-point feedwater heaters. This double-blind fault diagnosis was subsequently confirmed by the plant operator. In addition, several simulated sensor fault events demonstrated the capability of our algorithms in detecting and discriminating sensor faults.},
langid = {english},
file = {/home/danesabo/Zotero/storage/CQ86LIZC/Nguyen et al. - 2022 - A digital twin approach to system-level fault dete.pdf}
}
@article{nguyenFuzzyControlSystems2019,
title = {Fuzzy {{Control Systems}}: {{Past}}, {{Present}} and {{Future}}},
shorttitle = {Fuzzy {{Control Systems}}},
author = {Nguyen, Anh-Tu and Taniguchi, Tadanari and Eciolaza, Luka and Campos, Victor and Palhares, Reinaldo and Sugeno, Michio},
date = {2019-02},
journaltitle = {IEEE Computational Intelligence Magazine},
volume = {14},
number = {1},
pages = {56--68},
issn = {1556-6048},
doi = {10.1109/MCI.2018.2881644},
url = {https://ieeexplore.ieee.org/abstract/document/8610273},
urldate = {2024-07-10},
abstract = {More than 40 years after fuzzy logic control appeared as an effective tool to deal with complex processes, the research on fuzzy control systems has constantly evolved. Mamdani fuzzy control was originally introduced as a model-free control approach based on expert?s experience and knowledge. Due to the lack of a systematic framework to study Mamdani fuzzy systems, we have witnessed growing interest in fuzzy model-based approaches with Takagi-Sugeno fuzzy systems and singleton-type fuzzy systems (also called piecewise multiaffine systems) over the past decades. This paper reviews the key features of the three above types of fuzzy systems. Through these features, we point out the historical rationale for each type of fuzzy systems and its current research mainstreams. However, the focus is put on fuzzy model-based approaches developed via Lyapunov stability theorem and linear matrix inequality (LMI) formulations. Finally, our personal viewpoint on the perspectives and challenges of the future fuzzy control research is discussed.},
eventtitle = {{{IEEE Computational Intelligence Magazine}}},
keywords = {Analytical models,Fuzzy control,Fuzzy logic,Fuzzy systems,Linguistics,Nonlinear systems,Stability analysis,Zadeh Lotfi},
file = {/home/danesabo/Zotero/storage/ZKLBNTQI/Nguyen et al. - 2019 - Fuzzy Control Systems Past, Present and Future.pdf;/home/danesabo/Zotero/storage/WGCQAM84/8610273.html}
}
@article{nguyenModelBasedDiagnosticFrameworks,
title = {Model-{{Based Diagnostic Frameworks}} for {{Fault Detection}} and {{System Monitoring}} in {{Nuclear Engineering Systems}}},
author = {Nguyen, Tat Nghia},
langid = {english},
file = {/home/danesabo/Zotero/storage/D9GHLNPC/Nguyen - Model-Based Diagnostic Frameworks for Fault Detect.pdf}
}
@inproceedings{nguyenPrivacyfirstManufacturingData2023,
title = {Towards {{Privacy-first Manufacturing Data Exchange Platform}}},
booktitle = {Proceedings of the 12th {{International Symposium}} on {{Information}} and {{Communication Technology}}},
author = {Nguyen, Thanh-Hai and Heron, Olivier and Riou, Olivier},
date = {2023-12-07},
series = {{{SOICT}} '23},
pages = {801--807},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/3628797.3628913},
url = {https://dl.acm.org/doi/10.1145/3628797.3628913},
urldate = {2024-02-01},
abstract = {Reducing their operating costs and optimizing manufacturing processes are main challenges for manufacturers that need no-doubt help from machine suppliers-OEMs. However, like 64\% of Business entities, they do not intend to collaborate as long as their confidential data can be seen by anyone. Until now, some solutions on market using technologies like Confidential Computing, Differential Privacy, Multi Party Computation cannot completely fit to industrial requirements, data are sometimes partially encrypted or using trust execution environment (a bunker) to analyse in clear format. For this reason, until now, no secure computation and no solution for privacy-preserving data analysis are yet completely satisfactory (in terms of privacy and security constraints) and moreover they are often tested for different applications and on different datasets. Fully Homomorphic Encryption (FHE) technology is going to change the game. FHE allows service providers to work directly on encrypted data without ever decrypting it, which offers a privacy data protection for both customers and OEMs. In the collaboration with Siemens France, we provide FHE-based manufacturing data exchange space which is a part of RaiseSens© Data eXchange Platform (RS-DXP). In this respect, API-driven RS-DXP architecture allows the practical and easy integration of FHE techniques combined with optimisation engine, and non-moving data techniques applied in lightweight yet real-world manufacturing applications and deploying them in Cloud computing environment to offer a solution at low software engineering cost. This will pave the way for a wide deployment, boosting data-enabled manufacturing services.},
isbn = {9798400708916},
file = {/home/danesabo/Zotero/storage/599XHCEU/Nguyen et al. - 2023 - Towards Privacy-first Manufacturing Data Exchange .pdf}
}
@article{nicolCommonWeaknessEnumerations2023,
title = {Toward {{Common Weakness Enumerations}} in {{Industrial Control Systems}}},
author = {Nicol, David M. and Shannon, Gregory and Akbar, Monika and Bishop, Matt and Chaney, Michael and Luallen, Matthew},
date = {2023-07},
journaltitle = {IEEE Security \& Privacy},
volume = {21},
number = {4},
pages = {84--93},
issn = {1558-4046},
doi = {10.1109/MSEC.2023.3279515},
url = {https://ieeexplore.ieee.org/abstract/document/10194510},
urldate = {2024-02-29},
abstract = {The storyline of MITRE’s common weakness enumeration framework illustrates how the security and privacy technical community can collaborate/cooperate with policy makers to advance policy, giving it specifics and filling gaps of technical knowledge to improve security and resilience of critical infrastructure.},
eventtitle = {{{IEEE Security}} \& {{Privacy}}},
file = {/home/danesabo/Zotero/storage/G8AYVU6X/Nicol et al. - 2023 - Toward Common Weakness Enumerations in Industrial .pdf}
}
@inproceedings{nigamFormalSecurityVerification2019,
title = {Formal {{Security Verification}} of {{Industry}} 4.0 {{Applications}}},
booktitle = {2019 24th {{IEEE International Conference}} on {{Emerging Technologies}} and {{Factory Automation}} ({{ETFA}})},
author = {Nigam, Vivek and Talcott, Carolyn},
date = {2019-09},
pages = {1043--1050},
publisher = {IEEE},
location = {Zaragoza, Spain},
doi = {10.1109/ETFA.2019.8869428},
url = {https://ieeexplore.ieee.org/document/8869428/},
urldate = {2023-10-10},
abstract = {Without appropriate counter-measures, cyber-attacks can exploit the increased system connectivity provided by Industry 4.0 (I4.0) to cause catastrophic events, by, e.g., injecting or tampering with messages. The solution supported by standards, such as, OPC-UA, is to sign or encrypt messages. However, given the limited resources of devices, instead of encrypting all messages in the network, it is better to encrypt only the messages that if tampered with or injected, could lead to undesired configurations. This paper describes the use of formal verification to analyse the security of I4.0 applications. We formalize in Rewriting Logic, I4.0 applications and systems, i.e., networked sets of devices, and a symbolic intruder model. Our formalization can be executed by the tool Maude to automate such security analysis, e.g., determine which messages are sufficient to sign in order avoid injection and tampering attacks.},
eventtitle = {2019 24th {{IEEE International Conference}} on {{Emerging Technologies}} and {{Factory Automation}} ({{ETFA}})},
isbn = {978-1-72810-303-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/M2B575DV/Nigam and Talcott - 2019 - Formal Security Verification of Industry 4.0 Appli.pdf}
}
@article{nilssonCorrectbyConstructionAdaptiveCruise2016,
title = {Correct-by-{{Construction Adaptive Cruise Control}}: {{Two Approaches}}},
shorttitle = {Correct-by-{{Construction Adaptive Cruise Control}}},
author = {Nilsson, Petter and Hussien, Omar and Balkan, Ayca and Chen, Yuxiao and Ames, Aaron D. and Grizzle, Jessy W. and Ozay, Necmiye and Peng, Huei and Tabuada, Paulo},
date = {2016-07},
journaltitle = {IEEE Transactions on Control Systems Technology},
shortjournal = {IEEE Trans. Contr. Syst. Technol.},
volume = {24},
number = {4},
pages = {1294--1307},
issn = {1063-6536, 1558-0865},
doi = {10.1109/TCST.2015.2501351},
url = {http://ieeexplore.ieee.org/document/7349170/},
urldate = {2023-11-20},
abstract = {Motivated by the challenge of developing control software provably meeting specifications for real-world problems, this paper applies formal methods to adaptive cruise control (ACC). Starting from a linear temporal logic specification for ACC, obtained by interpreting relevant ACC standards, we discuss in this paper two different control software synthesis methods. Each method produces a controller that is correctby-construction, meaning that trajectories of the closed-loop systems provably meet the specification. Both methods rely on fixed-point computations of certain set-valued mappings. However, one of the methods performs these computations on the continuous state space whereas the other method operates on a finite-state abstraction. While controller synthesis is based on a low-dimensional model, each controller is tested on CarSim, an industry-standard vehicle simulator. Our results demonstrate several advantages over classical control design techniques. First, a formal approach to control design removes potential ambiguity in textual specifications by translating them into precise mathematical requirements. Second, because the resulting closedloop system is known a priori to satisfy the specification, testing can then focus on the validity of the models used in control design and whether the specification captures the intended requirements. Finally, the set from where the specification (e.g., safety) can be enforced is explicitly computed and thus conditions for passing control to an emergency controller are clearly defined.},
langid = {english},
file = {/home/danesabo/Zotero/storage/DRAMUAGA/Nilsson et al. - 2016 - Correct-by-Construction Adaptive Cruise Control T.pdf}
}
@book{nipkowConcreteSemanticsIsabelle2014,
title = {Concrete {{Semantics}}: {{With Isabelle}}/{{HOL}}},
shorttitle = {Concrete {{Semantics}}},
author = {Nipkow, Tobias and Klein, Gerwin},
date = {2014},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-10542-0},
url = {https://link.springer.com/10.1007/978-3-319-10542-0},
urldate = {2024-05-03},
isbn = {978-3-319-10541-3 978-3-319-10542-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/M9WMR8M5/Nipkow and Klein - 2014 - Concrete Semantics With IsabelleHOL.pdf}
}
@inproceedings{nitscheSatisfactionCheckingPower2014,
title = {Towards Satisfaction Checking of Power Contracts in {{Uppaal}}},
booktitle = {Proceedings of the 2014 {{Forum}} on {{Specification}} and {{Design Languages}} ({{FDL}})},
author = {Nitsche, Gregor and Gruttner, Kim and Nebel, Wolfgang},
date = {2014-10},
pages = {1--8},
publisher = {IEEE},
location = {Munich, Germany},
doi = {10.1109/FDL.2014.7119364},
url = {http://ieeexplore.ieee.org/document/7119364/},
urldate = {2023-11-08},
abstract = {Since energy consumption is one of the most limiting factors for embedded and integrated systems, today’s microelectronic design demands urgently for power-aware methodologies for early specification, design-space exploration and verification of the designs’ power properties. To this end, we currently develop a contract- and component-based design concept for power properties, called Power Contracts, to provide a formal link between the bottom-up power characterization of low-level system components and the top-down specification of the systems’ high-level power intent. In this paper, we present a first proof of concept for the verification of the leaf-component power contracts of a hierarchical system design w. r. t. their implementation in UPPAAL. Building on these, we can provide assured power contracts for the hierarchical Virtual Integration (VI) of the leafcomponents to a compound power contract of the integrated final system and thus allow for a sound and traceable bottom-up integration and verification methodology for power properties.},
eventtitle = {2014 {{Forum}} on {{Specification}} and {{Design Languages}} ({{FDL}})},
isbn = {978-2-9530504-9-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/HDESADN4/Nitsche et al. - 2014 - Towards satisfaction checking of power contracts i.pdf}
}
@online{normey-ricoTeachingControlBasic2023,
title = {Teaching Control with {{Basic Maths}}: {{Introduction}} to {{Process Control}} Course as a Novel Educational Approach for Undergraduate Engineering Programs},
shorttitle = {Teaching Control with {{Basic Maths}}},
author = {Normey-Rico, Julio Elias and Morato, Marcelo Menezes},
date = {2023-10-09},
eprint = {2310.06001},
eprinttype = {arXiv},
eprintclass = {physics},
url = {http://arxiv.org/abs/2310.06001},
urldate = {2024-01-16},
abstract = {In this article, we discuss a novel education approach to control theory in undergraduate engineering programs. In particular, we elaborate on the inclusion of an introductory course on process control during the first years of the program, to appear right after the students undergo basic calculus and physics courses. Our novel teaching proposal comprises debating the basic elements of control theory without requiring any background on advanced mathematical frameworks from the part of the students. The methodology addresses, conceptually, the majority of the steps required for the analysis and design of simple control systems. Herein, we thoroughly detail this educational guideline, as well as tools that can be used in the classroom. Furthermore, we propose a cheap test-bench kit and an open-source numerical simulator that can be used to carry out experiments during the proposed course. Most importantly, we also assess on how the Introduction to process control course has affected the undergraduate program on Control and Automation Engineering at Universidade Federal de Santa Catarina (UFSC, Brazil). Specifically, we debate the outcomes of implementing our education approach at UFSC from 2016 to 2023, considering students' rates of success in other control courses and perspectives on how the chair helped them throughout the course of their program. Based on randomised interviews, we indicate that our educational approach has had good teaching-learning results: students tend to be more motivated for other control-related subjects, while exhibiting higher rates of success.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/LT33TIEF/Normey-Rico and Morato - 2023 - Teaching control with Basic Maths Introduction to.pdf}
}
@online{NUARIAddressingNational,
title = {{{NUARI}}: {{Addressing National Cyber Security Issues}}},
shorttitle = {{{NUARI}}},
url = {https://nuari.org},
urldate = {2023-11-09},
abstract = {More than a think tank, the Norwich University Applied Research Institutes are driven to develop effective solutions for national cyber security threats.},
langid = {english}
}
@online{nuskenSolvingHighdimensionalHamiltonJacobiBellman2023,
title = {Solving High-Dimensional {{Hamilton-Jacobi-Bellman PDEs}} Using Neural Networks: Perspectives from the Theory of Controlled Diffusions and Measures on Path Space},
shorttitle = {Solving High-Dimensional {{Hamilton-Jacobi-Bellman PDEs}} Using Neural Networks},
author = {Nüsken, Nikolas and Richter, Lorenz},
date = {2023-01-29},
eprint = {2005.05409},
eprinttype = {arXiv},
eprintclass = {cs, math, stat},
doi = {10.48550/arXiv.2005.05409},
url = {http://arxiv.org/abs/2005.05409},
urldate = {2023-10-27},
abstract = {Optimal control of diffusion processes is intimately connected to the problem of solving certain Hamilton-Jacobi-Bellman equations. Building on recent machine learning inspired approaches towards high-dimensional PDEs, we investigate the potential of \$\textbackslash textit\{iterative diffusion optimisation\}\$ techniques, in particular considering applications in importance sampling and rare event simulation, and focusing on problems without diffusion control, with linearly controlled drift and running costs that depend quadratically on the control. More generally, our methods apply to nonlinear parabolic PDEs with a certain shift invariance. The choice of an appropriate loss function being a central element in the algorithmic design, we develop a principled framework based on divergences between path measures, encompassing various existing methods. Motivated by connections to forward-backward SDEs, we propose and study the novel \$\textbackslash textit\{log-variance\}\$ divergence, showing favourable properties of corresponding Monte Carlo estimators. The promise of the developed approach is exemplified by a range of high-dimensional and metastable numerical examples.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/Q8DSFC8E/Nüsken and Richter - 2023 - Solving high-dimensional Hamilton-Jacobi-Bellman P.pdf;/home/danesabo/Zotero/storage/XMHJ8Z5G/2005.html}
}
@inproceedings{nuzzoContractbasedDesignControl2014,
title = {Contract-Based Design of Control Protocols for Safety-Critical Cyber-Physical Systems},
booktitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2014},
author = {Nuzzo, Pierluigi and Finn, John B. and Iannopollo, Antonio and Sangiovanni-Vincentelli, Alberto L.},
date = {2014},
pages = {1--4},
publisher = {IEEE Conference Publications},
location = {Dresden, Germany},
doi = {10.7873/DATE.2014.072},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6800273},
urldate = {2023-11-08},
abstract = {We introduce a platform-based design methodology that addresses the complexity and heterogeneity of cyber-physical systems by using assume-guarantee contracts to formalize the design process and enable realization of control protocols in a hierarchical and compositional manner. Given the architecture of the physical plant to be controlled, the design is carried out as a sequence of refinement steps from an initial specification to a final implementation, including synthesis from requirements and mapping of higher-level functional and nonfunctional models into a set of candidate solutions built out of a library of components at the lower level. Initial top-level requirements are captured as contracts and expressed using linear temporal logic (LTL) and signal temporal logic (STL) formulas to enable requirement analysis and early detection of inconsistencies. Requirements are then refined into a controller architecture by combining reactive synthesis steps from LTL specifications with simulation-based design space exploration steps. We demonstrate our approach on the design of embedded controllers for aircraft electric power distribution.},
eventtitle = {Design {{Automation}} and {{Test}} in {{Europe}}},
isbn = {978-3-9815370-2-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/NCQGWXT7/Nuzzo et al. - 2014 - Contract-based design of control protocols for saf.pdf}
}
@inproceedings{nuzzoContractbasedDesignControl2014a,
title = {Contract-Based Design of Control Protocols for Safety-Critical Cyber-Physical Systems},
booktitle = {Design, {{Automation}} \& {{Test}} in {{Europe Conference}} \& {{Exhibition}} ({{DATE}}), 2014},
author = {Nuzzo, Pierluigi and Finn, John B. and Iannopollo, Antonio and Sangiovanni-Vincentelli, Alberto L.},
date = {2014},
pages = {1--4},
publisher = {IEEE Conference Publications},
location = {Dresden, Germany},
doi = {10.7873/DATE.2014.072},
url = {http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6800273},
urldate = {2023-10-10},
abstract = {We introduce a platform-based design methodology that addresses the complexity and heterogeneity of cyber-physical systems by using assume-guarantee contracts to formalize the design process and enable realization of control protocols in a hierarchical and compositional manner. Given the architecture of the physical plant to be controlled, the design is carried out as a sequence of refinement steps from an initial specification to a final implementation, including synthesis from requirements and mapping of higher-level functional and nonfunctional models into a set of candidate solutions built out of a library of components at the lower level. Initial top-level requirements are captured as contracts and expressed using linear temporal logic (LTL) and signal temporal logic (STL) formulas to enable requirement analysis and early detection of inconsistencies. Requirements are then refined into a controller architecture by combining reactive synthesis steps from LTL specifications with simulation-based design space exploration steps. We demonstrate our approach on the design of embedded controllers for aircraft electric power distribution.},
eventtitle = {Design {{Automation}} and {{Test}} in {{Europe}}},
isbn = {978-3-9815370-2-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/CR5VXJYU/Nuzzo et al. - 2014 - Contract-based design of control protocols for saf.pdf}
}
@article{nuzzoMethodologyToolsNext2015,
title = {Methodology and {{Tools}} for {{Next Generation Cyber}}‐{{Physical Systems}}: {{The iCyPhy Approach}}},
shorttitle = {Methodology and {{Tools}} for {{Next Generation Cyber}}‐{{Physical Systems}}},
author = {Nuzzo, Pierluigi and Sangiovanni‐Vincentelli, Alberto L. and Murray, Richard M.},
date = {2015-10},
journaltitle = {INCOSE International Symposium},
shortjournal = {INCOSE International Symp},
volume = {25},
number = {1},
pages = {235--249},
issn = {2334-5837, 2334-5837},
doi = {10.1002/j.2334-5837.2015.00060.x},
url = {https://incose.onlinelibrary.wiley.com/doi/10.1002/j.2334-5837.2015.00060.x},
urldate = {2023-11-08},
abstract = {The realization of complex, cyber-physical “systems of systems” can substantially benefit from model-based hierarchical and compositional methodologies to make their design possible let alone optimal. In this paper, we introduce the methodology being developed within the industrial Cyber-Physical (iCyPhy) research consortium, which addresses the complexity and heterogeneity of cyber-physical systems by formalizing the design process in a hierarchical and compositional way, and provides a unifying framework where different modeling, analysis and synthesis tools can seamlessly interconnect. We use assume-guarantee contracts and their algebra (e.g. composition, conjunction, refinement) to provide formal support to the entire design flow. The design is carried out as a sequence of refinement steps from a high-level specification (top-down phase) to an implementation built out of a library of components at the lower level (bottom-up phase). At each step, the design is refined by combining synthesis from requirements, optimization and simulation-based design space exploration methods. We illustrate our approach on design examples of embedded controllers for aircraft power distribution and air management systems.},
langid = {english},
file = {/home/danesabo/Zotero/storage/HXRYB4NQ/Nuzzo et al. - 2015 - Methodology and Tools for Next Generation Cyber‐Ph.pdf}
}
@article{nuzzoStochasticAssumeGuaranteeContracts2019,
title = {Stochastic {{Assume-Guarantee Contracts}} for {{Cyber-Physical System Design}}},
author = {Nuzzo, Pierluigi and Li, Jiwei and Sangiovanni-Vincentelli, Alberto L. and Xi, Yugeng and Li, Dewei},
date = {2019-01-31},
journaltitle = {ACM Transactions on Embedded Computing Systems},
shortjournal = {ACM Trans. Embed. Comput. Syst.},
volume = {18},
number = {1},
pages = {1--26},
issn = {1539-9087, 1558-3465},
doi = {10.1145/3243216},
url = {https://dl.acm.org/doi/10.1145/3243216},
urldate = {2023-11-08},
abstract = {We present an assume-guarantee contract framework for cyber-physical system design under probabilistic requirements. Given a stochastic linear system and a set of requirements captured by bounded Stochastic Signal Temporal Logic (StSTL) contracts, we propose algorithms to check contract compatibility, consistency, and refinement, and generate a sequence of control inputs that satisfies a contract. We leverage encodings of the verification and control synthesis tasks into mixed integer optimization problems, and conservative approximations of probabilistic constraints that produce sound and tractable problem formulations. We illustrate the effectiveness of our approach on three case studies, including the design of controllers for aircraft power distribution networks.},
langid = {english},
file = {/home/danesabo/Zotero/storage/YWXM7VYD/Nuzzo et al. - 2019 - Stochastic Assume-Guarantee Contracts for Cyber-Ph.pdf}
}
@article{obeidFormalVerificationSecurity2019,
title = {Formal {{Verification}} of {{Security Pattern Composition}}: {{Application}} to {{SCADA}}},
shorttitle = {Formal {{Verification}} of {{Security Pattern Composition}}},
author = {Obeid, Fadi and Dhaussy, Philippe},
date = {2019},
journaltitle = {Computing and Informatics},
shortjournal = {cai},
volume = {38},
number = {5},
pages = {1149--1180},
issn = {2585-8807},
doi = {10.31577/cai_2019_5_1149},
url = {http://www.cai.sk/ojs/index.php/cai/article/view/2019_5_1149},
urldate = {2023-10-10},
abstract = {Information security was initially required in specific applications, however, nowadays, most companies and even individuals are interested in securing their information assets. The new requirement can be costly, especially with the high demand on security solutions and security experts. Security patterns are reusable security solutions that prove to be efficient and can help developers achieve some security goals without the need for expertise in the security domain. Some security pattern combinations can be beneficial while others are inconsistent. Model checking can be used to verify the production of combining multiple security patterns with an architecture. Supervisory control and data acquisition (SCADA) systems control many of our critical industrial infrastructures. Due to their limitations, and their augmented connectivity, SCADA systems have many unresolved security issues. In this paper, we demonstrate how we can automatically generate a secure SCADA model based on an insecure one and how to verify the generated model.},
langid = {english},
file = {/home/danesabo/Zotero/storage/U324MFYG/Obeid and Dhaussy - 2019 - Formal Verification of Security Pattern Compositio.pdf}
}
@article{oberkampfVerificationValidationPredictive2004,
title = {Verification, Validation, and Predictive Capability in Computational Engineering and Physics},
author = {Oberkampf, William L and Trucano, Timothy G and Hirsch, Charles},
date = {2004-12-21},
journaltitle = {Applied Mechanics Reviews},
shortjournal = {Applied Mechanics Reviews},
volume = {57},
number = {5},
pages = {345--384},
issn = {0003-6900},
doi = {10.1115/1.1767847},
url = {https://doi.org/10.1115/1.1767847},
urldate = {2024-05-21},
abstract = {Developers of computer codes, analysts who use the codes, and decision makers who rely on the results of the analyses face a critical question: How should confidence in modeling and simulation be critically assessed? Verification and validation (V\&amp;V) of computational simulations are the primary methods for building and quantifying this confidence. Briefly, verification is the assessment of the accuracy of the solution to a computational model. Validation is the assessment of the accuracy of a computational simulation by comparison with experimental data. In verification, the relationship of the simulation to the real world is not an issue. In validation, the relationship between computation and the real world, ie, experimental data, is the issue. This paper presents our viewpoint of the state of the art in V\&amp;V in computational physics. (In this paper we refer to all fields of computational engineering and physics, eg, computational fluid dynamics, computational solid mechanics, structural dynamics, shock wave physics, computational chemistry, etc, as computational physics.) We describe our view of the framework in which predictive capability relies on V\&amp;V, as well as other factors that affect predictive capability. Our opinions about the research needs and management issues in V\&amp;V are very practical: What methods and techniques need to be developed and what changes in the views of management need to occur to increase the usefulness, reliability, and impact of computational physics for decision making about engineering systems? We review the state of the art in V\&amp;V over a wide range of topics, for example, prioritization of V\&amp;V activities using the Phenomena Identification and Ranking Table (PIRT), code verification, software quality assurance (SQA), numerical error estimation, hierarchical experiments for validation, characteristics of validation experiments, the need to perform nondeterministic computational simulations in comparisons with experimental data, and validation metrics. We then provide an extensive discussion of V\&amp;V research and implementation issues that we believe must be addressed for V\&amp;V to be more effective in improving confidence in computational predictive capability. Some of the research topics addressed are development of improved procedures for the use of the PIRT for prioritizing V\&amp;V activities, the method of manufactured solutions for code verification, development and use of hierarchical validation diagrams, and the construction and use of validation metrics incorporating statistical measures. Some of the implementation topics addressed are the needed management initiatives to better align and team computationalists and experimentalists in conducting validation activities, the perspective of commercial software companies, the key role of analysts and decision makers as code customers, obstacles to the improved effectiveness of V\&amp;V, effects of cost and schedule constraints on practical applications in industrial settings, and the role of engineering standards committees in documenting best practices for V\&amp;V. There are 207 references cited in this review article.},
file = {/home/danesabo/Zotero/storage/HZLXFU2F/Oberkampf et al. - 2004 - Verification, validation, and predictive capabilit.pdf;/home/danesabo/Zotero/storage/T59DSDXT/Verification-validation-and-predictive-capability.html}
}
@inproceedings{oortwijnFormalVerificationIndustrial2019,
title = {Formal Verification of an Industrial Safety-Critical Traffic Tunnel Control System},
booktitle = {Integrated {{Formal Methods}}: 15th {{International Conference}}, {{IFM}} 2019, {{Bergen}}, {{Norway}}, {{December}} 2–6, 2019, {{Proceedings}} 15},
author = {Oortwijn, Wytse and Huisman, Marieke},
date = {2019},
pages = {418--436},
publisher = {Springer},
isbn = {3-030-34967-5},
file = {/home/danesabo/Zotero/storage/ETG23NE6/FV of an industrial safety critical traffic tunnel control system.pdf}
}
@software{OperatingSystemDevelopment2024,
title = {Operating {{System}} Development Tutorials in {{Rust}} on the {{Raspberry Pi}}},
date = {2024-01-02T19:27:42Z},
origdate = {2018-03-31T17:08:56Z},
url = {https://github.com/rust-embedded/rust-raspberrypi-OS-tutorials},
urldate = {2024-01-02},
abstract = {:books: Learn to write an embedded OS in Rust :crab:},
organization = {Rust Embedded}
}
@article{oppenheimEffectsFiniteRegister1972,
title = {Effects of Finite Register Length in Digital Filtering and the Fast {{Fourier}} Transform},
author = {Oppenheim, A.V. and Weinstein, C.J.},
date = {1972-08},
journaltitle = {Proceedings of the IEEE},
volume = {60},
number = {8},
pages = {957--976},
issn = {1558-2256},
doi = {10.1109/PROC.1972.8820},
url = {https://ieeexplore.ieee.org/abstract/document/1450750?casa_token=kAczMhD2oroAAAAA:GjI24f6aTAdM8lKXQE0tQ6p-6g7wJ4divWdNyJY1VX9m6NnZcPmnlaWOLfl0grGcvpHxcFV7JQ},
urldate = {2024-02-08},
abstract = {When digital signal processing operations are implemented on a computer or with special-purpose hardware, errors and constraints due to finite word length are unavoidable. The main categories of finite register length effects are errors due to A/D conversion, errors due to roundoffs in the arithmetic, constraints on signal levels imposed by the need to prevent overflow, and quantization of system coefficients. The effects of finite register length on implementations of linear recursive difference equation digital filters, and the fast Fourier transform (FFT), are discussed in some detail. For these algorithms, the differing quantization effects of fixed point, floating point, and block floating point arithmetic are examined and compared. The paper is intended primarily as a tutorial review of a subject which has received considerable attention over the past few years. The groundwork is set through a discussion of the relationship between the binary representation of numbers and truncation or rounding, and a formulation of a statistical model for arithmetic roundoff. The analyses presented here are intended to illustrate techniques of working with particular models. Results of previous work are discussed and summarized when appropriate. Some examples are presented to indicate how the results developed for simple digital filters and the FFT can be applied to the analysis of more complicated systems which use these algorithms as building blocks.},
eventtitle = {Proceedings of the {{IEEE}}},
file = {/home/danesabo/Zotero/storage/ZW4396UZ/Oppenheim and Weinstein - 1972 - Effects of finite register length in digital filte.pdf}
}
@article{oppenheimRealizationDigitalFilters1970,
title = {Realization of Digital Filters Using Block-Floating-Point Arithmetic},
author = {Oppenheim, A.},
date = {1970-06},
journaltitle = {IEEE Transactions on Audio and Electroacoustics},
volume = {18},
number = {2},
pages = {130--136},
issn = {1558-2582},
doi = {10.1109/TAU.1970.1162085},
url = {https://ieeexplore.ieee.org/abstract/document/1162085?casa_token=Ah4FKuW8dWsAAAAA:sY06mnCtOtw44rCWhPiuSFDyipuJoHikB-SMO_-NAvYxEbwQtggd2pWmez3Xl6ztTcfeKRWdhA},
urldate = {2024-02-08},
abstract = {Recently, statistical models for the effects of roundoff noise in fixed-point and floating-point realizations of digital filters have been proposed and verified, and a comparison between these realizations presented. In this paper a structure for implementing digital filters using block-floating-point arithmetic is proposed and a statistical analysis of the effects of roundoff noise is carried out. On the basis of this analysis, block-floating-point is compared to fixed-point and floating-point arithmetic with regard to roundoff noise effects.},
eventtitle = {{{IEEE Transactions}} on {{Audio}} and {{Electroacoustics}}},
file = {/home/danesabo/Zotero/storage/J3ZGI8I5/Oppenheim - 1970 - Realization of digital filters using block-floatin.pdf;/home/danesabo/Zotero/storage/W4RD4ZZA/1162085.html}
}
@article{osherLevelSetMethods2001,
title = {Level {{Set Methods}}: {{An Overview}} and {{Some Recent Results}}},
shorttitle = {Level {{Set Methods}}},
author = {Osher, Stanley and Fedkiw, Ronald P.},
date = {2001-05-20},
journaltitle = {Journal of Computational Physics},
shortjournal = {Journal of Computational Physics},
volume = {169},
number = {2},
pages = {463--502},
issn = {0021-9991},
doi = {10.1006/jcph.2000.6636},
url = {https://www.sciencedirect.com/science/article/pii/S0021999100966361},
urldate = {2023-10-27},
abstract = {The level set method was devised by S. Osher and J. A. Sethian (1988, J. Comput. Phys.79, 12–49) as a simple and versatile method for computing and analyzing the motion of an interface Γ in two or three dimensions. Γ bounds a (possibly multiply connected) region Ω. The goal is to compute and analyze the subsequent motion of Γ under a velocity field v. This velocity can depend on position, time, the geometry of the interface, and the external physics. The interface is captured for later time as the zero level set of a smooth (at least Lipschitz continuous) function ϕ (x, t); i.e., Γ(t)=\{x|ϕ(x, t)=0\}. ϕ is positive inside Ω, negative outside Ω, and is zero on Γ(t). Topological merging and breaking are well defined and easily performed. In this review article we discuss recent variants and extensions, including the motion of curves in three dimensions, the dynamic surface extension method, fast methods for steady state problems, diffusion generated motion, and the variational level set approach. We also give a user's guide to the level set dictionary and technology and couple the method to a wide variety of problems involving external physics, such as compressible and incompressible (possibly reacting) flow, Stefan problems, kinetic crystal growth, epitaxial growth of thin films, vortex-dominated flows, and extensions to multiphase motion. We conclude with a discussion of applications to computer vision and image processing.},
file = {/home/danesabo/Zotero/storage/MII47KKR/Osher and Fedkiw - 2001 - Level Set Methods An Overview and Some Recent Res.pdf;/home/danesabo/Zotero/storage/LAYPWLCS/S0021999100966361.html}
}
@video{outlierDiffusionModelsPaper2022,
entrysubtype = {video},
title = {Diffusion {{Models}} | {{Paper Explanation}} | {{Math Explained}}},
editor = {{Outlier}},
editortype = {director},
date = {2022-06-06},
url = {https://www.youtube.com/watch?v=HoKDTa5jHvg},
urldate = {2023-10-10},
abstract = {Diffusion Models are generative models just like GANs. In recent times many state-of-the-art works have been released that build on top of diffusion models such as \#dalle or \#imagen. In this video I give a detailed explanation of how they work. At first I explain the fundamental idea of these models and later we dive deep into the math part. I try to explain all of this on a really easy \& intuitive level. After the math derivation, we look at the results from different papers and how they compare to other methods. \#diffusion \#dalle2 \#dalle \#imagen 00:00 Introduction 02:48 Idea \& Theory 07:06 Architecture 09:33 Math Derivation 26:59 Algorithms 28:22 Improvements 29:43 Results 31:34 Summary Further Reading: 1. Paper: https://arxiv.org/pdf/1503.03585.pdf 2. Paper: https://arxiv.org/pdf/2006.11239.pdf 3. Paper: https://arxiv.org/pdf/2102.09672.pdf 4. Paper: https://arxiv.org/pdf/2105.05233.pdf 5. VAE \& Reparam. Trick: https://lilianweng.github.io/posts/20... 6. Written Tutorial: https://lilianweng.github.io/posts/20... PyTorch Implementation Video: ~~~•~Diffusion~Models~|~PyTorch~Implementa...~~ Follow me on instagram lol: https://www.instagram.com/dome271}
}
@video{outlierDiffusionModelsPyTorch2022,
entrysubtype = {video},
title = {Diffusion {{Models}} | {{PyTorch Implementation}}},
editor = {{Outlier}},
editortype = {director},
date = {2022-09-20},
url = {https://www.youtube.com/watch?v=TBCRlnwJtZU},
urldate = {2023-10-11},
abstract = {Diffusion Models are generative models just like GANs. In recent times many state-of-the-art works have been released that build on top of diffusion models such as \#dalle , \#imagen or \#stablediffusion . In this video I'm coding a PyTorch implementation of diffusion models in a very easy and straightforward way. At first I'm showing how to implement an unconditional version and subsequently train it. After that I'm explaining 2 popular improvements for diffusion models: classifier free guidance and exponential moving average. I'm also going to implement both updates and train a conditional model on CIFAR-10 and afterwards compare the different results. Code: https://github.com/dome272/Diffusion-... \#diffusion \#dalle2 \#dalle \#imagen \#stablediffusion 00:00 Introduction 02:05 Recap 03:16 Diffusion Tools 07:22 UNet 13:07 Training Loop 15:44 Unconditional Results 16:05 Classifier Free Guidance 19:16 Exponential Moving Average 21:05 Conditional Results 21:51 Github Code \& Outro Further Reading: 1. Paper: https://arxiv.org/pdf/1503.03585.pdf 2. Paper: https://arxiv.org/pdf/2006.11239.pdf 3. Paper: https://arxiv.org/pdf/2102.09672.pdf 4. Paper: https://arxiv.org/pdf/2105.05233.pdf 5. CFG: https://arxiv.org/pdf/2207.12598.pdf 6. Timestep Embedding: https://machinelearningmastery.com/a-... Follow me on instagram lol: https://www.instagram.com/dome271}
}
@article{pagettiMultitaskImplementationMultiperiodic2011,
title = {Multi-Task {{Implementation}} of {{Multi-periodic Synchronous Programs}}},
author = {Pagetti, Claire and Forget, Julien and Boniol, Frédéric and Cordovilla, Mikel and Lesens, David},
date = {2011-09},
journaltitle = {Discrete Event Dynamic Systems},
shortjournal = {Discrete Event Dyn Syst},
volume = {21},
number = {3},
pages = {307--338},
issn = {0924-6703, 1573-7594},
doi = {10.1007/s10626-011-0107-x},
url = {http://link.springer.com/10.1007/s10626-011-0107-x},
urldate = {2023-11-02},
abstract = {This article presents a complete scheme for the integration and the development of multi-periodic critical embedded systems. A system is formally specified as a modular and hierarchical assembly of several locally mono-periodic synchronous functions into a globally multi-periodic synchronous system. To support this, we introduce a real-time software architecture description language, named Prelude, which is built upon the synchronous languages and which provides a high level of abstraction for describing the functional and the real-time architecture of a multiperiodic control system. A program is translated into a set of real-time tasks that can be executed on a monoprocessor real-time platform with an on-line priority-based scheduler such as Deadline-Monotonic or Earliest-Deadline-First. The compilation is formally proved correct, meaning that the generated code respects the real-time semantics of the original program (respect of periods, deadlines, release dates and precedences) as well as its functional semantics (respect of variable consumption).},
langid = {english},
keywords = {Important},
file = {/home/danesabo/Zotero/storage/PHDK9CNV/Pagetti et al. - 2011 - Multi-task Implementation of Multi-periodic Synchr.pdf}
}
@article{palenskyCosimulatingIntegratedEnergy2024,
title = {Cosimulating {{Integrated Energy Systems With Heterogeneous Digital Twins}}: {{Matching}} a {{Connected World}}},
shorttitle = {Cosimulating {{Integrated Energy Systems With Heterogeneous Digital Twins}}},
author = {Palensky, Peter and Mancarella, Pierluigi and Hardy, Trevor and Cvetkovic, Milos},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {52--60},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3324886},
url = {https://ieeexplore.ieee.org/document/10398554/},
urldate = {2024-03-13},
abstract = {Energy system integration promises in-creased resiliency and the unlocking of synergies, while also contributing to our goal of decarbonization. It is enabled by both old and new technologies, glued together with data and digital services. Hydrolyzers, heat pumps, distributed renewable generation, smart buildings, and the digital grid edge are all currently the subject of integration with the power system and the energy sector at large. To plan and operate such a multidisciplinary and multisectoral system properly, insight, tools, and expertise are all needed. This is exactly where the state of the art fails to deliver: tools for integrated energy systems (IESs) are still in their infancy, and many times, even academia treats these sectors separately, producing experts in each of them but not across.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/WUYLXT7I/Palensky et al. - 2024 - Cosimulating Integrated Energy Systems With Hetero.pdf;/home/danesabo/Zotero/storage/LNNR59EV/10398554.html}
}
@article{parkReliableIntelligentDiagnostic2022,
title = {A Reliable Intelligent Diagnostic Assistant for Nuclear Power Plants Using Explainable Artificial Intelligence of {{GRU-AE}}, {{LightGBM}} and {{SHAP}}},
author = {Park, Ji Hun and Jo, Hye Seon and Lee, Sang Hyun and Oh, Sang Won and Na, Man Gyun},
date = {2022-04},
journaltitle = {Nuclear Engineering and Technology},
shortjournal = {Nuclear Engineering and Technology},
volume = {54},
number = {4},
pages = {1271--1287},
issn = {17385733},
doi = {10.1016/j.net.2021.10.024},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1738573321006082},
urldate = {2023-10-11},
abstract = {When abnormal operating conditions occur in nuclear power plants, operators must identify the occurrence cause and implement the necessary mitigation measures. Accordingly, the operator must rapidly and accurately analyze the symptom requirements of more than 200 abnormal scenarios from the trends of many variables to perform diagnostic tasks and implement mitigation actions rapidly. However, the probability of human error increases owing to the characteristics of the diagnostic tasks performed by the operator. Researches regarding diagnostic tasks based on Artificial Intelligence (AI) have been conducted recently to reduce the likelihood of human errors; however, reliability issues due to the black box characteristics of AI have been pointed out. Hence, the application of eXplainable Artificial Intelligence (XAI), which can provide AI diagnostic evidence for operators, is considered. In conclusion, the XAI to solve the reliability problem of AI is included in the AI-based diagnostic algorithm. A reliable intelligent diagnostic assistant based on a merged diagnostic algorithm, in the form of an operator support system, is developed, and includes an interface to efficiently inform operators.},
langid = {english},
file = {/home/danesabo/Zotero/storage/G75WD4A6/Park et al. - 2022 - A reliable intelligent diagnostic assistant for nu.pdf}
}
@article{parksNewProofRouthHurwitz1962,
title = {A New Proof of the {{Routh-Hurwitz}} Stability Criterion Using the Second Method of {{Liapunov}}},
author = {Parks, P. C.},
date = {1962-10},
journaltitle = {Mathematical Proceedings of the Cambridge Philosophical Society},
volume = {58},
number = {4},
pages = {694--702},
issn = {1469-8064, 0305-0041},
doi = {10.1017/S030500410004072X},
url = {https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/new-proof-of-the-routhhurwitz-stability-criterion-using-the-second-method-of-liapunov/15C073E593E77B9A869252AC398F5408},
urldate = {2024-03-05},
abstract = {The second method of Liapunov is a useful technique for investigating the stability of linear and non-linear ordinary differential equations. It is well known that the second method of Liapunov, when applied to linear differential equations with real constant coefficients, gives rise to sets of necessary and sufficient stability conditions which are alternatives to the well-known Routh-Hurwitz conditions. In this paper a direct proof of the Routh-Hurwitz conditions themselves is given using Liapunov's second method. The new proof is ‘elementary’ in that it depends on the fundamental concept of stability associated with Liapunov's second method, and not on theorems in the complex integral calculus which are required in the usual proofs. A useful by-product of this new proof is a method of determining the coefficients of a linear differential equation with real constant coefficients in terms of its Hurwitz determinants.},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZEHZS8K8/Parks - 1962 - A new proof of the Routh-Hurwitz stability criteri.pdf}
}
@article{pattersonDiagrammaticViewDifferential2022,
title = {A Diagrammatic View of Differential Equations in Physics},
author = {Patterson, Evan and Baas, Andrew and Hosgood, Timothy and Fairbanks, James},
date = {2022},
journaltitle = {Mathematics in Engineering},
shortjournal = {MINE},
volume = {5},
number = {2},
pages = {1--59},
issn = {2640-3501},
doi = {10.3934/mine.2023036},
url = {http://www.aimspress.com/article/doi/10.3934/mine.2023036},
urldate = {2023-12-12},
abstract = {{$<$}abstract{$><$}p{$>$}Presenting systems of differential equations in the form of diagrams has become common in certain parts of physics, especially electromagnetism and computational physics. In this work, we aim to put such use of diagrams on a firm mathematical footing, while also systematizing a broadly applicable framework to reason formally about systems of equations and their solutions. Our main mathematical tools are category-theoretic diagrams, which are well known, and morphisms between diagrams, which have been less appreciated. As an application of the diagrammatic framework, we show how complex, multiphysical systems can be modularly constructed from basic physical principles. A wealth of examples, drawn from electromagnetism, transport phenomena, fluid mechanics, and other fields, is included.{$<$}/p{$><$}/abstract{$>$}},
file = {/home/danesabo/Zotero/storage/5UGQYQQC/Patterson et al. - 2022 - A diagrammatic view of differential equations in p.pdf}
}
@article{pattersonFrameworkIntegratedNuclear2016,
title = {A Framework for an Integrated Nuclear Digital Environment},
author = {Patterson, Eann A. and Taylor, Richard J. and Bankhead, Mark},
date = {2016-03},
journaltitle = {Progress in Nuclear Energy},
shortjournal = {Progress in Nuclear Energy},
volume = {87},
pages = {97--103},
issn = {01491970},
doi = {10.1016/j.pnucene.2015.11.009},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0149197015301104},
urldate = {2023-10-11},
abstract = {A conceptual framework is proposed for a digital environment extending from the prototype design of nuclear plants through operations and decommissioning to storage and waste disposal. The environment consists of a series of interconnected multi-scale, multi-physics computational models linked to the realworld by data acquired during validation of prototypes, in-service monitoring and inspections of plant, post-shut-down inspections of plant and in-situ monitoring of stored waste. The technology gaps for the implementation of the integrated nuclear digital environment (INDE) are identified and discussed together with the advantages to be gained from its implementation. Implementation of INDE will be dependent on future advances in High Performance Computing systems approaching the exascale and parallel advances in the development of algorithms for processing large amounts of data. The data itself will be acquired through innovations in measurement, analysis and uncertainty and will be applied through projects relating to lifetime extension, decommissioning and resurgent national science programmes. It is postulated that the existence of this type of framework might be inevitable given both nuclear-specific and non-nuclear drivers and may be essential for the nuclear industry to deliver current and future challenges from the clean-up of legacy waste sites to time and budget, future generation nuclear reactors and small-scale mass-production of modular nuclear power plants. It is proposed that implementation of INDE will lead to shorten development times, reduced costs and increased credibility, operability, reliability and safety.},
langid = {english},
file = {/home/danesabo/Zotero/storage/IHX3VDBU/Patterson et al. - 2016 - A framework for an integrated nuclear digital envi.pdf}
}
@unpublished{peetModernControlSystems,
title = {Modern {{Control Systems}}: {{Small Gain Theorem}}},
author = {Peet, Matthew},
url = {https://control.asu.edu/Classes/MMAE543/543Lecture15.pdf},
file = {/home/danesabo/Zotero/storage/ELHTM2HI/543Lecture15.pdf}
}
@article{peisertSoftwareInfrastructureDevelop2023,
title = {On {{Software Infrastructure}}: {{Develop}}, {{Prove}}, {{Profit}}?},
shorttitle = {On {{Software Infrastructure}}},
author = {Peisert, Sean},
date = {2023-07},
journaltitle = {IEEE Security \& Privacy},
shortjournal = {IEEE Secur. Privacy},
volume = {21},
number = {4},
pages = {4--8},
issn = {1540-7993, 1558-4046},
doi = {10.1109/MSEC.2023.3273492},
url = {https://ieeexplore.ieee.org/document/10194513/},
urldate = {2023-12-19},
langid = {english},
file = {/home/danesabo/Zotero/storage/QYTUNVU7/Peisert - 2023 - On Software Infrastructure Develop, Prove, Profit.pdf}
}
@article{peisertSoftwareInfrastructureDevelop2023a,
title = {On {{Software Infrastructure}}: {{Develop}}, {{Prove}}, {{Profit}}?},
shorttitle = {On {{Software Infrastructure}}},
author = {Peisert, Sean},
date = {2023-07},
journaltitle = {IEEE Security \& Privacy},
volume = {21},
number = {4},
pages = {4--8},
issn = {1558-4046},
doi = {10.1109/MSEC.2023.3273492},
url = {https://ieeexplore.ieee.org/document/10194513},
urldate = {2023-10-25},
abstract = {Having infrastructure survive over very long stretches of time is a nontrivial task. This is either because such infrastructure needs to be built extremely well from the outset or because it requires ongoing maintenance. The former may require prohibitively large initial investments. The latter requires ongoing investment from public agencies over the span of decades or centuries despite the pendulum swings of those governments from contrasting political aims. Without either the very high initial or ongoing investment, infrastructure can fail. Physical infrastructure failure is not inevitable—consider railways in Japan, the Panama Canal, and the U.S. Interstate Highway System.},
eventtitle = {{{IEEE Security}} \& {{Privacy}}},
file = {/home/danesabo/Zotero/storage/U9L65YQ8/Peisert - 2023 - On Software Infrastructure Develop, Prove, Profit.pdf}
}
@inproceedings{peletiesAsymptoticStabilityMSwitched1991,
title = {Asymptotic {{Stability}} of M-{{Switched Systems}} Using {{Lyapunov-Like Functions}}},
booktitle = {1991 {{American Control Conference}}},
author = {Peleties, Philippos and DeCarlo, Raymond},
date = {1991-06},
pages = {1679--1684},
publisher = {IEEE},
location = {Boston, MA, USA},
doi = {10.23919/ACC.1991.4791667},
url = {https://ieeexplore.ieee.org/document/4791667/},
urldate = {2024-03-04},
eventtitle = {1991 {{American Control Conference}}},
isbn = {978-0-87942-565-4}
}
@report{petersenWorkforceFrameworkCybersecurity2020,
title = {Workforce {{Framework}} for {{Cybersecurity}} ({{NICE Framework}})},
author = {Petersen, Rodney and Santos, Danielle and Wetzel, Karen and Smith, Matthew and Witte, Gregory},
date = {2020-11-16},
number = {NIST Special Publication (SP) 800-181 Rev. 1},
institution = {{National Institute of Standards and Technology}},
doi = {10.6028/NIST.SP.800-181r1},
url = {https://csrc.nist.gov/pubs/sp/800/181/r1/final},
urldate = {2023-11-07},
abstract = {This publication from the National Initiative for Cybersecurity Education (NICE) describes the Workforce Framework for Cybersecurity (NICE Framework), a fundamental reference for describing and sharing information about cybersecurity work. It expresses that work as Task statements and describes Knowledge and Skill statements that provide a foundation for learners including students, job seekers, and employees. The use of these statements helps students to develop skills, job seekers to demonstrate competencies, and employees to accomplish tasks. As a common, consistent lexicon that categorizes and describes cybersecurity work, the NICE Framework improves communication about how to identify, recruit, develop, and retain cybersecurity talent. The NICE Framework is a reference source from which organizations or sectors can develop additional publications or tools that meet their needs to define or provide guidance on different aspects of cybersecurity education, training, and workforce...},
langid = {english},
file = {/home/danesabo/Zotero/storage/PB94MBA3/Petersen et al. - 2020 - Workforce Framework for Cybersecurity (NICE Framew.pdf}
}
@inproceedings{petterssonStabilityRobustnessHybrid1996,
title = {Stability and Robustness for Hybrid Systems},
booktitle = {Proceedings of 35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
author = {Pettersson, S. and Lennartson, B.},
date = {1996},
volume = {2},
pages = {1202--1207},
publisher = {IEEE},
location = {Kobe, Japan},
doi = {10.1109/CDC.1996.572653},
url = {http://ieeexplore.ieee.org/document/572653/},
urldate = {2024-03-04},
eventtitle = {35th {{IEEE Conference}} on {{Decision}} and {{Control}}},
isbn = {978-0-7803-3590-5}
}
@article{pichlerEntropyBasedRisk2020,
title = {Entropy Based Risk Measures},
author = {Pichler, Alois and Schlotter, Ruben},
date = {2020-08},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {285},
number = {1},
pages = {223--236},
issn = {03772217},
doi = {10.1016/j.ejor.2019.01.016},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221719300189},
urldate = {2024-01-26},
langid = {english},
file = {/home/danesabo/Zotero/storage/HYC7B5I4/Pichler and Schlotter - 2020 - Entropy based risk measures.pdf}
}
@online{PicturingQuantumProcesses,
title = {Picturing {{Quantum Processes}} | {{Quantum}} Physics, Quantum Information and Quantum Computation},
url = {https://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation/picturing-quantum-processes-first-course-quantum-theory-and-diagrammatic-reasoning, https://www.cambridge.org/us/academic/subjects/physics/quantum-physics-quantum-information-and-quantum-computation},
urldate = {2023-12-12},
langid = {english},
organization = {Cambridge University Press}
}
@article{platzerDifferentialDynamicLogic2008,
title = {Differential {{Dynamic Logic}} for {{Hybrid Systems}}},
author = {Platzer, André},
date = {2008-08},
journaltitle = {Journal of Automated Reasoning},
shortjournal = {J Autom Reasoning},
volume = {41},
number = {2},
pages = {143--189},
issn = {0168-7433, 1573-0670},
doi = {10.1007/s10817-008-9103-8},
url = {https://link.springer.com/10.1007/s10817-008-9103-8},
urldate = {2023-10-10},
abstract = {Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equations. With the goal of developing a theoretical and practical foundation for deductive verification of hybrid systems, we introduce a dynamic logic for hybrid programs, which is a program notation for hybrid systems. As a verification technique that is suitable for automation, we introduce a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic. The calculus is compositional, i.e., it reduces properties of hybrid programs to properties of their parts. Our main result proves that this calculus axiomatises the transition behaviour of hybrid systems completely relative to differential equations. In a case study with cooperating traffic agents of the European Train Control System, we further show that our calculus is well-suited for verifying realistic hybrid systems with parametric system dynamics.},
langid = {english},
file = {/home/danesabo/Zotero/storage/6SGTLZ4W/Platzer - 2008 - Differential Dynamic Logic for Hybrid Systems.pdf}
}
@inproceedings{platzerKeYmaeraHybridTheorem2008,
title = {{{KeYmaera}}: {{A Hybrid Theorem Prover}} for {{Hybrid Systems}} ({{System Description}})},
shorttitle = {{{KeYmaera}}},
booktitle = {Automated {{Reasoning}}},
author = {Platzer, André and Quesel, Jan-David},
editor = {Armando, Alessandro and Baumgartner, Peter and Dowek, Gilles},
date = {2008},
pages = {171--178},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-540-71070-7_15},
abstract = {KeYmaera is a hybrid verification tool for hybrid systems that combines deductive, real algebraic, and computer algebraic prover technologies. It is an automated and interactive theorem prover for a natural specification and verification logic for hybrid systems. KeYmaera supports differential dynamic logic, which is a real-valued first-order dynamic logic for hybrid programs, a program notation for hybrid automata. For automating the verification process, KeYmaera implements a generalized free-variable sequent calculus and automatic proof strategies that decompose the hybrid system specification symbolically. To overcome the complexity of real arithmetic, we integrate real quantifier elimination following an iterative background closure strategy. Our tool is particularly suitable for verifying parametric hybrid systems and has been used successfully for verifying collision avoidance in case studies from train control and air traffic management.},
isbn = {978-3-540-71070-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/GBPSG5W4/Platzer and Quesel - 2008 - KeYmaera A Hybrid Theorem Prover for Hybrid Syste.pdf}
}
@book{platzerLogicalFoundationsCyberPhysical2018,
title = {Logical {{Foundations}} of {{Cyber-Physical Systems}}},
author = {Platzer, André},
date = {2018},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-63588-0},
url = {http://link.springer.com/10.1007/978-3-319-63588-0},
urldate = {2023-10-11},
isbn = {978-3-319-63587-3 978-3-319-63588-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/VTPT3HIX/Platzer - 2018 - Logical Foundations of Cyber-Physical Systems.pdf}
}
@inproceedings{podelskiModelCheckingHybrid2006,
title = {Model {{Checking}} of {{Hybrid Systems}}: {{From Reachability Towards Stability}}},
shorttitle = {Model {{Checking}} of {{Hybrid Systems}}},
booktitle = {Hybrid {{Systems}}: {{Computation}} and {{Control}}},
author = {Podelski, Andreas and Wagner, Silke},
editor = {Hespanha, João P. and Tiwari, Ashish},
date = {2006},
series = {Lecture {{Notes}} in {{Computer Science}}},
pages = {507--521},
publisher = {Springer},
location = {Berlin, Heidelberg},
doi = {10.1007/11730637_38},
abstract = {We call a hybrid system stable if every trajectory inevitably ends up in a given region. Our notion of stability deviates from classical definitions in control theory. In this paper, we present a model checking algorithm for stability in the new sense. The idea of the algorithm is to reduce the stability proof for the whole system to a set of (smaller) proofs for several one-mode systems.},
isbn = {978-3-540-33171-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/IM9M5J3J/Podelski and Wagner - 2006 - Model Checking of Hybrid Systems From Reachabilit.pdf}
}
@article{polaControlCyberPhysicalSystemsLogic2019,
title = {Control of {{Cyber-Physical-Systems}} with Logic Specifications: {{A}} Formal Methods Approach},
shorttitle = {Control of {{Cyber-Physical-Systems}} with Logic Specifications},
author = {Pola, Giordano and Di Benedetto, Maria Domenica},
date = {2019},
journaltitle = {Annual Reviews in Control},
shortjournal = {Annual Reviews in Control},
volume = {47},
pages = {178--192},
issn = {13675788},
doi = {10.1016/j.arcontrol.2019.03.010},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1367578818302153},
urldate = {2023-10-10},
langid = {english},
file = {/home/danesabo/Zotero/storage/SQ8SI8US/Pola and Di Benedetto - 2019 - Control of Cyber-Physical-Systems with logic speci.pdf}
}
@article{pollackHowBelieveMachineChecked1997,
title = {How to {{Believe}} a {{Machine-Checked Proof}}},
author = {Pollack, Robert},
date = {1997},
file = {/home/danesabo/Zotero/storage/Y67DUZUK/Pollack - 1997 - How to Believe a Machine-Checked Proof.pdf}
}
@online{poluGenerativeLanguageModeling2020,
title = {Generative {{Language Modeling}} for {{Automated Theorem Proving}}},
author = {Polu, Stanislas and Sutskever, Ilya},
date = {2020-09-07},
eprint = {2009.03393},
eprinttype = {arXiv},
eprintclass = {cs, stat},
doi = {10.48550/arXiv.2009.03393},
url = {http://arxiv.org/abs/2009.03393},
urldate = {2024-03-07},
abstract = {We explore the application of transformer-based language models to automated theorem proving. This work is motivated by the possibility that a major limitation of automated theorem provers compared to humans -- the generation of original mathematical terms -- might be addressable via generation from language models. We present an automated prover and proof assistant, GPT-f, for the Metamath formalization language, and analyze its performance. GPT-f found new short proofs that were accepted into the main Metamath library, which is to our knowledge, the first time a deep-learning based system has contributed proofs that were adopted by a formal mathematics community.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/DYZKP6NH/Polu and Sutskever - 2020 - Generative Language Modeling for Automated Theorem.pdf;/home/danesabo/Zotero/storage/IQP2QELV/2009.html}
}
@inproceedings{poschmannExperienceFormalMethods1997,
title = {Experience with Formal Methods Implementing the {{PROFIBUS FMS}} and {{DP}} Protocol for Industrial Applications},
booktitle = {Proceedings 1997 {{IEEE International Workshop}} on {{Factory Communication Systems}}. {{WFCS}}'97},
author = {Poschmann, A. and Hahniche, J. and Deicke, P. and Neumann, P.},
date = {1997},
pages = {277--286},
publisher = {IEEE},
location = {Barcelona, Spain},
doi = {10.1109/WFCS.1997.634310},
url = {http://ieeexplore.ieee.org/document/634310/},
urldate = {2023-10-10},
abstract = {This paper presents our experience using the formal description technique Estelle for the protocol development cycle in the area of real-time industrial communication systems. A s a real world application the PROFIBUS parts FMS and DP of the European fieldbus standard were completely implemented using formal models. These implementations are successfully used in industrial applications and embedded systems. Our development method, results, and experiences during the development process are discussed in the paper. A closed, tool based method is the overall aim concerning the development life cycle to support the requirement definition as well as the implementation of the product code with final testing, To meet these needs, our approach defines some assumptions and constraints using the syntactic and semantic model of the specif cation language Estelle, aspects of the modelling process concerning the architecture, handling data abstraction and encapsulation of the specification language vs. real-time data pow in the product code implementation, synchronous vs. asynchronous communications to local intefaces (e.g. physical layer or partly data link layer ASIC) and dealing with special local events like timeoutsr and interrupts in the specification and in the real-time execution environment. The paper discusses advantages and also critical points using the formal way of the protocol development cycle. In theory, it is quite clear that formal description techniques enhance quality. Therefore, we discuss this approach under the user’s point of view.},
eventtitle = {1997 {{IEEE International Workshop}} on {{Factory Communication Systems}}. {{WFCS}}'97},
isbn = {978-0-7803-4182-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/KRBSMLW7/Poschmann et al. - 1997 - Experience with formal methods implementing the PR.pdf}
}
@article{powellOPTIMIZINGSIMULATORMERGINGSIMULATION,
title = {{{THE OPTIMIZING-SIMULATOR}}: {{MERGING SIMULATION AND OPTIMIZATION USING APPROXIMATE DYNAMIC PROGRAMMING}}},
author = {Powell, Warren B},
abstract = {There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional problems in operations research. Simulation strives to model operations, often using rule-based logic. Optimization strives to find the best possible solution, minimizing costs or maximizing profits. In this tutorial, we show how these two modeling technologies can be brought together, combining the flexibility of simulation with the intelligence of optimization.},
langid = {english},
file = {/home/danesabo/Zotero/storage/YX23UQKG/Powell - THE OPTIMIZING-SIMULATOR MERGING SIMULATION AND O.pdf}
}
@book{poznyakDifferentialNeuralNetworks2001,
title = {Differential Neural Networks for Robust Nonlinear Control: Identification, State Estimation and Trajectory Tracking},
shorttitle = {Differential Neural Networks for Robust Nonlinear Control},
author = {Poznyak, Alexander S.},
namea = {Yu, Wen and Sanchez, Edgar N.},
nameatype = {collaborator},
date = {2001},
edition = {1st ed.},
publisher = {World Scientific},
location = {Singapore ;},
abstract = {This book deals with continuous time dynamic neural networks theory applied to the solution of basic problems in robust control theory, including identification, state space estimation (based on neuro-observers) and trajectory tracking. The plants to be identified and controlled are assumed to be a priori unknown but belonging to a given class containing internal unmodelled dynamics and external perturbations as well. The error stability analysis and the corresponding error bounds for different problems are presented. The effectiveness of the suggested approach is illustrated by its ap},
isbn = {9786611956738},
langid = {english},
pagetotal = {455},
keywords = {Neural networks (Computer science),Nonlinear control theory},
file = {/home/danesabo/Zotero/storage/8AM9ZNDL/Poznyak - 2001 - Differential neural networks for robust nonlinear control identification, state estimation and traj.pdf}
}
@report{prestlBMWActiveCruise2000,
type = {SAE Technical Paper},
title = {The {{BMW Active Cruise Control ACC}}},
author = {Prestl, Willibald and Sauer, Thomas and Steinle, Joachim and Tschernoster, Oliver},
date = {2000-03-06},
number = {2000-01-0344},
institution = {SAE International},
location = {Warrendale, PA},
issn = {0148-7191, 2688-3627},
doi = {10.4271/2000-01-0344},
url = {https://www.sae.org/publications/technical-papers/content/2000-01-0344/},
urldate = {2023-11-20},
abstract = {With series introduction of Adaptive Cruise Control (ACC) systems, automotive industry at present makes a step towards a new category of vehicle control systems. For the first time in automotive history these systems make use of information about the surrounding traffic situation. This information i},
langid = {english}
}
@online{PRISMProbabilisticSymbolic,
title = {{{PRISM}} - {{Probabilistic Symbolic Model Checker}}},
url = {https://www.prismmodelchecker.org/},
urldate = {2023-11-03},
file = {/home/danesabo/Zotero/storage/QE5WA3CJ/www.prismmodelchecker.org.html}
}
@online{ProofsArgumentsZeroKnowledge,
title = {Proofs, {{Arguments}}, and {{Zero-Knowledge}}},
url = {https://people.cs.georgetown.edu/jthaler/ProofsArgsAndZK.html},
urldate = {2024-04-01},
file = {/home/danesabo/Zotero/storage/P9WJ9L6R/ProofsArgsAndZK.html}
}
@online{PropositionsTypesExplained,
title = {Propositions as Types: Explained (and Debunked)},
url = {https://lawrencecpaulson.github.io/2023/08/23/Propositions_as_Types.html},
urldate = {2024-02-22},
file = {/home/danesabo/Zotero/storage/SLRKAUJZ/Propositions_as_Types.html}
}
@inreference{PrototypeVerificationSystem2022,
title = {Prototype {{Verification System}}},
booktitle = {Wikipedia},
date = {2022-12-15T01:46:11Z},
url = {https://en.wikipedia.org/w/index.php?title=Prototype_Verification_System&oldid=1127497212},
urldate = {2024-03-19},
abstract = {The Prototype Verification System (PVS) is a specification language integrated with support tools and an automated theorem prover, developed at the Computer Science Laboratory of SRI International in Menlo Park, California. PVS is based on a kernel consisting of an extension of Church's theory of types with dependent types, and is fundamentally a classical typed higher-order logic. The base types include uninterpreted types that may be introduced by the user, and built-in types such as the booleans, integers, reals, and the ordinals. Type-constructors include functions, sets, tuples, records, enumerations, and abstract data types. Predicate subtypes and dependent types can be used to introduce constraints; these constrained types may incur proof obligations (called type-correctness conditions or TCCs) during typechecking. PVS specifications are organized into parameterized theories. The system is implemented in Common Lisp, and is released under the GNU General Public License (GPL).},
langid = {english},
annotation = {Page Version ID: 1127497212},
file = {/home/danesabo/Zotero/storage/4IIQI8ZR/Prototype_Verification_System.html}
}
@incollection{puysFormalAnalysisSecurity2016,
title = {Formal {{Analysis}} of {{Security Properties}} on the {{OPC-UA SCADA Protocol}}},
booktitle = {Computer {{Safety}}, {{Reliability}}, and {{Security}}},
author = {Puys, Maxime and Potet, Marie-Laure and Lafourcade, Pascal},
editor = {Skavhaug, Amund and Guiochet, Jérémie and Bitsch, Friedemann},
date = {2016},
volume = {9922},
pages = {67--75},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-45477-1_6},
url = {http://link.springer.com/10.1007/978-3-319-45477-1_6},
urldate = {2023-10-10},
abstract = {Industrial systems are publicly the target of cyberattacks since Stuxnet [1]. Nowadays they are increasingly communicating over insecure media such as Internet. Due to their interaction with the real world, it is crucial to prove the security of their protocols. In this paper, we formally study the security of one of the most used industrial protocols: OPC-UA. Using ProVerif, a well known cryptographic protocol verification tool, we are able to check secrecy and authentication properties. We find several attacks on the protocols and provide countermeasures.},
isbn = {978-3-319-45476-4 978-3-319-45477-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/RYTWYIRC/Puys et al. - 2016 - Formal Analysis of Security Properties on the OPC-.pdf}
}
@inproceedings{puysHardwareInTheLoopLabsSCADA2021,
title = {Hardware-{{In-The-Loop Labs}} for {{SCADA Cybersecurity Awareness}} and {{Training}}},
booktitle = {Proceedings of the 16th {{International Conference}} on {{Availability}}, {{Reliability}} and {{Security}}},
author = {Puys, Maxime and Thevenon, Pierre-Henri and Mocanu, Stéphane},
date = {2021-08-17},
series = {{{ARES}} '21},
pages = {1--10},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/3465481.3469185},
url = {https://dl.acm.org/doi/10.1145/3465481.3469185},
urldate = {2024-08-08},
abstract = {In this paper, we present a SCADA cybersecurity awareness and training program based on a Hands-On training using two twin cyber-ranges named WonderICS and G-ICS. These labs are built using a Hardware-In-the-Loop simulation system of the physical process developed by the two partners. The cyber-ranges allow replication of realistic Advanced Persistent Threat (APT) attacks and demonstration of known vulnerabilities, as they rely on real industrial control devices and softwares. In this work, we present both the demonstration scenarios used for awareness on WonderICS and the training programs developed for graduate students on G-ICS.},
isbn = {978-1-4503-9051-4},
file = {/home/danesabo/Zotero/storage/3ZHNNJM9/Puys et al. - 2021 - Hardware-In-The-Loop Labs for SCADA Cybersecurity .pdf}
}
@inproceedings{qinFormalModelingVerification2017,
title = {Formal Modeling and Verification of Flexible Load Control for Power Grid {{CPS}} Based on Differential Dynamic Logic},
booktitle = {2017 {{IEEE Conference}} on {{Energy Internet}} and {{Energy System Integration}} ({{EI2}})},
author = {Qin, Boya and Liu, Dong and Cao, Min and Zou, Jingxi},
date = {2017-11},
pages = {1--6},
publisher = {IEEE},
location = {Beijing},
doi = {10.1109/EI2.2017.8245721},
url = {http://ieeexplore.ieee.org/document/8245721/},
urldate = {2023-10-10},
eventtitle = {2017 {{IEEE Conference}} on {{Energy Internet}} and {{Energy System Integration}} ({{EI2}})},
isbn = {978-1-5386-1427-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/HJ6FT5U9/Qin et al. - 2017 - Formal modeling and verification of flexible load .pdf}
}
@online{rajhansVerificationHybridDynamic,
title = {Verification of {{Hybrid Dynamic Systems Using Linear Hybrid Automata}}},
author = {Rajhans, Akshay},
abstract = {This paper concerns the use of linear hybrid automata (LHA) to verify properties of hybrid dynamic systems based on the concept of simulation relations. Following a review of basic concepts and a description of the LHA analysis tool PHAVer, assume-guarantee reasoning is described as a method for compositional verification. The results from the literature are summarized with an example to illustrate the concepts. Finally, the paper outlines some research directions for making this approach more useful.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/Z99QTYRM/Rajhans - Verification of Hybrid Dynamic Systems Using Linear.pdf}
}
@article{rajhansVerificationHybridDynamica,
title = {Verification of {{Hybrid Dynamic Systems Using Linear Hybrid Automata}}},
author = {Rajhans, Akshay}
}
@article{rasheedDigitalTwinValues2020,
title = {Digital {{Twin}}: {{Values}}, {{Challenges}} and {{Enablers From}} a {{Modeling Perspective}}},
shorttitle = {Digital {{Twin}}},
author = {Rasheed, Adil and San, Omer and Kvamsdal, Trond},
date = {2020},
journaltitle = {IEEE Access},
shortjournal = {IEEE Access},
volume = {8},
pages = {21980--22012},
issn = {2169-3536},
doi = {10.1109/ACCESS.2020.2970143},
url = {https://ieeexplore.ieee.org/document/8972429/},
urldate = {2023-10-11},
abstract = {Digital twin can be defined as a virtual representation of a physical asset enabled through data and simulators for real-time prediction, optimization, monitoring, controlling, and improved decision making. Recent advances in computational pipelines, multiphysics solvers, artificial intelligence, big data cybernetics, data processing and management tools bring the promise of digital twins and their impact on society closer to reality. Digital twinning is now an important and emerging trend in many applications. Also referred to as a computational megamodel, device shadow, mirrored system, avatar or a synchronized virtual prototype, there can be no doubt that a digital twin plays a transformative role not only in how we design and operate cyber-physical intelligent systems, but also in how we advance the modularity of multi-disciplinary systems to tackle fundamental barriers not addressed by the current, evolutionary modeling practices. In this work, we review the recent status of methodologies and techniques related to the construction of digital twins mostly from a modeling perspective. Our aim is to provide a detailed coverage of the current challenges and enabling technologies along with recommendations and reflections for various stakeholders.},
langid = {english},
file = {/home/danesabo/Zotero/storage/58BWKHYM/Rasheed et al. - 2020 - Digital Twin Values, Challenges and Enablers From.pdf}
}
@inproceedings{rauschFormalVerificationPLC1998,
title = {Formal Verification of {{PLC}} Programs},
booktitle = {Proceedings of the 1998 {{American Control Conference}}. {{ACC}} ({{IEEE Cat}}. {{No}}.{{98CH36207}})},
author = {Rausch, M. and Krogh, B.H.},
date = {1998},
pages = {234-238 vol.1},
publisher = {IEEE},
location = {Philadelphia, PA, USA},
doi = {10.1109/ACC.1998.694666},
url = {http://ieeexplore.ieee.org/document/694666/},
urldate = {2023-10-10},
abstract = {This paper presents an approach to the verification of programs for programmablelogic controllers(PLCs) using SMV, a softwqe package for formal verification of state transition systems. Binary PLC programs are converted directly into SMV modules that retain the variable names and execution sequences of the original programs. The system being controlled is modeled by a C/E system block diagram which is also transformed into a set of SMV modules, retaining the structure of the block diagram model. SMV allows the engineer to verify the behavior of the control program over all possible operating conditions. Mechanisms are discussed for representing correctly the concurrent execution of the PLC programs and the plant model using SMV primitives. The SMV approach to PLC program verification is illustrated with an example.},
eventtitle = {Proceedings of the 1998 {{American Control Conference}} ({{ACC}})},
isbn = {978-0-7803-4530-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/7QCJ2RIG/Rausch and Krogh - 1998 - Formal verification of PLC programs.pdf}
}
@article{rehtanzDigitalTwinBuzzword2024,
title = {Digital {{Twin}}: {{From Buzzword To Solutions}} [{{Guest Editorial}}]},
shorttitle = {Digital {{Twin}}},
author = {Rehtanz, Christian and Häger, Ulf and Liu, Chen-Ching},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {14--15},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3339094},
url = {https://ieeexplore.ieee.org/document/10398570/},
urldate = {2024-03-13},
abstract = {When we talk about digitization and digitalization, the term digital twin is not far away; data and information are the new oil for the economy. But hasn’t electrical power always been at the forefront with computational models and computer applications for the secure operation of power systems? With the development of computer systems in the middle of the last century, power systems were one of the first civilian applications. Many standard computing methods and models in power systems have been established for more than half a century. Why are we suddenly researching and talking so much about digital twins, and which new solutions will really be established in practice? In this special issue, we want to explore these questions and examine them from different perspectives.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/55UAFMKU/Rehtanz et al. - 2024 - Digital Twin From Buzzword To Solutions [Guest Ed.pdf;/home/danesabo/Zotero/storage/DUTRXEHQ/10398570.html}
}
@report{ReportCybersecurityCritical2015,
type = {Executive Survey},
title = {Report on {{Cybersecurity}} and {{Critical Infrastructure}} in the {{Americas}}},
date = {2015},
institution = {Trend Micro Incorporated},
file = {/home/danesabo/Zotero/storage/VY5YKDV7/2015 - Report on Cybersecurity and Critical Infrastructur.pdf}
}
@online{RevModPhys,
title = {Rev. {{Mod}}. {{Phys}}. 83, 943 (2011) - {{Bayesian}} Inference in Physics},
url = {https://journals.aps.org/rmp/abstract/10.1103/RevModPhys.83.943},
urldate = {2024-05-21},
file = {/home/danesabo/Zotero/storage/P8JBYTZZ/RevModPhys.83.html}
}
@online{ribeiroWhyShouldTrust2016,
title = {"{{Why Should I Trust You}}?": {{Explaining}} the {{Predictions}} of {{Any Classifier}}},
shorttitle = {"{{Why Should I Trust You}}?},
author = {Ribeiro, Marco Tulio and Singh, Sameer and Guestrin, Carlos},
date = {2016-08-09},
eprint = {1602.04938},
eprinttype = {arXiv},
eprintclass = {cs, stat},
url = {http://arxiv.org/abs/1602.04938},
urldate = {2023-10-11},
abstract = {Despite widespread adoption, machine learning models remain mostly black boxes. Understanding the reasons behind predictions is, however, quite important in assessing trust, which is fundamental if one plans to take action based on a prediction, or when choosing whether to deploy a new model. Such understanding also provides insights into the model, which can be used to transform an untrustworthy model or prediction into a trustworthy one. In this work, we propose LIME, a novel explanation technique that explains the predictions of any classifier in an interpretable and faithful manner, by learning an interpretable model locally around the prediction. We also propose a method to explain models by presenting representative individual predictions and their explanations in a non-redundant way, framing the task as a submodular optimization problem. We demonstrate the flexibility of these methods by explaining different models for text (e.g. random forests) and image classification (e.g. neural networks). We show the utility of explanations via novel experiments, both simulated and with human subjects, on various scenarios that require trust: deciding if one should trust a prediction, choosing between models, improving an untrustworthy classifier, and identifying why a classifier should not be trusted.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/HQA3996Q/Ribeiro et al. - 2016 - Why Should I Trust You Explaining the Predicti.pdf}
}
@article{ritterDigitalTwinDetect2022,
title = {Digital {{Twin}} to {{Detect Nuclear Proliferation}}: {{A Case Study}}},
shorttitle = {Digital {{Twin}} to {{Detect Nuclear Proliferation}}},
author = {Ritter, Christopher and Hays, Ross and Browning, Jeren and Stewart, Ryan and Bays, Samuel and Reyes, Gustavo and Schanfein, Mark and Pluth, Adam and Sabharwall, Piyush and Kunz, Ross and Shields, Ashley and Koudelka, John and Zohner, Porter},
date = {2022-10-01},
journaltitle = {Journal of Energy Resources Technology},
volume = {144},
number = {10},
pages = {102108},
issn = {0195-0738, 1528-8994},
doi = {10.1115/1.4053979},
url = {https://asmedigitalcollection.asme.org/energyresources/article/144/10/102108/1137857/Digital-Twin-to-Detect-Nuclear-Proliferation-A},
urldate = {2023-10-11},
abstract = {Abstract This case study describes the development of technologies that enable digital-engineering and digital-twinning efforts in proliferation detection. The project presents a state-of-the-art approach to support International Atomic Energy Agency (IAEA) safeguards by incorporating diversion-pathway analysis, facility misuse, and the detection of indicators within the reactor core, applying the safeguards-by-design concept, and demonstrates its applicability as a sensitive monitoring system for advanced reactors and power plants. There are two pathways a proliferating state might take using the reactor core. One is “diversion,” where special fissionable nuclear material—i.e., Pu-239, U-233, U enriched in U-233/235—that has been declared to the IAEA is removed surreptitiously, either by taking small amounts of nuclear material over a long time (known as protracted diversion) or large amounts in a short time (known as abrupt diversion). The second pathway is “misuse,” where undeclared source material—material that can be transmuted into special fissionable nuclear material: depleted uranium, natural uranium, and thorium—is placed in the core, where it uses the neutron flux for transmutation. Digital twinning and digital engineering have demonstrated significant performance improvement and schedule reduction in the aerospace, automotive, and construction industries. This integrated modeling approach has not been fully applied to nuclear safeguards programs in the past. Digital twinning, combined with machine learning technologies, can lead to new innovations in process-monitoring detection, specifically in event classification, real-time notification, and data tampering. It represents a technological leap in evaluation and detection capability to safeguard any nuclear facility.},
langid = {english},
file = {/home/danesabo/Zotero/storage/37TG3D3G/Ritter et al. - 2022 - Digital Twin to Detect Nuclear Proliferation A Ca.pdf}
}
@incollection{rocchettoCPDYExtendingDolevYao2016,
title = {{{CPDY}}: {{Extending}} the {{Dolev-Yao Attacker}} with {{Physical-Layer Interactions}}},
shorttitle = {{{CPDY}}},
booktitle = {Formal {{Methods}} and {{Software Engineering}}},
author = {Rocchetto, Marco and Tippenhauer, Nils Ole},
editor = {Ogata, Kazuhiro and Lawford, Mark and Liu, Shaoying},
date = {2016},
volume = {10009},
pages = {175--192},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-47846-3_12},
url = {http://link.springer.com/10.1007/978-3-319-47846-3_12},
urldate = {2023-10-10},
abstract = {We propose extensions to the Dolev-Yao attacker model to make it suitable for arguments about security of Cyber-Physical Systems. The Dolev-Yao attacker model uses a set of rules to define potential actions by an attacker with respect to messages (i.e. information) exchanged between parties during a protocol execution. As the traditional Dolev-Yao model considers only information (exchanged over a channel controlled by the attacker), the model cannot directly be used to argue about the security of cyber-physical systems where physicallayer interactions are possible. Our Dolev-Yao extension, called CyberPhysical Dolev-Yao (CPDY), allows additional orthogonal interaction channels between the parties. In particular, such orthogonal channels can be used to model physical-layer mechanical, chemical, or electrical interactions between components. In addition, we discuss the inclusion of physical properties such as location or distance in the rule set. We present an example set of additional rules for the Dolev-Yao attacker, using those we are able to formally discover physical attacks that previously could only be found by empirical methods or detailed physical process models.},
isbn = {978-3-319-47845-6 978-3-319-47846-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/REEHE6HE/Rocchetto and Tippenhauer - 2016 - CPDY Extending the Dolev-Yao Attacker with Physic.pdf}
}
@inproceedings{rocchettoFormalSecurityAnalysis2017,
title = {Towards {{Formal Security Analysis}} of {{Industrial Control Systems}}},
booktitle = {Proceedings of the 2017 {{ACM}} on {{Asia Conference}} on {{Computer}} and {{Communications Security}}},
author = {Rocchetto, Marco and Tippenhauer, Nils Ole},
date = {2017-04-02},
pages = {114--126},
publisher = {ACM},
location = {Abu Dhabi United Arab Emirates},
doi = {10.1145/3052973.3053024},
url = {https://dl.acm.org/doi/10.1145/3052973.3053024},
urldate = {2023-10-10},
abstract = {We discuss the use of formal modeling to discover potential attacks on Cyber-Physical systems, in particular Industrial Control Systems. We propose a general approach to achieve that goal considering physical-layer interactions, time and state discretization of the physical process and logic, and the use of suitable attacker profiles. We then apply the approach to model a real-world water treatment testbed using ASLan++ and analyze the resulting transition system using CL-AtSe, identifying four attack classes.},
eventtitle = {{{ASIA CCS}} '17: {{ACM Asia Conference}} on {{Computer}} and {{Communications Security}}},
isbn = {978-1-4503-4944-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/SGTDVRIL/Rocchetto and Tippenhauer - 2017 - Towards Formal Security Analysis of Industrial Con.pdf}
}
@article{rojasTutorialIntroductionLambda,
title = {A {{Tutorial Introduction}} to the {{Lambda Calculus}}},
author = {Rojas, Raul},
abstract = {This paper is a short and painless introduction to the λ calculus. Originally developed in order to study some mathematical properties of effectively computable functions, this formalism has provided a strong theoretical foundation for the family of functional programming languages. We show how to perform some arithmetical computations using the λ calculus and how to define recursive functions, even though functions in λ calculus are not given names and thus cannot refer explicitly to themselves.},
langid = {english},
file = {/home/danesabo/Zotero/storage/WPF5L78G/Rojas - A Tutorial Introduction to the Lambda Calculus.pdf}
}
@thesis{rouhlingFormalisationToolsClassical2019,
type = {phdthesis},
title = {Formalisation Tools for Classical Analysis : A Case Study in Control Theory},
shorttitle = {Formalisation Tools for Classical Analysis},
author = {Rouhling, Damien},
date = {2019-09-30},
institution = {Université Côte d'Azur},
url = {https://theses.hal.science/tel-02333396},
urldate = {2024-01-22},
abstract = {In this thesis, we put a library for analysis in the Coq proof assistant to the test through a case study in control theory. We formalise a proof of stability for the inverted pendulum, a standard example in control theory. Controlling the inverted pendulum is challenging because of its non-linearity, so that this system is often used as a benchmark for new control techniques. Through this case study, we identify issues in the tools that are currently available for the formalisation of classical analysis and we develop new ones in order to achieve our formalisation goal. In particular, we try to imitate the pen-and-paper proof style thanks to new notations and inference mechanisms. This is an essential step to make formal proofs more accessible to mathematicians. We then develop a new library for classical analysis in Coq that integrates these new tools and tries to palliate the limitations of the library we tested, especially in the domain of asymptotic reasoning. We also experiment with this new library on the same formal proof and draw lessons on its strengths and weaknesses. Finally, we sketch a new methodology in order to address the limitations of our library in the particular domain of computation. We exploit a technique called refinement to refactor the methodology of proof by reflection, a technique that automates proofs through computation and also reduces the size of proof terms. We implement this methodology on the example of arithmetic reasoning in rings and discuss how this work could be used to generalise existing tools.},
langid = {english},
file = {/home/danesabo/Zotero/storage/T9AMRA7H/Rouhling - 2019 - Formalisation tools for classical analysis a cas.pdf}
}
@article{rouhlingFormalProofsControl,
title = {Formal {{Proofs}} for {{Control Theory}} and {{Robotics}}: {{A Case Study}}},
author = {Rouhling, Damien},
langid = {english},
file = {/home/danesabo/Zotero/storage/YFPFJRX7/Rouhling - Formal Proofs for Control Theory and Robotics A C.pdf}
}
@article{routhDynamicsSystemRigid1955,
title = {Dynamics of a System of Rigid Bodies. {{Part II}}: {{Of}} Atreatise on the Whole Subject},
author = {Routh, Edward John},
date = {1955},
journaltitle = {Dover Publications Inc., New York, USA}
}
@inproceedings{ruchkinChallengesPhysicalModeling2016,
title = {Challenges in Physical Modeling for Adaptation of Cyber-Physical Systems},
booktitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
author = {Ruchkin, Ivan and Samuel, Selva and Schmerl, Bradley and Rico, Amanda and Garlan, David},
date = {2016-12},
pages = {210--215},
doi = {10.1109/WF-IoT.2016.7845513},
url = {https://ieeexplore.ieee.org/abstract/document/7845513?casa_token=4qDnAMcJ_VkAAAAA:BmwKCMMxC-lGcaRMmVDxkqk6df0Gd5P39iNud94-qMYWM77p-myERky0ofSw2dLXcY6k0V-6AA},
urldate = {2023-11-06},
abstract = {Cyber-physical systems (CPSs) mix software, hardware, and physical aspects with equal importance. Typically, the use of models of such systems during run time has concentrated only on managing and controlling the cyber (software) aspects. However, to fully realize the goals of a CPS, physical models too have to be treated as first-class models. This approach gives rise to three main challenges: (a) identifying and integrating physical and software models with different characteristics and semantics; (b) obtaining instances of physical models at a suitable level of abstraction for adaptation; and (c) using and adapting physical models to control CPSs. In this position paper, we elaborate on these three challenges and describe our vision of making physical models first-class entities in adaptation. We illustrate this vision in the context of power adaptation for a service robotic system.},
eventtitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
file = {/home/danesabo/Zotero/storage/PW3EVUTY/Ruchkin et al. - 2016 - Challenges in physical modeling for adaptation of .pdf;/home/danesabo/Zotero/storage/C9H5E7FQ/7845513.html}
}
@inproceedings{ruchkinChallengesPhysicalModeling2016a,
title = {Challenges in Physical Modeling for Adaptation of Cyber-Physical Systems},
booktitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
author = {Ruchkin, Ivan and Samuel, Selva and Schmerl, Bradley and Rico, Amanda and Garlan, David},
date = {2016-12},
pages = {210--215},
publisher = {IEEE},
location = {Reston, VA, USA},
doi = {10.1109/WF-IoT.2016.7845513},
url = {http://ieeexplore.ieee.org/document/7845513/},
urldate = {2023-11-08},
abstract = {Cyber-physical systems (CPSs) mix software, hardware, and physical aspects with equal importance. Typically, the use of models of such systems during run time has concentrated only on managing and controlling the cyber (software) aspects. However, to fully realize the goals of a CPS, physical models too have to be treated as first-class models. This approach gives rise to three main challenges: (a) identifying and integrating physical and software models with different characteristics and semantics; (b) obtaining instances of physical models at a suitable level of abstraction for adaptation; and (c) using and adapting physical models to control CPSs. In this position paper, we elaborate on these three challenges and describe our vision of making physical models first-class entities in adaptation. We illustrate this vision in the context of power adaptation for a service robotic system.},
eventtitle = {2016 {{IEEE}} 3rd {{World Forum}} on {{Internet}} of {{Things}} ({{WF-IoT}})},
isbn = {978-1-5090-4130-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/D7H37QIX/Ruchkin et al. - 2016 - Challenges in physical modeling for adaptation of .pdf}
}
@inproceedings{ruchkinContractbasedIntegrationCyberphysical2014,
title = {Contract-Based Integration of Cyber-Physical Analyses},
booktitle = {2014 {{International Conference}} on {{Embedded Software}} ({{EMSOFT}})},
author = {Ruchkin, Ivan and De Niz, Dionisio and Chaki, Sagar and Garlan, David},
date = {2014-10},
pages = {1--10},
doi = {10.1145/2656045.2656052},
url = {https://ieeexplore.ieee.org/document/6986131},
urldate = {2023-11-08},
abstract = {Developing cyber-physical systems involves multiple engineering domains, e.g., timing, logical correctness, thermal resilience, and mechanical stress. In today's industrial practice, these domains rely on multiple analyses to obtain and verify critical system properties. Domain differences make the analyses abstract away interactions among themselves, potentially invalidating the results. Specifically, one challenge is to ensure that an analysis is never applied to a model that violates the assumptions of the analysis. Since such violation can originate from the updating of the model by another analysis, analyses must be executed in the correct order. Another challenge is to apply diverse analyses soundly and scalably over models of realistic complexity. To address these challenges, we develop an analysis integration approach that uses contracts to specify dependencies between analyses, determine their correct orders of application, and specify and verify applicability conditions in multiple domains. We implement our approach and demonstrate its effectiveness, scalability, and extensibility through a verification case study for thread and battery cell scheduling.},
eventtitle = {2014 {{International Conference}} on {{Embedded Software}} ({{EMSOFT}})},
file = {/home/danesabo/Zotero/storage/JUEJI5RZ/Ruchkin et al. - 2014 - Contract-based integration of cyber-physical analy.pdf}
}
@inproceedings{ruchkinContractbasedIntegrationCyberphysical2014a,
title = {Contract-Based Integration of Cyber-Physical Analyses},
booktitle = {Proceedings of the 14th {{International Conference}} on {{Embedded Software}}},
author = {Ruchkin, Ivan and De Niz, Dionisio and Garlan, David and Chaki, Sagar},
date = {2014-10-12},
pages = {1--10},
publisher = {ACM},
location = {New Delhi India},
doi = {10.1145/2656045.2656052},
url = {https://dl.acm.org/doi/10.1145/2656045.2656052},
urldate = {2023-11-08},
abstract = {Developing cyber-physical systems involves multiple engineering domains, e.g., timing, logical correctness, thermal resilience, and mechanical stress. In today’s industrial practice, these domains rely on multiple analyses to obtain and verify critical system properties. Domain differences make the analyses abstract away interactions among themselves, potentially invalidating the results. Specifically, one challenge is to ensure that an analysis is never applied to a model that violates the assumptions of the analysis. Since such violation can originate from the updating of the model by another analysis, analyses must be executed in the correct order. Another challenge is to apply diverse analyses soundly and scalably over models of realistic complexity. To address these challenges, we develop an analysis integration approach that uses contracts to specify dependencies between analyses, determine their correct orders of application, and specify and verify applicability conditions in multiple domains. We implement our approach and demonstrate its effectiveness, scalability, and extensibility through a verification case study for thread and battery cell scheduling.},
eventtitle = {{{ESWEEK}}'14: {{TENTH EMBEDDED SYSTEM WEEK}}},
isbn = {978-1-4503-3052-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/XVQPTS4L/Ruchkin et al. - 2014 - Contract-based integration of cyber-physical analy.pdf}
}
@inproceedings{ruchkinEliminatingInterDomainVulnerabilities2015,
title = {Eliminating {{Inter-Domain Vulnerabilities}} in {{Cyber-Physical Systems}}: {{An Analysis Contracts Approach}}},
shorttitle = {Eliminating {{Inter-Domain Vulnerabilities}} in {{Cyber-Physical Systems}}},
booktitle = {Proceedings of the {{First ACM Workshop}} on {{Cyber-Physical Systems-Security}} and/or {{PrivaCy}}},
author = {Ruchkin, Ivan and Rao, Ashwini and De Niz, Dionisio and Chaki, Sagar and Garlan, David},
date = {2015-10-16},
pages = {11--22},
publisher = {ACM},
location = {Denver Colorado USA},
doi = {10.1145/2808705.2808714},
url = {https://dl.acm.org/doi/10.1145/2808705.2808714},
urldate = {2023-11-08},
abstract = {Designing secure cyber-physical systems (CPS) is a particularly difficult task since security vulnerabilities stem not only from traditional cybersecurity concerns, but also physical ones. Many of the standard methods for CPS design make strong and unverified assumptions about the trustworthiness of physical devices, such as sensors. When these assumptions are violated, subtle inter-domain vulnerabilities are introduced into the system model. In this paper we use formal specification of analysis contracts to expose security assumptions and guarantees of analyses from reliability, control, and sensor security domains. We show that this specification allows us to determine where these assumptions are violated, opening the door to malicious attacks. We demonstrate how this approach can help discover and prevent vulnerabilities using a self-driving car example.},
eventtitle = {{{CCS}}'15: {{The}} 22nd {{ACM Conference}} on {{Computer}} and {{Communications Security}}},
isbn = {978-1-4503-3827-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/IMNISSCZ/Ruchkin et al. - 2015 - Eliminating Inter-Domain Vulnerabilities in Cyber-.pdf}
}
@article{ruchkinIntegrationModelingMethods,
title = {Integration of {{Modeling Methods}} for {{Cyber-Physical Systems}}},
author = {Ruchkin, Ivan},
langid = {english},
file = {/home/danesabo/Zotero/storage/P3M755MW/Ruchkin - Integration of Modeling Methods for Cyber-Physical.pdf}
}
@incollection{ruchkinIPLIntegrationProperty2018,
title = {{{IPL}}: {{An Integration Property Language}} for {{Multi-model Cyber-physical Systems}}},
shorttitle = {{{IPL}}},
booktitle = {Formal {{Methods}}},
author = {Ruchkin, Ivan and Sunshine, Joshua and Iraci, Grant and Schmerl, Bradley and Garlan, David},
editor = {Havelund, Klaus and Peleska, Jan and Roscoe, Bill and De Vink, Erik},
date = {2018},
volume = {10951},
pages = {165--184},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-95582-7_10},
url = {http://link.springer.com/10.1007/978-3-319-95582-7_10},
urldate = {2023-11-08},
abstract = {Design and verification of modern systems requires diverse models, which often come from a variety of disciplines, and it is challenging to manage their heterogeneity – especially in the case of cyber-physical systems. To check consistency between models, recent approaches map these models to flexible static abstractions, such as architectural views. This model integration approach, however, comes at a cost of reduced expressiveness because complex behaviors of the models are abstracted away. As a result, it may be impossible to automatically verify important behavioral properties across multiple models, leaving systems vulnerable to subtle bugs. This paper introduces the Integration Property Language (IPL) that improves integration expressiveness using modular verification of properties that depend on detailed behavioral semantics while retaining the ability for static system-wide reasoning. We prove that the verification algorithm is sound and analyze its termination conditions. Furthermore, we perform a case study on a mobile robot to demonstrate IPL is practically useful and evaluate its performance.},
isbn = {978-3-319-95581-0 978-3-319-95582-7},
langid = {english},
file = {/home/danesabo/Zotero/storage/NR28IQPG/Ruchkin et al. - 2018 - IPL An Integration Property Language for Multi-mo.pdf}
}
@article{rufferConvergentSystemsVs2013,
title = {Convergent Systems vs. Incremental Stability},
author = {Rüffer, Björn S. and Van De Wouw, Nathan and Mueller, Markus},
date = {2013-03},
journaltitle = {Systems \& Control Letters},
shortjournal = {Systems \& Control Letters},
volume = {62},
number = {3},
pages = {277--285},
issn = {01676911},
doi = {10.1016/j.sysconle.2012.11.015},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0167691112002393},
urldate = {2023-10-13},
abstract = {Two similar stability notions are considered; one is the long established notion of convergent systems, the other is the younger notion of incremental stability. Both notions require that any two solutions of a system converge to each other. Yet these stability concepts are different, in the sense that none implies the other, as is shown in this paper using two examples. It is shown under what additional assumptions one property indeed implies the other. Furthermore, this paper contains necessary and sufficient characterizations of both properties in terms of Lyapunov functions.},
langid = {english},
file = {/home/danesabo/Zotero/storage/L3VUTJ9S/Rüffer et al. - 2013 - Convergent systems vs. incremental stability.pdf}
}
@article{rumpVerificationMethodsRigorous2010,
title = {Verification Methods: {{Rigorous}} Results Using Floating-Point Arithemetic},
author = {Rump, Siegfried},
date = {2010},
journaltitle = {Acta Numerica},
pages = {287--449},
file = {/home/danesabo/Zotero/storage/ZGVNLRMQ/ActaNumerica2010.pdf}
}
@article{rysavyImprovingSecuritySCADA2013,
title = {Improving Security in {{SCADA}} Systems through Firewall Policy Analysis},
author = {Rysavy, Ondrej and Rab, Jaroslav and Sveda, Miroslav},
date = {2013},
abstract = {Modern SCADA networks are connected to both the companys enterprise network and the Internet. Because these industrial systems often control critical processes the cybersecurity requirements become a priority for their design.},
langid = {english},
file = {/home/danesabo/Zotero/storage/AX7YFQBL/Rysavy et al. - 2013 - Improving security in SCADA systems through firewa.pdf}
}
@article{saeedloeiLogicbasedModelingVerification2011,
title = {A Logic-Based Modeling and Verification of {{CPS}}},
author = {Saeedloei, Neda and Gupta, Gopal},
date = {2011-06},
journaltitle = {ACM SIGBED Review},
shortjournal = {SIGBED Rev.},
volume = {8},
number = {2},
pages = {31--34},
issn = {1551-3688},
doi = {10.1145/2000367.2000374},
url = {https://dl.acm.org/doi/10.1145/2000367.2000374},
urldate = {2023-10-10},
abstract = {Cyber-physical systems (CPS) consist of perpetually and concurrently executing physical and computational components. The presence of physical components require the computational components to deal with continuous quantities. A formalism that can model discrete and continuous quantities together with concurrent, perpetual execution is lacking. In this paper we report on the development of a formalism based on logic programming extended with co-induction, constraints over reals, and coroutining that allows CPS to be elegantly modeled. This logic programming realization can be used for verifying interesting properties as well as generating implementations of CPS. We illustrate this formalism by applying it to elegant modeling of the reactor temperature control system. Interesting properties of the system can be verified merely by posing appropriate queries to this model. Precise parametric analysis can also be performed.},
langid = {english},
keywords = {Hybrid},
file = {/home/danesabo/Zotero/storage/FNWFL7NL/Saeedloei and Gupta - 2011 - A logic-based modeling and verification of CPS.pdf}
}
@online{SafeReinforcementLearning,
title = {Safe Reinforcement Learning Integrating Physic Laws, Control Theories, and Formal Methods},
url = {https://carnegiebosch.cmu.edu/research/2021-projects/safe-reinforcement-learning-integration.html},
urldate = {2024-02-13},
abstract = {\$pageDescription},
langid = {english},
file = {/home/danesabo/Zotero/storage/EH77EBN7/safe-reinforcement-learning-integration.html}
}
@article{saffordCommunicatingSciencePolicymakers2019,
title = {Communicating Science to Policymakers: Six Strategies for Success},
shorttitle = {Communicating Science to Policymakers},
author = {Safford, Hannah and Brown, Austin},
date = {2019-08-12},
journaltitle = {Nature},
volume = {572},
number = {7771},
pages = {681--682},
publisher = {Nature Publishing Group},
doi = {10.1038/d41586-019-02372-3},
url = {https://www.nature.com/articles/d41586-019-02372-3},
urldate = {2024-01-02},
abstract = {Scientists can improve how they inform politicians and other policymakers on how to make decisions, say Hannah Safford and Austin Brown.},
issue = {7771},
langid = {english},
annotation = {Bandiera\_abtest: a\\
Cg\_type: Career Column\\
Subject\_term: Careers, Politics, Policy},
file = {/home/danesabo/Zotero/storage/IYR5VX2U/Safford and Brown - 2019 - Communicating science to policymakers six strateg.pdf;/home/danesabo/Zotero/storage/FWIZAHW9/d41586-019-02372-3.html}
}
@article{sahaNeuralIdentificationControl2021,
title = {Neural {{Identification}} for {{Control}}},
author = {Saha, Priyabrata and Egerstedt, Magnus and Mukhopadhyay, Saibal},
date = {2021-07},
journaltitle = {IEEE Robotics and Automation Letters},
shortjournal = {IEEE Robot. Autom. Lett.},
volume = {6},
number = {3},
eprint = {2009.11782},
eprinttype = {arXiv},
eprintclass = {cs, eess},
pages = {4648--4655},
issn = {2377-3766, 2377-3774},
doi = {10.1109/LRA.2021.3068099},
url = {http://arxiv.org/abs/2009.11782},
urldate = {2024-01-30},
abstract = {We present a new method for learning control law that stabilizes an unknown nonlinear dynamical system at an equilibrium point. We formulate a system identification task in a self-supervised learning setting that jointly learns a controller and corresponding stable closed-loop dynamics hypothesis. The input-output behavior of the unknown dynamical system under random control inputs is used as the supervising signal to train the neural network-based system model and the controller. The proposed method relies on the Lyapunov stability theory to generate a stable closed-loop dynamics hypothesis and corresponding control law. We demonstrate our method on various nonlinear control problems such as n-link pendulum balancing and trajectory tracking, pendulum on cart balancing, and wheeled vehicle path following.},
keywords = {Computer Science - Machine Learning,Computer Science - Robotics,Electrical Engineering and Systems Science - Systems and Control},
file = {/home/danesabo/Zotero/storage/DYHN77BB/Saha et al. - 2021 - Neural Identification for Control.pdf;/home/danesabo/Zotero/storage/ERWUWG8S/2009.html}
}
@article{sangiovanni-vincentelliTamingDrFrankenstein2012,
title = {Taming {{Dr}}. {{Frankenstein}}: {{Contract-Based Design}} for {{Cyber-Physical Systems}}*},
shorttitle = {Taming {{Dr}}. {{Frankenstein}}},
author = {Sangiovanni-Vincentelli, Alberto and Damm, Werner and Passerone, Roberto},
date = {2012-01},
journaltitle = {European Journal of Control},
shortjournal = {European Journal of Control},
volume = {18},
number = {3},
pages = {217--238},
issn = {09473580},
doi = {10.3166/ejc.18.217-238},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0947358012709433},
urldate = {2023-11-08},
abstract = {Cyber-physical systems combine a cyber side (computing and networking) with a physical side (mechanical, electrical, and chemical processes). In many cases, the cyber component controls the physical side using sensors and actuators that observe the physical system and actuate the controls. Such systems present the biggest challenges as well as the biggest opportunities in several large industries, including electronics, energy, automotive, defense and aerospace, telecommunications, instrumentation, industrial automation.},
langid = {english},
file = {/home/danesabo/Zotero/storage/2RHC55DF/Sangiovanni-Vincentelli et al. - 2012 - Taming Dr. Frankenstein Contract-Based Design for.pdf}
}
@article{sangiovanni-vincentelliTamingDrFrankenstein2012a,
title = {Taming {{Dr}}. {{Frankenstein}}: {{Contract-Based Design}} for {{Cyber-Physical Systems}}*},
shorttitle = {Taming {{Dr}}. {{Frankenstein}}},
author = {Sangiovanni-Vincentelli, Alberto and Damm, Werner and Passerone, Roberto},
date = {2012-01},
journaltitle = {European Journal of Control},
shortjournal = {European Journal of Control},
volume = {18},
number = {3},
pages = {217--238},
issn = {09473580},
doi = {10.3166/ejc.18.217-238},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0947358012709433},
urldate = {2023-10-10},
abstract = {Cyber-physical systems combine a cyber side (computing and networking) with a physical side (mechanical, electrical, and chemical processes). In many cases, the cyber component controls the physical side using sensors and actuators that observe the physical system and actuate the controls. Such systems present the biggest challenges as well as the biggest opportunities in several large industries, including electronics, energy, automotive, defense and aerospace, telecommunications, instrumentation, industrial automation.},
langid = {english},
file = {/home/danesabo/Zotero/storage/CLZJWNEW/Sangiovanni-Vincentelli et al. - 2012 - Taming Dr. Frankenstein Contract-Based Design for.pdf}
}
@report{schweikerOperadicAnalysisDistributed2015,
title = {Operadic {{Analysis}} of {{Distributed Systems}}},
author = {Schweiker, Kevin and Varadarajan, Srivatsan and Spivak, David and Schultz, Patrick and Wisnesky, Ryan and Perez, Marco},
date = {2015},
number = {NASA/CR-2015-xxxxx},
institution = {NASA},
langid = {english},
file = {/home/danesabo/Zotero/storage/7BPMLJ2F/Schweiker et al. - 2015 - Operadic Analysis of Distributed Systems.pdf}
}
@article{selvarajuGradCAMVisualExplanations2020,
title = {Grad-{{CAM}}: {{Visual Explanations}} from {{Deep Networks}} via {{Gradient-based Localization}}},
shorttitle = {Grad-{{CAM}}},
author = {Selvaraju, Ramprasaath R. and Cogswell, Michael and Das, Abhishek and Vedantam, Ramakrishna and Parikh, Devi and Batra, Dhruv},
date = {2020-02},
journaltitle = {International Journal of Computer Vision},
shortjournal = {Int J Comput Vis},
volume = {128},
number = {2},
eprint = {1610.02391},
eprinttype = {arXiv},
eprintclass = {cs},
pages = {336--359},
issn = {0920-5691, 1573-1405},
doi = {10.1007/s11263-019-01228-7},
url = {http://arxiv.org/abs/1610.02391},
urldate = {2023-10-11},
abstract = {We propose a technique for producing ‘visual explanations’ for decisions from a large class of Convolutional Neural Network (CNN)-based models, making them more transparent and explainable.},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZCYUH685/Selvaraju et al. - 2020 - Grad-CAM Visual Explanations from Deep Networks v.pdf)}
}
@online{sguegliaFederalOfficialsInvestigating2023,
title = {Federal Officials Investigating after Pro-{{Iran}} Group Allegedly Hacked Water Authority in {{Pennsylvania}}},
author = {Sgueglia, By Kristina, Sean Lyngaas},
date = {2023-11-28T12:41:01},
url = {https://www.cnn.com/2023/11/28/us/pennsylvania-water-cyberattack/index.html},
urldate = {2024-08-13},
abstract = {A Pennsylvania water utility is still dealing with the fallout of pro-Iran hackers breaching some of its industrial equipment four days ago, including having to operate one of its water pump stations in manual mode, the utility’s general manager told CNN on Tuesday.},
langid = {english},
organization = {CNN},
file = {/home/danesabo/Zotero/storage/HZVFWDPW/index.html}
}
@online{sharfAssumeGuaranteeContracts2021,
title = {Assume/{{Guarantee Contracts}} for {{Dynamical Systems}}: {{Theory}} and {{Computational Tools}}},
shorttitle = {Assume/{{Guarantee Contracts}} for {{Dynamical Systems}}},
author = {Sharf, Miel and Besselink, Bart and Molin, Adam and Zhao, Qiming and Johansson, Karl Henrik},
date = {2021-04-19},
eprint = {2012.12657},
eprinttype = {arXiv},
eprintclass = {cs, eess},
url = {http://arxiv.org/abs/2012.12657},
urldate = {2023-11-08},
abstract = {Modern engineering systems include many components of different types and functions. Verifying that these systems satisfy given specifications can be an arduous task, as most formal verification methods are limited to systems of moderate size. Recently, contract theory has been proposed as a modular framework for defining specifications. In this paper, we present a contract theory for discrete-time dynamical control systems relying on assume/guarantee contracts, which prescribe assumptions on the input of the system and guarantees on the output. We then focus on contracts defined by linear constraints, and develop efficient computational tools for verification of satisfaction and refinement based on linear programming. We exemplify these tools in a simulation example, proving a certain safety specification for a two-vehicle autonomous driving setting.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/KYZMWWB7/Sharf et al. - 2021 - AssumeGuarantee Contracts for Dynamical Systems .pdf}
}
@article{shevitzLyapunovStabilityTheory1994,
title = {Lyapunov Stability Theory of Nonsmooth Systems},
author = {Shevitz, D. and Paden, B.},
date = {1994-09},
journaltitle = {IEEE Transactions on Automatic Control},
shortjournal = {IEEE Trans. Automat. Contr.},
volume = {39},
number = {9},
pages = {1910--1914},
issn = {00189286},
doi = {10.1109/9.317122},
url = {http://ieeexplore.ieee.org/document/317122/},
urldate = {2024-03-04},
file = {/home/danesabo/Zotero/storage/ZTQV2QVD/Shevitz and Paden - 1994 - Lyapunov stability theory of nonsmooth systems.pdf}
}
@inproceedings{shresthaModelCheckingSecurity2018,
title = {Model {{Checking}} of {{Security Properties}} in {{Industrial Control Systems}} ({{ICS}})},
booktitle = {Proceedings of the {{Eighth ACM Conference}} on {{Data}} and {{Application Security}} and {{Privacy}}},
author = {Shrestha, Roshan and Mehrpouyan, Hoda and Xu, Dianxiang},
date = {2018-03-13},
pages = {164--166},
publisher = {ACM},
location = {Tempe AZ USA},
doi = {10.1145/3176258.3176949},
url = {https://dl.acm.org/doi/10.1145/3176258.3176949},
urldate = {2023-10-10},
abstract = {With the increasing inter-connection of operation technology to the IT network, the security threat to the Industrial Control System (ICS) is increasing daily. Therefore, it is critical to utilize formal verification technique such as model checking to mathematically prove the correctness of security and safety requirements in the controller logic before it is deployed on the field. However, model checking requires considerable effort for regular ICS users and control technician to verify properties . This paper, provides a simpler approach to the model checking of temperature process control system by first starting with the control module design without formal verification. Second, identifying possible vulnerabilities in such design. Third, verifying the safety and security properties with a formal method.},
eventtitle = {{{CODASPY}} '18: {{Eighth ACM Conference}} on {{Data}} and {{Application Security}} and {{Privacy}}},
isbn = {978-1-4503-5632-9},
langid = {english},
file = {/home/danesabo/Zotero/storage/C6EIZQLE/Shrestha et al. - 2018 - Model Checking of Security Properties in Industria.pdf}
}
@article{shulmanBasicsTypeTheory,
title = {Basics of Type Theory and {{Coq}}},
author = {Shulman, Michael},
langid = {english},
file = {/home/danesabo/Zotero/storage/LICNPZ7G/Shulman - Basics of type theory and Coq.pdf}
}
@article{shumanABETProfessionalSkills2005,
title = {The {{ABET}} “{{Professional Skills}}” — {{Can They Be Taught}}? {{Can They Be Assessed}}?},
shorttitle = {The {{ABET}} “{{Professional Skills}}” — {{Can They Be Taught}}?},
author = {Shuman, Larry J. and Besterfield-Sacre, Mary and McGourty, Jack},
date = {2005},
journaltitle = {Journal of Engineering Education},
volume = {94},
number = {1},
pages = {41--55},
issn = {2168-9830},
doi = {10.1002/j.2168-9830.2005.tb00828.x},
url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/j.2168-9830.2005.tb00828.x},
urldate = {2024-01-30},
abstract = {In developing its new engineering accreditation criteria, ABET reaffirmed a set of “hard” engineering skills while introducing a second, equally important, set of six “professional” skills. These latter skills include communication, teamwork, and understanding ethics and professionalism, which we label process skills, and engineering within a global and societal context, lifelong learning, and a knowledge of contemporary issues, which we designate as awareness skills. We review these skills with an emphasis on how they can be taught, or more correctly learned, citing a number of examples of successful and/or promising implementations. We then examine the difficult issue of assessing these skills. We are very positive about a number of creative ways that these skills are being learned, particularly at institutions that are turning to global and/or service learning in combination with engineering design projects to teach and reinforce outcome combinations. We are also encouraged by work directed at assessing these skills, but recognize that there is considerable research that remains to be done.},
langid = {english},
file = {/home/danesabo/Zotero/storage/HTS6699V/Shuman et al. - 2005 - The ABET “Professional Skills” — Can They Be Taugh.pdf;/home/danesabo/Zotero/storage/5FPIUCK2/j.2168-9830.2005.tb00828.html}
}
@book{sibirskijIntroductionTopologicalDynamics1975,
title = {Introduction to Topological Dynamics},
author = {Sibirskij, Konstantin Sergeevič and Sibirsky, K. S.},
date = {1975},
publisher = {Springer},
isbn = {90-286-0174-0}
}
@article{siddavatamTestingValidationModbus2017,
title = {Testing and {{Validation}} of {{Modbus}}/{{TCP Protocol}} for {{Secure SCADA Communication}} in {{CPS}} Using {{Formal Methods}}},
author = {Siddavatam, Irfan A. and Parekh, Sachin and Shah, Tanay and Kazi, Faruk},
date = {2017-11-24},
journaltitle = {Scalable Computing: Practice and Experience},
shortjournal = {SCPE},
volume = {18},
number = {4},
pages = {313--330},
issn = {1895-1767},
doi = {10.12694/scpe.v18i4.1331},
url = {http://www.scpe.org/index.php/scpe/article/view/1331},
urldate = {2023-10-10},
abstract = {Cyber-Physical Systems (CPS’s) evident representation is Supervisory Control, and Data Acquisition(SCADA). As SCADA is being refurbished with advanced computing and communication technologies, the risk involved in adopting/updating to new technology needs to be validated and verified thoroughly. One of the greatest challenges is security testing of protocols. All CPS systems being live and attached to physical process can not be scheduled for penetration testing and verification. This paper presents design and implementation of industrial compliant SCADA test bed, the formal analysis of semantics and security of Modbus/TCP protocol using Coloured Petri Nets(CPN) tool. A novel method is proposed to differentiate attack vector by identifying influential nodes using formal concept analysis. Modbus/TCP conceptualized attack from analysis is tested and verified on the test bed.},
langid = {english},
file = {/home/danesabo/Zotero/storage/F4N2I8WK/Siddavatam et al. - 2017 - Testing and Validation of ModbusTCP Protocol for .pdf}
}
@incollection{simkoSpecificationCyberPhysicalComponents2013,
title = {Specification of {{Cyber-Physical Components}} with {{Formal Semantics}} – {{Integration}} and {{Composition}}},
booktitle = {Model-{{Driven Engineering Languages}} and {{Systems}}},
author = {Simko, Gabor and Lindecker, David and Levendovszky, Tihamer and Neema, Sandeep and Sztipanovits, Janos},
editor = {Moreira, Ana and Schätz, Bernhard and Gray, Jeff and Vallecillo, Antonio and Clarke, Peter},
editora = {Hutchison, David and Kanade, Takeo and Kittler, Josef and Kleinberg, Jon M. and Mattern, Friedemann and Mitchell, John C. and Naor, Moni and Nierstrasz, Oscar and Pandu Rangan, C. and Steffen, Bernhard and Sudan, Madhu and Terzopoulos, Demetri and Tygar, Doug and Vardi, Moshe Y. and Weikum, Gerhard},
editoratype = {redactor},
date = {2013},
volume = {8107},
pages = {471--487},
publisher = {Springer Berlin Heidelberg},
location = {Berlin, Heidelberg},
doi = {10.1007/978-3-642-41533-3_29},
url = {http://link.springer.com/10.1007/978-3-642-41533-3_29},
urldate = {2023-11-08},
abstract = {Model-Based Engineering of Cyber-Physical Systems (CPS) needs correct-by-construction design methodologies, hence CPS modeling languages require mathematically rigorous, unambiguous, and sound specifications of their semantics. The main challenge is the formalization of the heterogeneous composition and interactions of CPS systems. Creating modeling languages that support both the acausal and causal modeling approaches, and which has well-defined and sound behavior across the heterogeneous time domains is a challenging task. In this paper, we discuss the difficulties and as an example develop the formal semantics of a CPS-specific modeling language called CyPhyML. We formalize the structural semantics of CyPhyML by means of constraint rules and its behavioral semantics by defining a semantic mapping to a language for differential algebraic equations. The specification language is based on an executable subset of first-order logic, which facilitates model conformance checking, model checking and model synthesis.},
isbn = {978-3-642-41532-6 978-3-642-41533-3},
langid = {english},
file = {/home/danesabo/Zotero/storage/LQLFS8BV/Simko et al. - 2013 - Specification of Cyber-Physical Components with Fo.pdf}
}
@inproceedings{simkoTheoryCyberphysicalSystems2014,
title = {Towards a Theory for Cyber-Physical Systems Modeling},
booktitle = {Proceedings of the 4th {{ACM SIGBED International Workshop}} on {{Design}}, {{Modeling}}, and {{Evaluation}} of {{Cyber-Physical Systems}}},
author = {Simko, Gabor and Levendovszky, Tihamer and Maroti, Miklos and Sztipanovits, Janos},
date = {2014-04-14},
pages = {56--61},
publisher = {ACM},
location = {Berlin Germany},
doi = {10.1145/2593458.2593463},
url = {https://dl.acm.org/doi/10.1145/2593458.2593463},
urldate = {2023-11-08},
abstract = {Modeling the heterogeneous composition of physical, computational and communication systems is an important challenge in engineering Cyber-Physical Systems (CPS), where the major sources of heterogeneity are causality, time semantics, and different physical domains. Classical physical laws capture acausal continuous-time dynamics, thus the behavior of physical systems are inherently characterized by acausal continuous-time equations. On the other hand, computational and communication systems are based on the notion of causality and discrete-time semantics. Connecting the two worlds is challenging, and calls for proper formalization of the composition. In this paper, we discuss a formalism that captures both acausal physical laws, unidirectional analog signals, and is capable of describing causal computational systems, as well as the composition of CPS models.},
eventtitle = {{{CPS Week}} '14: {{Cyber Physical Systems Week}} 2014},
isbn = {978-1-4503-2871-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/JF45NQMG/Simko et al. - 2014 - Towards a theory for cyber-physical systems modeli.pdf}
}
@article{sivajiAdaptiveCruiseControl2013,
title = {Adaptive {{Cruise}} Control Systems for Vehicle Modeling Using Stop and Go Manoeuvres},
author = {Sivaji, V V and Sailaja, Dr M},
date = {2013},
journaltitle = {International Journal of Engineering Research and Applications},
volume = {3},
number = {4},
abstract = {This research paper deals with the design of adaptive cruise control (ACC) which was implemented on a passenger car using PID controller. An important feature of the newly based adaptive cruise control system is that, its ability to manage a competent inter-vehicle gap based on the speed of host vehicle and headway. There are three major inputs to the ACC system, that is, speed of host vehicle read from Memory unit, headway time set by driver, and actual gap measured by the Radar scanner. The system is been adapted with the velocity control at urban environments avoids mitigate possible accidents. This paper deals with the design, modulating, and estimation of the controllers performing actions on the longitudinal control of a car to accomplish stop-and-go manoeuvres.},
langid = {english},
file = {/home/danesabo/Zotero/storage/FTITBI9U/Sivaji and Sailaja - 2013 - Adaptive Cruise control systems for vehicle modeli.pdf}
}
@book{skjerveSimulatorbasedHumanFactors2011,
title = {Simulator-Based {{Human Factors Studies Across}} 25 {{Years}}: {{The History}} of the {{Halden Man-Machine Laboratory}}},
shorttitle = {Simulator-Based {{Human Factors Studies Across}} 25 {{Years}}},
editor = {Skjerve, Ann Britt and Bye, Andreas},
date = {2011},
publisher = {Springer London},
location = {London},
doi = {10.1007/978-0-85729-003-8},
url = {https://link.springer.com/10.1007/978-0-85729-003-8},
urldate = {2023-10-11},
isbn = {978-0-85729-002-1 978-0-85729-003-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/6B29IU34/Skjerve and Bye - 2011 - Simulator-based Human Factors Studies Across 25 Ye.pdf}
}
@inproceedings{slackFoolingLIMESHAP2020,
title = {Fooling {{LIME}} and {{SHAP}}: {{Adversarial Attacks}} on {{Post}} Hoc {{Explanation Methods}}},
shorttitle = {Fooling {{LIME}} and {{SHAP}}},
booktitle = {Proceedings of the {{AAAI}}/{{ACM Conference}} on {{AI}}, {{Ethics}}, and {{Society}}},
author = {Slack, Dylan and Hilgard, Sophie and Jia, Emily and Singh, Sameer and Lakkaraju, Himabindu},
date = {2020-02-07},
pages = {180--186},
publisher = {ACM},
location = {New York NY USA},
doi = {10.1145/3375627.3375830},
url = {https://dl.acm.org/doi/10.1145/3375627.3375830},
urldate = {2023-10-11},
abstract = {As machine learning black boxes are increasingly being deployed in domains such as healthcare and criminal justice, there is growing emphasis on building tools and techniques for explaining these black boxes in an interpretable manner. Such explanations are being leveraged by domain experts to diagnose systematic errors and underlying biases of black boxes. In this paper, we demonstrate that post hoc explanations techniques that rely on input perturbations, such as LIME and SHAP, are not reliable. Specifically, we propose a novel scaffolding technique that effectively hides the biases of any given classifier by allowing an adversarial entity to craft an arbitrary desired explanation. Our approach can be used to scaffold any biased classifier in such a way that its predictions on the input data distribution still remain biased, but the post hoc explanations of the scaffolded classifier look innocuous. Using extensive evaluation with multiple real world datasets (including COMPAS), we demonstrate how extremely biased (racist) classifiers crafted by our framework can easily fool popular explanation techniques such as LIME and SHAP into generating innocuous explanations which do not reflect the underlying biases.},
eventtitle = {{{AIES}} '20: {{AAAI}}/{{ACM Conference}} on {{AI}}, {{Ethics}}, and {{Society}}},
isbn = {978-1-4503-7110-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/WGGEGEC3/Slack et al. - 2020 - Fooling LIME and SHAP Adversarial Attacks on Post.pdf}
}
@article{sleitiDigitalTwinEnergy2022,
title = {Digital Twin in Energy Industry: {{Proposed}} Robust Digital Twin for Power Plant and Other Complex Capital-Intensive Large Engineering Systems},
shorttitle = {Digital Twin in Energy Industry},
author = {Sleiti, Ahmad K. and Kapat, Jayanta S. and Vesely, Ladislav},
date = {2022-11},
journaltitle = {Energy Reports},
shortjournal = {Energy Reports},
volume = {8},
pages = {3704--3726},
issn = {23524847},
doi = {10.1016/j.egyr.2022.02.305},
url = {https://linkinghub.elsevier.com/retrieve/pii/S2352484722005522},
urldate = {2023-10-11},
abstract = {The complex future power plants require digital twin (DT) architecture to achieve high reliability, availability and maintainability at lower cost. The available research on DT for power plants is limited and lacks details on DT comprehensiveness and robustness. The main focus of the present study is to propose a comprehensive and robust DT architecture for power plants that can also be used for other similar complex capital-intensive large engineering systems. First, overviews are conducted for DT key research and development for power plants and related energy savings applications to provide current status, guidelines and research gaps. Then, the requirements and rules for the power plant DT are established and the major DT components are determined. These components include the physics-based formulations; the statistical analysis of data from the sensor network; the realtime data; the pre-performed localized in-depth simulations to predict activities of the corresponding physical twin; and the system Genome with a digital thread that connects all these components together. Recommendations and future directions are made for the power plant DT development including the need for real data and physical description of the overall system focusing on each component individually and on the overall connections. Data-driven algorithms with capabilities to predict the system’s dynamic behavior still need to be developed. The data-driven approach alone is not sufficient and a low-order physics based model should operate in tandem with the updated latest system parameters to allow interpretation and enhancing the results from the data-driven process. Discrepancies between the dynamic system models (DSM) and anomaly detection and deep learning (ADL) require in-depth localized off-line simulations. Furthermore, this paper demonstrates the advantages of the developed ADL algorithm approach and DSM prediction of the DT using vector autoregressive model for anomaly detection in utility gas turbines with data from an operational power plant.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JRW2LEDB/Sleiti et al. - 2022 - Digital twin in energy industry Proposed robust d.pdf}
}
@article{slothVerificationContinuousDynamical2011,
title = {Verification of Continuous Dynamical Systems by Timed Automata},
author = {Sloth, Christoffer and Wisniewski, Rafael},
date = {2011-08},
journaltitle = {Formal Methods in System Design},
shortjournal = {Form Methods Syst Des},
volume = {39},
number = {1},
pages = {47--82},
issn = {0925-9856, 1572-8102},
doi = {10.1007/s10703-011-0118-0},
url = {http://link.springer.com/10.1007/s10703-011-0118-0},
urldate = {2023-11-22},
langid = {english},
file = {/home/danesabo/Zotero/storage/Q8GCI4MY/Sloth and Wisniewski - 2011 - Verification of continuous dynamical systems by ti.pdf}
}
@online{smilkovSmoothGradRemovingNoise2017,
title = {{{SmoothGrad}}: Removing Noise by Adding Noise},
shorttitle = {{{SmoothGrad}}},
author = {Smilkov, Daniel and Thorat, Nikhil and Kim, Been and Viégas, Fernanda and Wattenberg, Martin},
date = {2017-06-12},
eprint = {1706.03825},
eprinttype = {arXiv},
eprintclass = {cs, stat},
url = {http://arxiv.org/abs/1706.03825},
urldate = {2023-10-11},
abstract = {Explaining the output of a deep network remains a challenge. In the case of an image classifier, one type of explanation is to identify pixels that strongly influence the final decision. A starting point for this strategy is the gradient of the class score function with respect to the input image. This gradient can be interpreted as a sensitivity map, and there are several techniques that elaborate on this basic idea. This paper makes two contributions: it introduces SMOOTHGRAD, a simple method that can help visually sharpen gradient-based sensitivity maps, and it discusses lessons in the visualization of these maps. We publish the code for our experiments and a website with our results.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/32ADXEX3/Smilkov et al. - 2017 - SmoothGrad removing noise by adding noise.pdf}
}
@online{SNARKZKJargon,
title = {{{SNARK}} - {{ZK Jargon Decoder}}},
url = {https://nmohnblatt.github.io/zk-jargon-decoder/definitions/snark.html},
urldate = {2024-04-01},
file = {/home/danesabo/Zotero/storage/5IQHWKIU/snark.html}
}
@article{soderstrandHighspeedLowcostRecursive1977,
title = {A High-Speed Low-Cost Recursive Digital Filter Using Residue Number Arithmetic},
author = {Soderstrand, M.A.},
date = {1977-07},
journaltitle = {Proceedings of the IEEE},
volume = {65},
number = {7},
pages = {1065--1067},
issn = {1558-2256},
doi = {10.1109/PROC.1977.10616},
url = {https://ieeexplore.ieee.org/abstract/document/1454885?casa_token=0nHHqOecy5oAAAAA:9oASTHv6Hh9oRe4Biqf7Yv3_QzHSY2Mn8h98SpRmAq9iWceMPcKtzQWq7ausax3IXfGs0BaQKg},
urldate = {2024-02-08},
abstract = {Use of table look-up multiplication by fractional coefficients allows implementation of high-speed, low-cost recursive digital filters using residue number arithmetic. An 8-bit equivalent filter based on the lossless discrete integrator (LDI) technique described by Bruton can be easily implemented using inexpensive commercially available PROM's for the table look-up. Computer Simulations of first- and second-order LDI-RNS filters indicate substantial cost savings and speed advantages. Experiments on a first-order section verify the basic operation, speed calculations, and cost analysis. Furthermore, extensions to more bits and higher order filters are possible.},
eventtitle = {Proceedings of the {{IEEE}}},
file = {/home/danesabo/Zotero/storage/GNHJXDBQ/Soderstrand - 1977 - A high-speed low-cost recursive digital filter usi.pdf}
}
@article{soderstrandMultipliersResiduenumberarithmeticDigital1977,
title = {Multipliers for Residue-Number-Arithmetic Digital Filters},
author = {Soderstrand, M. A. and Fields, E. L.},
date = {1977-03-17},
journaltitle = {Electronics Letters},
volume = {13},
number = {6},
pages = {164--166},
publisher = {IET Digital Library},
issn = {1350-911X},
doi = {10.1049/el:19770117},
url = {https://digital-library.theiet.org/content/journals/10.1049/el_19770117},
urldate = {2024-02-08},
abstract = {A recently proposed residue-number-arithmetic digital filter offers major cost and speed advantages over binary-arithmetic digital filters, but suffers one major drawback. The filter coefficients must be constant, since the lack of a fast method of multiplication by a fraction in residue arithmetic requires the coefficients to be realised by a fixed table look-up read-only memory. Two multipliers are proposed which realise a completely general fractional multiply and are suitable for digital-filtering applications.},
langid = {english},
file = {/home/danesabo/Zotero/storage/V5GDT5SK/el_19770117.html}
}
@inproceedings{songMySmartphoneKnows2016,
title = {My {{Smartphone Knows What You Print}}: {{Exploring Smartphone-based Side-channel Attacks Against 3D Printers}}},
shorttitle = {My {{Smartphone Knows What You Print}}},
booktitle = {Proceedings of the 2016 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
author = {Song, Chen and Lin, Feng and Ba, Zhongjie and Ren, Kui and Zhou, Chi and Xu, Wenyao},
date = {2016-10-24},
pages = {895--907},
publisher = {ACM},
location = {Vienna Austria},
doi = {10.1145/2976749.2978300},
url = {https://dl.acm.org/doi/10.1145/2976749.2978300},
urldate = {2024-01-02},
abstract = {Additive manufacturing, also known as 3D printing, has been increasingly applied to fabricate highly intellectual property (IP) sensitive products. However, the related IP protection issues in 3D printers are still largely underexplored. On the other hand, smartphones are equipped with rich onboard sensors and have been applied to pervasive mobile surveillance in many applications. These facts raise one critical question: is it possible that smartphones access the sidechannel signals of 3D printer and then hack the IP information? To answer this, we perform an end-to-end study on exploring smartphone-based side-channel attacks against 3D printers. Specifically, we formulate the problem of the IP side-channel attack in 3D printing. Then, we investigate the possible acoustic and magnetic side-channel attacks using the smartphone built-in sensors. Moreover, we explore a magnetic-enhanced side-channel attack model to accurately deduce the vital directional operations of 3D printer. Experimental results show that by exploiting the side-channel signals collected by smartphones, we can successfully reconstruct the physical prints and their G-code with Mean Tendency Error of 5.87\% on regular designs and 9.67\% on complex designs, respectively. Our study demonstrates this new and practical smartphone-based side channel attack on compromising IP information during 3D printing.},
eventtitle = {{{CCS}}'16: 2016 {{ACM SIGSAC Conference}} on {{Computer}} and {{Communications Security}}},
isbn = {978-1-4503-4139-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/LTR8HF5F/Song et al. - 2016 - My Smartphone Knows What You Print Exploring Smar.pdf}
}
@incollection{sontagControlLyapunovFunctions1999,
title = {Control-{{Lyapunov}} Functions},
booktitle = {Open {{Problems}} in {{Mathematical Systems}} and {{Control Theory}}},
author = {Sontag, Eduardo D.},
editor = {Blondel, Vincent and Sontag, Eduardo D. and Vidyasagar, Mathukumalli and Willems, Jan C.},
editora = {Dickinson, B. W. and Fettweis, A. and Massey, J. L. and Modestino, J. W. and Sontag, E. D. and Thoma, M.},
editoratype = {redactor},
date = {1999},
pages = {211--216},
publisher = {Springer London},
location = {London},
doi = {10.1007/978-1-4471-0807-8_40},
url = {http://link.springer.com/10.1007/978-1-4471-0807-8_40},
urldate = {2023-11-22},
isbn = {978-1-4471-1207-5 978-1-4471-0807-8}
}
@book{sontagMathematicalControlTheory2013,
title = {Mathematical Control Theory: Deterministic Finite Dimensional Systems},
author = {Sontag, Eduardo D.},
date = {2013},
volume = {6},
publisher = {Springer Science \& Business Media},
isbn = {1-4612-0577-8}
}
@misc{sorensenLecturesCurryHowardIsomorphism,
title = {Lectures on the {{Curry-Howard Isomorphism}}},
author = {Sorensen, Morten Heine B. and Urzyczyn, Pawel},
file = {/home/danesabo/Zotero/storage/R5BD74P2/curry-howard.pdf}
}
@online{SpaceExStateSpace,
title = {{{SpaceEx}} | {{State Space Explorer}}},
url = {http://spaceex.imag.fr/},
urldate = {2023-10-12},
file = {/home/danesabo/Zotero/storage/277ZC3YA/spaceex.imag.fr.html}
}
@online{SpeedgoatRealTimeSimulation,
title = {Speedgoat - {{Real-Time Simulation}} and {{Testing}}},
url = {https://www.speedgoat.com/},
urldate = {2024-08-14}
}
@book{spivakCategoryTheorySciences2014,
title = {Category {{Theory}} for the {{Sciences}}},
author = {Spivak, David I.},
date = {2014},
publisher = {MIT Press},
location = {Cambridge, UNITED STATES},
url = {http://ebookcentral.proquest.com/lib/pitt-ebooks/detail.action?docID=3339883},
urldate = {2023-12-07},
isbn = {978-0-262-32052-8},
file = {/home/danesabo/Zotero/storage/5US8QC8N/reader.html}
}
@online{spivakOperadWiringDiagrams2013,
title = {The Operad of Wiring Diagrams: Formalizing a Graphical Language for Databases, Recursion, and Plug-and-Play Circuits},
shorttitle = {The Operad of Wiring Diagrams},
author = {Spivak, David I.},
date = {2013-05-01},
eprint = {1305.0297},
eprinttype = {arXiv},
eprintclass = {cs, math},
doi = {10.48550/arXiv.1305.0297},
url = {http://arxiv.org/abs/1305.0297},
urldate = {2023-12-07},
abstract = {Wiring diagrams, as seen in digital circuits, can be nested hierarchically and thus have an aspect of self-similarity. We show that wiring diagrams form the morphisms of an operad \$\textbackslash mcT\$, capturing this self-similarity. We discuss the algebra \$\textbackslash Rel\$ of mathematical relations on \$\textbackslash mcT\$, and in so doing use wiring diagrams as a graphical language with which to structure queries on relational databases. We give the example of circuit diagrams as a special case. We move on to show how plug-and-play devices and also recursion can be formulated in the operadic framework as well. Throughout we include many examples and figures.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/T5BKJJFT/Spivak - 2013 - The operad of wiring diagrams formalizing a graph.pdf;/home/danesabo/Zotero/storage/LWDRTFCD/1305.html}
}
@article{srivastavaDigitalTwinsServing2024,
title = {Digital {{Twins Serving Cybersecurity}}: {{More Than}} a {{Model}}: {{Cybersecurity}} as a {{Future Benefit}} of {{Digital Twins}} 2},
shorttitle = {Digital {{Twins Serving Cybersecurity}}},
author = {Srivastava, Anurag and Liu, Chen-Ching and Stefanov, Alexandru and Basumallik, Sagnik and Hussain, Mohammed M. and Somda, Baza and Rajkumar, Vetrivel S.},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
shortjournal = {IEEE Power and Energy Mag.},
volume = {22},
number = {1},
pages = {61--71},
issn = {1540-7977, 1558-4216},
doi = {10.1109/MPE.2023.3325196},
url = {https://ieeexplore.ieee.org/document/10398550/},
urldate = {2024-03-13},
langid = {english},
file = {/home/danesabo/Zotero/storage/XDQSIFHF/Srivastava et al. - 2024 - Digital Twins Serving Cybersecurity More Than a M.pdf}
}
@article{srivastavaDigitalTwinsServing2024a,
title = {Digital {{Twins Serving Cybersecurity}}: {{More Than}} a {{Model}}: {{Cybersecurity}} as a {{Future Benefit}} of {{Digital Twins}} 2},
shorttitle = {Digital {{Twins Serving Cybersecurity}}},
author = {Srivastava, Anurag and Liu, Chen-Ching and Stefanov, Alexandru and Basumallik, Sagnik and Hussain, Mohammed M. and Somda, Baza and Rajkumar, Vetrivel S.},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {61--71},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3325196},
url = {https://ieeexplore.ieee.org/document/10398550/},
urldate = {2024-03-13},
abstract = {Today’s critical infrastructure systems are more interconnected and dependent on the electric power grid. This interdependence means that disruptions in one system can have far-reaching consequences across many others. This is particularly evident when a cyberattack in the power grid leads to widespread outages and disrupts essential societal services. To prevent such disasters, it is crucial that proactive actions are taken to secure our power grid control centers and digital substations. This is where digital twins (DTs) play an important role: By creating virtual replicas of cyberphysical assets and processes, DTs allow system operators to anticipate and address potential vulnerabilities in our cybersecurity defenses before they can be exploited. As such, a DT can be considered as a key contributor to safeguard the power system against cyberattacks. This article examines the potential future benefits of DTs in enabling a cybersecure and resilient power grid, explores multiple use cases, and proposes a path forward.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/2JCWZKFM/Srivastava et al. - 2024 - Digital Twins Serving Cybersecurity More Than a M.pdf;/home/danesabo/Zotero/storage/M2E85SGM/10398550.html}
}
@online{STALIROTALIROTOOLS,
title = {S-{{TALIRO}} - {{TALIRO-TOOLS}}},
url = {https://sites.google.com/a/asu.edu/s-taliro/s-taliro},
urldate = {2023-10-13},
abstract = {TALIRO (TemporAl LogIC RObustness) tools is a suit of tools for the analysis of continuous and hybrid dynamical systems using linear time temporal logics.},
file = {/home/danesabo/Zotero/storage/PHFV7QMF/s-taliro.html}
}
@article{stiasnyPhysicsInformedNeuralNetworks2023,
title = {Physics-{{Informed Neural Networks}} for {{Time-Domain Simulations}}: {{Accuracy}}, {{Computational Cost}}, and {{Flexibility}}},
shorttitle = {Physics-{{Informed Neural Networks}} for {{Time-Domain Simulations}}},
author = {Stiasny, Jochen and Chatzivasileiadis, Spyros},
date = {2023-11},
journaltitle = {Electric Power Systems Research},
shortjournal = {Electric Power Systems Research},
volume = {224},
eprint = {2303.08994},
eprinttype = {arXiv},
eprintclass = {cs, eess},
pages = {109748},
issn = {03787796},
doi = {10.1016/j.epsr.2023.109748},
url = {http://arxiv.org/abs/2303.08994},
urldate = {2024-01-30},
abstract = {The simulation of power system dynamics poses a computationally expensive task. Considering the growing uncertainty of generation and demand patterns, thousands of scenarios need to be continuously assessed to ensure the safety of power systems. Physics-Informed Neural Networks (PINNs) have recently emerged as a promising solution for drastically accelerating computations of non-linear dynamical systems. This work investigates the applicability of these methods for power system dynamics, focusing on the dynamic response to load disturbances. Comparing the prediction of PINNs to the solution of conventional solvers, we find that PINNs can be 10 to 1000 times faster than conventional solvers. At the same time, we find them to be sufficiently accurate and numerically stable even for large time steps. To facilitate a deeper understanding, this paper also present a new regularisation of Neural Network (NN) training by introducing a gradient-based term in the loss function. The resulting NNs, which we call dtNNs, help us deliver a comprehensive analysis about the strengths and weaknesses of the NN based approaches, how incorporating knowledge of the underlying physics affects NN performance, and how this compares with conventional solvers for power system dynamics.},
keywords = {Computer Science - Machine Learning,Electrical Engineering and Systems Science - Systems and Control},
file = {/home/danesabo/Zotero/storage/B5YWLZSE/Stiasny and Chatzivasileiadis - 2023 - Physics-Informed Neural Networks for Time-Domain S.pdf;/home/danesabo/Zotero/storage/6GUKX8Z6/2303.html}
}
@online{stiasnyTransientStabilityAnalysis2023,
title = {Transient {{Stability Analysis}} with {{Physics-Informed Neural Networks}}},
author = {Stiasny, Jochen and Misyris, Georgios S. and Chatzivasileiadis, Spyros},
date = {2023-03-15},
eprint = {2106.13638},
eprinttype = {arXiv},
eprintclass = {cs, eess},
url = {http://arxiv.org/abs/2106.13638},
urldate = {2024-01-30},
abstract = {We explore the possibility to use physics-informed neural networks to drastically accelerate the solution of ordinary differential-algebraic equations that govern the power system dynamics. When it comes to transient stability assessment, the traditionally applied methods either carry a significant computational burden, require model simplifications, or use overly conservative surrogate models. Conventional neural networks can circumvent these limitations but are faced with high demand of high-quality training datasets, while they ignore the underlying governing equations. Physics-informed neural networks are different: they incorporate the power system differential algebraic equations directly into the neural network training and drastically reduce the need for training data. This paper takes a deep dive into the performance of physics-informed neural networks for power system transient stability assessment. Introducing a new neural network training procedure to facilitate a thorough comparison, we explore how physics-informed neural networks compare with conventional differential-algebraic solvers and classical neural networks in terms of computation time, requirements in data, and prediction accuracy. We illustrate the findings on the Kundur two-area system, and assess the opportunities and challenges of physics-informed neural networks to serve as a transient stability analysis tool, highlighting possible pathways to further develop this method.},
pubstate = {prepublished},
keywords = {Computer Science - Machine Learning,Electrical Engineering and Systems Science - Systems and Control},
file = {/home/danesabo/Zotero/storage/J8WQK82B/Stiasny et al. - 2023 - Transient Stability Analysis with Physics-Informed.pdf;/home/danesabo/Zotero/storage/BFZKZ9EM/2106.html}
}
@report{StrategyCyberPhysicalResilience,
title = {Strategy for {{Cyber-Physical Resilience}}: {{Fortifying}} Our {{Critical Infrastructure}} for a {{Digital World}}},
file = {/home/danesabo/Zotero/storage/J5F24YH2/PCAST_Cyber-Physical-Resilience-Report_Feb2024.pdf}
}
@article{StructureInterpretationComputer1997,
title = {Structure and Interpretation of Computer Programs, (Second Edition)},
date = {1997-02},
journaltitle = {Computers \& Mathematics with Applications},
shortjournal = {Computers \& Mathematics with Applications},
volume = {33},
number = {4},
pages = {133},
issn = {08981221},
doi = {10.1016/S0898-1221(97)90051-1},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0898122197900511},
urldate = {2024-02-01},
langid = {english},
file = {/home/danesabo/Zotero/storage/KATDRK86/1997 - Structure and interpretation of computer programs,.pdf}
}
@article{sulamanComparisonFMEASTPA2019,
title = {Comparison of the {{FMEA}} and {{STPA}} Safety Analysis Methods–a Case Study},
author = {Sulaman, Sardar Muhammad and Beer, Armin and Felderer, Michael and Höst, Martin},
date = {2019-03},
journaltitle = {Software Quality Journal},
shortjournal = {Software Qual J},
volume = {27},
number = {1},
pages = {349--387},
issn = {0963-9314, 1573-1367},
doi = {10.1007/s11219-017-9396-0},
url = {http://link.springer.com/10.1007/s11219-017-9396-0},
urldate = {2023-11-03},
langid = {english},
file = {/home/danesabo/Zotero/storage/ULVDPRDS/Sulaman et al. - 2019 - Comparison of the FMEA and STPA safety analysis me.pdf}
}
@article{sullereyDesignGuidelinesFormal,
title = {Design {{Guidelines}} for {{Formal Verification}}},
author = {Sullerey, Anamaya},
abstract = {Improvement in capacity and usability of EDA tools has helped in pushing the formal verification envelope. Capacity still remains the major limiting factor in the scope of formal verification deployment. Formal verification experts employ a variety of techniques to overcome this challenge. Design and implementation choices made by the designers greatly influences the effectiveness of these techniques as well as ease with which they can be applied. Most designers are not exposed to the formal verification process. This paper proposes design guidelines that facilitate application of formal verification on large blocks.},
langid = {english},
file = {/home/danesabo/Zotero/storage/4BY2LV8B/Sullerey - Design Guidelines for Formal Verification.pdf}
}
@inproceedings{szegedyGoingDeeperConvolutions2015,
title = {Going Deeper with Convolutions},
booktitle = {2015 {{IEEE Conference}} on {{Computer Vision}} and {{Pattern Recognition}} ({{CVPR}})},
author = {Szegedy, Christian and {Wei Liu} and {Yangqing Jia} and Sermanet, Pierre and Reed, Scott and Anguelov, Dragomir and Erhan, Dumitru and Vanhoucke, Vincent and Rabinovich, Andrew},
date = {2015-06},
pages = {1--9},
publisher = {IEEE},
location = {Boston, MA, USA},
doi = {10.1109/CVPR.2015.7298594},
url = {http://ieeexplore.ieee.org/document/7298594/},
urldate = {2023-10-11},
abstract = {We propose a deep convolutional neural network architecture codenamed Inception that achieves the new state of the art for classification and detection in the ImageNet Large-Scale Visual Recognition Challenge 2014 (ILSVRC14). The main hallmark of this architecture is the improved utilization of the computing resources inside the network. By a carefully crafted design, we increased the depth and width of the network while keeping the computational budget constant. To optimize quality, the architectural decisions were based on the Hebbian principle and the intuition of multi-scale processing. One particular incarnation used in our submission for ILSVRC14 is called GoogLeNet, a 22 layers deep network, the quality of which is assessed in the context of classification and detection.},
eventtitle = {2015 {{IEEE Conference}} on {{Computer Vision}} and {{Pattern Recognition}} ({{CVPR}})},
isbn = {978-1-4673-6964-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/NKF8H67U/Szegedy et al. - 2015 - Going deeper with convolutions.pdf}
}
@inproceedings{sztipanovitsDesignToolChain2015,
title = {Design Tool Chain for Cyber-Physical Systems: Lessons Learned},
shorttitle = {Design Tool Chain for Cyber-Physical Systems},
booktitle = {Proceedings of the 52nd {{Annual Design Automation Conference}}},
author = {Sztipanovits, Janos and Bapty, Ted and Neema, Sandeep and Koutsoukos, Xenofon and Jackson, Ethan},
date = {2015-06-07},
pages = {1--6},
publisher = {ACM},
location = {San Francisco California},
doi = {10.1145/2744769.2747922},
url = {https://dl.acm.org/doi/10.1145/2744769.2747922},
urldate = {2023-11-08},
abstract = {Design automation tools evolved to support the principle of "separation of concerns" to manage engineering complexity. Accordingly, we find tool suites that are vertically integrated with limited support (even intention) for horizontal integratability (i.e. integration across disciplinary boundaries). CPS challenges these established boundaries and with this - market conditions. The question is how to facilitate reorganization and create the foundation and technologies for composable CPS design tool chains that enables reuse of existing commercial and open source tools? In this paper we describe some of the lessons learned in the design and implementation of a design automation tool suite for complex cyber-physical systems (CPS) in the vehicle domain. The tool suite followed a model- and component-based design approach to match the significant increase in design productivity experienced in several narrowly focused homogeneous domains, such as signal processing, control and aspects of electronic design. The primary challenge in the undertaking was the tremendous heterogeneity of complex cyber-physical systems (CPS), where such as vehicles has not yet been achieved. This paper describes some of the challenges addressed and solution approaches to building a comprehensive design tool suite for complex CPS.},
eventtitle = {{{DAC}} '15: {{The}} 52nd {{Annual Design Automation Conference}} 2015},
isbn = {978-1-4503-3520-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/PZWKS6V3/Sztipanovits et al. - 2015 - Design tool chain for cyber-physical systems less.pdf}
}
@online{TALIROTOOLS,
title = {{{TALIRO-TOOLS}}},
url = {https://sites.google.com/a/asu.edu/s-taliro/},
urldate = {2023-10-13},
abstract = {TALIRO (TemporAl LogIC RObustness) tools is a suit of tools for the analysis of continuous and hybrid dynamical systems using linear time temporal logics.}
}
@article{taoRobustFuzzyControl2005,
title = {Robust Fuzzy Control for a Plant with Fuzzy Linear Model},
author = {Tao, C.W. and Taur, J.S.},
date = {2005-02},
journaltitle = {IEEE Transactions on Fuzzy Systems},
volume = {13},
number = {1},
pages = {30--41},
issn = {1941-0034},
doi = {10.1109/TFUZZ.2004.839653},
url = {https://ieeexplore.ieee.org/abstract/document/1392998},
urldate = {2024-07-10},
abstract = {A robust complexity reduced proportional-integral-derivative (PID)-like fuzzy controllers is designed for a plant with fuzzy linear model. The plant model is described with the expert's linguistic information involved. The linguistic information for the plant model is represented as fuzzy sets. In order to design a robust fuzzy controller for a plant model with fuzzy sets, an approach is developed to implement the best crisp approximation of fuzzy sets into intervals. Then, Kharitonov's Theorem is applied to construct a robust fuzzy controller for the fuzzy uncertain plant with interval model. With the linear combination of input variables as a new input variable, the complexity of the fuzzy mechanism of PID-like fuzzy controller is significantly reduced. The parameters in the robust fuzzy controller are determined to satisfy the stability conditions. The robustness of the designed fuzzy controller is discussed. Also, with the provided definition of relative robustness, the robustness of the complexity reduced fuzzy controller is compared to the classical PID controller for a second-order plant with fuzzy linear model. The simulation results are included to show the effectiveness of the designed PID-like robust fuzzy controller with the complexity reduced fuzzy mechanism.},
eventtitle = {{{IEEE Transactions}} on {{Fuzzy Systems}}},
keywords = {Aerodynamics,Fuzzy control,Fuzzy linear model,Fuzzy sets,Input variables,Mathematical model,Proportional control,Robust control,robust fuzzy controller,Robust stability,Sliding mode control,Uncertainty},
file = {/home/danesabo/Zotero/storage/3YPS56DA/Tao and Taur - 2005 - Robust fuzzy control for a plant with fuzzy linear.pdf}
}
@article{tehSensorDataQuality2020,
title = {Sensor Data Quality: A Systematic Review},
shorttitle = {Sensor Data Quality},
author = {Teh, Hui Yie and Kempa-Liehr, Andreas W. and Wang, Kevin I.-Kai},
date = {2020-12},
journaltitle = {Journal of Big Data},
shortjournal = {J Big Data},
volume = {7},
number = {1},
pages = {1--49},
publisher = {SpringerOpen},
issn = {2196-1115},
doi = {10.1186/s40537-020-0285-1},
url = {https://link.springer.com/article/10.1186/s40537-020-0285-1},
urldate = {2025-03-31},
abstract = {Sensor data quality plays a vital role in Internet of Things (IoT) applications as they are rendered useless if the data quality is bad. This systematic review aims to provide an introduction and guide for researchers who are interested in quality-related issues of physical sensor data. The process and results of the systematic review are presented which aims to answer the following research questions: what are the different types of physical sensor data errors, how to quantify or detect those errors, how to correct them and what domains are the solutions in. Out of 6970 literatures obtained from three databases (ACM Digital Library, IEEE Xplore and ScienceDirect) using the search string refined via topic modelling, 57 publications were selected and examined. Results show that the different types of sensor data errors addressed by those papers are mostly missing data and faults e.g. outliers, bias and drift. The most common solutions for error detection are based on principal component analysis (PCA) and artificial neural network (ANN) which accounts for about 40\% of all error detection papers found in the study. Similarly, for fault correction, PCA and ANN are among the most common, along with Bayesian Networks. Missing values on the other hand, are mostly imputed using Association Rule Mining. Other techniques include hybrid solutions that combine several data science methods to detect and correct the errors. Through this systematic review, it is found that the methods proposed to solve physical sensor data errors cannot be directly compared due to the non-uniform evaluation process and the high use of non-publicly available datasets. Bayesian data analysis done on the 57 selected publications also suggests that publications using publicly available datasets for method evaluation have higher citation rates.},
issue = {1},
langid = {english},
file = {/home/danesabo/Zotero/storage/YSXJIAX2/Teh et al. - 2020 - Sensor data quality a systematic review.pdf}
}
@article{terbeekFormalMethodsTools2022,
title = {Formal Methods and Tools for Industrial Critical Systems},
author = {Ter Beek, Maurice H. and Larsen, Kim G. and Ničković, Dejan and Willemse, Tim A. C.},
date = {2022-06},
journaltitle = {International Journal on Software Tools for Technology Transfer},
shortjournal = {Int J Softw Tools Technol Transfer},
volume = {24},
number = {3},
pages = {325--330},
issn = {1433-2779, 1433-2787},
doi = {10.1007/s10009-022-00660-4},
url = {https://link.springer.com/10.1007/s10009-022-00660-4},
urldate = {2023-10-10},
abstract = {Formal methods and tools have become well established and widely applied to ensure the correctness of fundamental components of industrial critical systems in domains like railways, avionics and automotive. In this Introduction to the special issue, we outline a number of recent achievements concerning the use of formal methods and tools for the specification and verification of critical systems from a variety of industrial domains. These achievements are represented by eight properly revised and extended versions of papers that were selected from the 24th and 25th International Conference on Formal Methods for Industrial Critical Systems (FMICS 2019 and FMICS 2020).},
langid = {english},
file = {/home/danesabo/Zotero/storage/CI4DN5JM/Ter Beek et al. - 2022 - Formal methods and tools for industrial critical s.pdf}
}
@article{thalerProofsArgumentsZeroKnowledge,
title = {Proofs, {{Arguments}}, and {{Zero-Knowledge}}},
author = {Thaler, Justin},
langid = {english},
file = {/home/danesabo/Zotero/storage/2W727EK4/Thaler - Proofs, Arguments, and Zero-Knowledge.pdf}
}
@inreference{TLA2023,
title = {{{TLA}}{\textsuperscript{+}}},
booktitle = {Wikipedia},
date = {2023-12-24T12:43:03Z},
url = {https://en.wikipedia.org/w/index.php?title=TLA%2B&oldid=1191589904},
urldate = {2024-01-28},
abstract = {TLA+ is a formal specification language developed by Leslie Lamport. It is used for designing, modelling, documentation, and verification of programs, especially concurrent systems and distributed systems. TLA+ is considered to be exhaustively-testable pseudocode, and its use likened to drawing blueprints for software systems; TLA is an acronym for Temporal Logic of Actions. For design and documentation, TLA+ fulfills the same purpose as informal technical specifications. However, TLA+ specifications are written in a formal language of logic and mathematics, and the precision of specifications written in this language is intended to uncover design flaws before system implementation is underway.Since TLA+ specifications are written in a formal language, they are amenable to finite model checking. The model checker finds all possible system behaviours up to some number of execution steps, and examines them for violations of desired invariance properties such as safety and liveness. TLA+ specifications use basic set theory to define safety (bad things won't happen) and temporal logic to define liveness (good things eventually happen). TLA+ is also used to write machine-checked proofs of correctness both for algorithms and mathematical theorems. The proofs are written in a declarative, hierarchical style independent of any single theorem prover backend. Both formal and informal structured mathematical proofs can be written in TLA+; the language is similar to LaTeX, and tools exist to translate TLA+ specifications to LaTeX documents.TLA+ was introduced in 1999, following several decades of research into a verification method for concurrent systems. Ever since, a toolchain has been developed, including an IDE and a distributed model checker. The pseudocode-like language PlusCal was created in 2009; it transpiles to TLA+ and is useful for specifying sequential algorithms. TLA+2 was announced in 2014, expanding language support for proof constructs. The current TLA+ reference is The TLA+ Hyperbook by Leslie Lamport.},
annotation = {Page Version ID: 1191589904}
}
@article{tomlinComputationalTechniquesVerification2003,
title = {Computational Techniques for the Verification of Hybrid Systems},
author = {Tomlin, C.J. and Mitchell, I. and Bayen, A.M. and Oishi, M.},
date = {2003-07},
journaltitle = {Proceedings of the IEEE},
shortjournal = {Proc. IEEE},
volume = {91},
number = {7},
pages = {986--1001},
issn = {0018-9219},
doi = {10.1109/JPROC.2003.814621},
url = {http://ieeexplore.ieee.org/document/1215682/},
urldate = {2023-10-23},
abstract = {Hybrid system theory lies at the intersection of the fields of engineering control theory and computer science verification. It is defined as the modeling, analysis, and control of systems which involve the interaction of both discrete state systems, represented by finite automata, and continuous state dynamics, represented by differential equations. The embedded autopilot of a modern commercial jet is a prime example of a hybrid system: the autopilot modes correspond to the application of different control laws, and the logic of mode switching is determined by the continuous state dynamics of the aircraft, as well as through interaction with the pilot. To understand the behavior of hybrid systems, to simulate, and to control these systems, theoretical advances, analyses, and numerical tools are needed. In this paper, we first present a general model for a hybrid system along with an overview of methods for verifying continuous and hybrid systems. We describe a particular verification technique for hybrid systems, based on two-person zero-sum game theory for automata and continuous dynamical systems. We then outline a numerical implementation of this technique using level set methods, and we demonstrate its use in the design and analysis of aircraft collision avoidance protocols, and in verification of autopilot logic.},
langid = {english},
file = {/home/danesabo/Zotero/storage/SLWJMVUN/Tomlin et al. - 2003 - Computational techniques for the verification of h.pdf;/home/danesabo/Zotero/storage/U27XE389/Tomlin et al. - 2003 - Computational techniques for the verification of h.pdf}
}
@article{tomlinSafetyVerificationConflict2001,
title = {Safety Verification of Conflict Resolution Manoeuvres},
author = {Tomlin, C. and Mitchell, I. and Ghosh, R.},
date = {2001-06},
journaltitle = {IEEE Transactions on Intelligent Transportation Systems},
shortjournal = {IEEE Trans. Intell. Transport. Syst.},
volume = {2},
number = {2},
pages = {110--120},
issn = {15249050},
doi = {10.1109/6979.928722},
url = {http://ieeexplore.ieee.org/document/928722/},
urldate = {2023-10-27},
abstract = {We address the problem of generating provably-safe conflict resolution maneuvers for aircraft in uncertain environments. We assume that a maneuver is composed of a sequence of flight modes, which are segments of constant heading, of constant bank angle, or of constant airspeed. Each of these flight modes has associated to it the kinematics of the aircraft, and hence the maneuver is a hybrid system. While the flight modes are defined ahead of time, their sequencing and parameter values do not necessarily have to be. We present an algorithm for generating provably safe maneuvers, which is based on a general procedure for designing controllers for hybrid systems. The result is a maneuver, proven to be safe within the limits of the models used, which is a familiar sequence of commands easily executable by the flight management systems. The maneuvers may be viewed as protocols, or “rules of the road”, and are well-defined for each conflict scenario. We present results for two example maneuvers.},
langid = {english},
file = {/home/danesabo/Zotero/storage/9KKJKVRS/Tomlin et al. - 2001 - Safety verification of conflict resolution manoeuv.pdf}
}
@online{ToolboxLevelSet,
title = {A {{Toolbox}} of {{Level Set Methods}}},
url = {https://pdfs.semanticscholar.org/f7f4/aa142f6beff42a95d6254289400a6038774e.pdf}
}
@article{torbenAutomaticSimulationbasedTesting2023,
title = {Automatic Simulation-Based Testing of Autonomous Ships Using {{Gaussian}} Processes and Temporal Logic},
author = {Torben, Tobias Rye and Glomsrud, Jon Arne and Pedersen, Tom Arne and Utne, Ingrid B and Sørensen, Asgeir J},
date = {2023-04-01},
journaltitle = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
shortjournal = {Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability},
volume = {237},
number = {2},
pages = {293--313},
publisher = {SAGE Publications},
issn = {1748-006X},
doi = {10.1177/1748006X211069277},
url = {https://doi.org/10.1177/1748006X211069277},
urldate = {2024-07-10},
abstract = {A methodology for automatic simulation-based testing of control systems for autonomous vessels is proposed. The work is motivated by the need for increased test coverage and formalism in the verification efforts. It aims to achieve this by formulating requirements in the formal logic Signal Temporal Logic (STL). This enables automatic evaluation of simulations against requirements using the STL robustness metric, resulting in a robustness score for requirements satisfaction. Furthermore, the proposed method uses a Gaussian Process (GP) model for estimating robustness scores including levels of uncertainty for untested cases. The GP model is updated by running simulations and observing the resulting robustness, and its estimates are used to automatically guide the test case selection toward cases with low robustness or high uncertainty. The main scientific contribution is the development of an automatic testing method which incrementally runs new simulations until the entire parameter space of the case is covered to the desired confidence level, or until a case which falsifies the requirement is identified. The methodology is demonstrated through a case study, where the test object is a Collision Avoidance (CA) system for a small high-speed vessel. STL requirements for safety distance, mission compliance, and COLREG compliance are developed. The proposed method shows promise, by both achieving verification in feasible time and identifying falsifying behaviors which would be difficult to detect manually or using brute-force methods. An additional contribution of this work is a formalization of COLREG using temporal logic, which appears to be an interesting direction for future work.},
langid = {english},
file = {/home/danesabo/Zotero/storage/EQEE26WM/Torben et al. - 2023 - Automatic simulation-based testing of autonomous s.pdf}
}
@inreference{TrustedComputerSystem2024,
title = {Trusted {{Computer System Evaluation Criteria}}},
booktitle = {Wikipedia},
date = {2024-02-25T21:38:00Z},
url = {https://en.wikipedia.org/w/index.php?title=Trusted_Computer_System_Evaluation_Criteria&oldid=1210281816},
urldate = {2024-02-29},
abstract = {Trusted Computer System Evaluation Criteria (TCSEC) is a United States Government Department of Defense (DoD) standard that sets basic requirements for assessing the effectiveness of computer security controls built into a computer system. The TCSEC was used to evaluate, classify, and select computer systems being considered for the processing, storage, and retrieval of sensitive or classified information.The TCSEC, frequently referred to as the Orange Book, is the centerpiece of the DoD Rainbow Series publications. Initially issued in 1983 by the National Computer Security Center (NCSC), an arm of the National Security Agency, and then updated in 1985, TCSEC was eventually replaced by the Common Criteria international standard, originally published in 2005.},
langid = {english},
annotation = {Page Version ID: 1210281816}
}
@inproceedings{tsukadaToolchainModelChecking2016,
title = {A Toolchain on Model Checking {{SPIN}} via {{Kalman Decomposition}} for Control System Software},
booktitle = {2016 {{IEEE International Conference}} on {{Automation Science}} and {{Engineering}} ({{CASE}})},
author = {Tsukada, Kento and Sawada, Kenji and Shin, Seiichi},
date = {2016-08},
pages = {300--305},
publisher = {IEEE},
location = {Fort Worth, TX, USA},
doi = {10.1109/COASE.2016.7743421},
url = {http://ieeexplore.ieee.org/document/7743421/},
urldate = {2023-10-10},
abstract = {This paper proposes a new model checking method to detect falsification on control system software. In the previous study, we have examined a method which detects illegal rewriting for control system software via Petri Net and Kalman Decomposition (KD). In this paper, in order to divert this method to model checking, we consider a new toolchain with the existing model checker SPIN. Specifically, we develop a tool that translates Petri Net into Promela (modeling language of SPIN) and clarify that KD allows us to generate Linear Temporal Logic (LTL) formulas for SPIN automatically. In addition, we give a simple example of applying SPIN to Petri Net models before and after falsification.},
eventtitle = {2016 {{IEEE International Conference}} on {{Automation Science}} and {{Engineering}} ({{CASE}})},
isbn = {978-1-5090-2409-4},
langid = {english},
file = {/home/danesabo/Zotero/storage/ZF7RMHVJ/Tsukada et al. - 2016 - A toolchain on model checking SPIN via Kalman Deco.pdf}
}
@article{tuegelReengineeringAircraftStructural2011,
title = {Reengineering {{Aircraft Structural Life Prediction Using}} a {{Digital Twin}}},
author = {Tuegel, Eric J. and Ingraffea, Anthony R. and Eason, Thomas G. and Spottswood, S. Michael},
date = {2011},
journaltitle = {International Journal of Aerospace Engineering},
shortjournal = {International Journal of Aerospace Engineering},
volume = {2011},
pages = {1--14},
issn = {1687-5966, 1687-5974},
doi = {10.1155/2011/154798},
url = {http://www.hindawi.com/journals/ijae/2011/154798/},
urldate = {2023-10-11},
abstract = {Reengineering of the aircraft structural life prediction process to fully exploit advances in very high performance digital computing is proposed. The proposed process utilizes an ultrahigh fidelity model of individual aircraft by tail number, a Digital Twin, to integrate computation of structural deflections and temperatures in response to flight conditions, with resulting local damage and material state evolution. A conceptual model of how the Digital Twin can be used for predicting the life of aircraft structure and assuring its structural integrity is presented. The technical challenges to developing and deploying a Digital Twin are discussed in detail.},
langid = {english},
file = {/home/danesabo/Zotero/storage/MB2M7PU8/Tuegel et al. - 2011 - Reengineering Aircraft Structural Life Prediction .pdf}
}
@online{TypesProgrammingLanguages,
title = {Types and {{Programming Languages}}},
url = {https://web-p-ebscohost-com.pitt.idm.oclc.org/ehost/ebookviewer/ebook?sid=9aae5940-b8e1-4213-9bc3-47cea530173c%40redis&vid=0&format=EB},
urldate = {2024-01-22},
file = {/home/danesabo/Zotero/storage/TPVAQDGL/ebook.html}
}
@online{TyphoonHILExpert,
title = {Typhoon {{HIL}} - {{Expert Hardware-in-the-Loop Solutions}}},
url = {https://www.typhoon-hil.com/},
urldate = {2024-08-14},
abstract = {Typhoon HIL is the technology leader in controller hardware in the loop (C-HIL) solutions for e-mobility, e-drives, renewables, microgrids, and other applications.},
langid = {american},
organization = {Typhoon HIL},
file = {/home/danesabo/Zotero/storage/R4C4KBVR/www.typhoon-hil.com.html}
}
@online{UnivalentFoundationsMathematics2010,
title = {Univalent {{Foundations}} of {{Mathematics}}},
date = {2010-12-16T14:05:59-0500},
url = {https://www.ias.edu/video/univalent/voevodsky},
urldate = {2024-01-27},
abstract = {The correspondence between homotopy types and higher categorical analogs of groupoids which was first conjectured by Alexander Grothendieck naturally leads to a view of mathematics where sets are used to parametrize collections of objects without "internal structure" while collections of objects with "internal structure" are parametrized by more general homotopy types. Univalent Foundations are based on the combination of this view with the discovery that it is possible to directly formalize reasoning about homotopy types using Martin-Lof type theories.}
}
@article{urbanDevelopingEmbeddedSoftware,
title = {Developing {{Embedded Software}} with {{Model-Based Design}} to {{Meet Certification Standards}}},
author = {Urban, Paul and Harper, Jeff},
langid = {english},
file = {/home/danesabo/Zotero/storage/J2F2D4RT/Urban and Harper - Developing Embedded Software with Model-Based Desi.pdf}
}
@online{urbanReviewFormalMethods2021,
title = {A {{Review}} of {{Formal Methods}} Applied to {{Machine Learning}}},
author = {Urban, Caterina and Miné, Antoine},
date = {2021-04-21},
eprint = {2104.02466},
eprinttype = {arXiv},
eprintclass = {cs},
doi = {10.48550/arXiv.2104.02466},
url = {http://arxiv.org/abs/2104.02466},
urldate = {2025-03-31},
abstract = {We review state-of-the-art formal methods applied to the emerging field of the verification of machine learning systems. Formal methods can provide rigorous correctness guarantees on hardware and software systems. Thanks to the availability of mature tools, their use is well established in the industry, and in particular to check safety-critical applications as they undergo a stringent certification process. As machine learning is becoming more popular, machine-learned components are now considered for inclusion in critical systems. This raises the question of their safety and their verification. Yet, established formal methods are limited to classic, i.e. non machine-learned software. Applying formal methods to verify systems that include machine learning has only been considered recently and poses novel challenges in soundness, precision, and scalability. We first recall established formal methods and their current use in an exemplar safety-critical field, avionic software, with a focus on abstract interpretation based techniques as they provide a high level of scalability. This provides a golden standard and sets high expectations for machine learning verification. We then provide a comprehensive and detailed review of the formal methods developed so far for machine learning, highlighting their strengths and limitations. The large majority of them verify trained neural networks and employ either SMT, optimization, or abstract interpretation techniques. We also discuss methods for support vector machines and decision tree ensembles, as well as methods targeting training and data preparation, which are critical but often neglected aspects of machine learning. Finally, we offer perspectives for future research directions towards the formal verification of machine learning systems.},
pubstate = {prepublished},
keywords = {Computer Science - Logic in Computer Science,Computer Science - Machine Learning,Computer Science - Programming Languages},
file = {/home/danesabo/Zotero/storage/LNHEUCMW/Urban and Miné - 2021 - A Review of Formal Methods applied to Machine Learning.pdf;/home/danesabo/Zotero/storage/7L6DXSBG/2104.html}
}
@incollection{usdepartmentofdefenseDepartmentDefenseTrusted1985,
title = {Department of {{Defense Trusted Computer System Evaluation Criteria}}},
booktitle = {The ‘{{Orange Book}}’ {{Series}}},
author = {{US Department of Defense}},
editor = {{US Department of Defense}},
date = {1985},
pages = {1--129},
publisher = {Palgrave Macmillan UK},
location = {London},
doi = {10.1007/978-1-349-12020-8_1},
url = {http://link.springer.com/10.1007/978-1-349-12020-8_1},
urldate = {2024-02-29},
isbn = {978-0-333-53947-7 978-1-349-12020-8},
langid = {english},
file = {/home/danesabo/Zotero/storage/IMD3HDTU/US Department of Defense - 1985 - Department of Defense Trusted Computer System Eval.pdf}
}
@online{vagnerAlgebrasOpenDynamical2015,
title = {Algebras of {{Open Dynamical Systems}} on the {{Operad}} of {{Wiring Diagrams}}},
author = {Vagner, Dmitry and Spivak, David I. and Lerman, Eugene},
date = {2015-10-02},
eprint = {1408.1598},
eprinttype = {arXiv},
eprintclass = {math},
doi = {10.48550/arXiv.1408.1598},
url = {http://arxiv.org/abs/1408.1598},
urldate = {2023-12-08},
abstract = {In this paper, we use the language of operads to study open dynamical systems. More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones. The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams. We define the symmetric monoidal category W, from which we may construct an operad O(W), whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection. We then define two W-algebras, G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs. As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/HQBVBU8A/Vagner et al. - 2015 - Algebras of Open Dynamical Systems on the Operad o.pdf;/home/danesabo/Zotero/storage/HJFNVTGE/1408.html}
}
@online{vagnerAlgebrasOpenDynamical2015a,
title = {Algebras of {{Open Dynamical Systems}} on the {{Operad}} of {{Wiring Diagrams}}},
author = {Vagner, Dmitry and Spivak, David I. and Lerman, Eugene},
date = {2015-10-02},
eprint = {1408.1598},
eprinttype = {arXiv},
eprintclass = {math},
doi = {10.48550/arXiv.1408.1598},
url = {http://arxiv.org/abs/1408.1598},
urldate = {2023-12-07},
abstract = {In this paper, we use the language of operads to study open dynamical systems. More specifically, we study the algebraic nature of assembling complex dynamical systems from an interconnection of simpler ones. The syntactic architecture of such interconnections is encoded using the visual language of wiring diagrams. We define the symmetric monoidal category W, from which we may construct an operad O(W), whose objects are black boxes with input and output ports, and whose morphisms are wiring diagrams, thus prescribing the algebraic rules for interconnection. We then define two W-algebras, G and L, which associate semantic content to the structures in W. Respectively, they correspond to general and to linear systems of differential equations, in which an internal state is controlled by inputs and produces outputs. As an example, we use these algebras to formalize the classical problem of systems of tanks interconnected by pipes, and hence make explicit the algebraic relationships among systems at different levels of granularity.},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/T2V4TXP6/Vagner et al. - 2015 - Algebras of Open Dynamical Systems on the Operad o.pdf;/home/danesabo/Zotero/storage/R4GV5EVF/1408.html}
}
@article{vanderveenSelfOrganizationCyberphysicalEnergy2024,
title = {Self-{{Organization}} in {{Cyberphysical Energy Systems}}: {{Seven Practical Steps}} to {{Agent-Based}} and {{Digital Twin-Supported Voltage Control}}},
shorttitle = {Self-{{Organization}} in {{Cyberphysical Energy Systems}}},
author = {family=Veen, given=Aliene, prefix=van der, useprefix=true and family=Leeuwen, given=Coen, prefix=van, useprefix=true and Helmholt, Kristian A.},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {43--51},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3327065},
url = {https://ieeexplore.ieee.org/document/10398556/},
urldate = {2024-03-13},
abstract = {Due to the energy transition, energy systems need to become more agile, effective, and efficient. More situational awareness and direct responses to changes in the flow of energy are required, especially for electrical energy systems, where demand and supply must be balanced continuously and the power quality must be preserved. This change can be achieved by adding extra sensors, actuators, and information and communication technology (ICT) to collect and analyze data and to make decisions. The addition of ICT results in evolution toward a cyberphysical energy system (CPES), where physical and computational components are integrated to monitor and control physical energy processes.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/BLM7F3EF/van der Veen et al. - 2024 - Self-Organization in Cyberphysical Energy Systems.pdf;/home/danesabo/Zotero/storage/3UST3BK7/10398556.html}
}
@book{veneriHandsonIndustrialInternet2018,
title = {Hands-on Industrial {{Internet}} of {{Things}}: Create a Powerful Industrial {{IoT}} Infrastructure Using Industry 4.0},
author = {Veneri, Giacomo and Capasso, Antonio},
date = {2018},
publisher = {Packt Publishing Ltd},
isbn = {1-78953-830-0},
file = {/home/danesabo/Zotero/storage/UB928X4R/HandsOn Industrial Internet of Things Create a powerful Industrial IoT infrastructure using Industry 4.pdf}
}
@article{vicentiniSafetyAssessmentCollaborative2020,
title = {Safety {{Assessment}} of {{Collaborative Robotics Through Automated Formal Verification}}},
author = {Vicentini, Federico and Askarpour, Mehrnoosh and Rossi, Matteo G. and Mandrioli, Dino},
date = {2020-02},
journaltitle = {IEEE Transactions on Robotics},
shortjournal = {IEEE Trans. Robot.},
volume = {36},
number = {1},
pages = {42--61},
issn = {1552-3098, 1941-0468},
doi = {10.1109/TRO.2019.2937471},
url = {https://ieeexplore.ieee.org/document/8844289/},
urldate = {2023-10-13},
abstract = {A crucial aspect of physical human–robot collaboration (HRC) is to maintain a safe common workspace for human operator. However, close proximity between human–robot and unpredictability of human behavior raises serious challenges in terms of safety. This article proposes a risk analysis methodology for collaborative robotic applications, which is compatible with well-known standards in the area and relies on formal verification techniques to automate the traditional risk analysis methods. In particular, the methodology relies on temporal logic-based models to describe the different possible ways in which tasks can be carried out, and on fully automated formal verification techniques to explore the corresponding state space to detect and modify the hazardous situations at early stages of system design.},
langid = {english},
file = {/home/danesabo/Zotero/storage/APQ5622C/Vicentini et al. - 2020 - Safety Assessment of Collaborative Robotics Throug.pdf}
}
@online{VideoConferencingWeb,
title = {Video {{Conferencing}}, {{Web Conferencing}}, {{Webinars}}, {{Screen Sharing}}},
url = {https://georgetown.zoom.us/rec/play/d46bqL1PaidLX23hjxCYCGO_xrFquiewA1TEhUpinGY4MW7ZjB1A_W1zZ7fdGuCMvPXmbo_-jog37dk.ELIjMzJjJmWhidCo},
urldate = {2024-04-01},
abstract = {Zoom is the leader in modern enterprise video communications, with an easy, reliable cloud platform for video and audio conferencing, chat, and webinars across mobile, desktop, and room systems. Zoom Rooms is the original software-based conference room solution used around the world in board, conference, huddle, and training rooms, as well as executive offices and classrooms. Founded in 2011, Zoom helps businesses and organizations bring their teams together in a frictionless environment to get more done. Zoom is a publicly traded company headquartered in San Jose, CA.},
langid = {american},
organization = {Zoom},
file = {/home/danesabo/Zotero/storage/DYKMLYTI/d46bqL1PaidLX23hjxCYCGO_xrFquiewA1TEhUpinGY4MW7ZjB1A_W1zZ7fdGuCMvPXmbo_-jog37dk.html}
}
@article{viteriExplosiveProofsMathematical2022,
title = {Explosive {{Proofs}} of {{Mathematical Truths}}},
author = {Viteri, Scott and DeDeo, Simon},
date = {2022-08},
journaltitle = {Cognition},
shortjournal = {Cognition},
volume = {225},
eprint = {2004.00055},
eprinttype = {arXiv},
eprintclass = {physics, q-bio},
pages = {105120},
issn = {00100277},
doi = {10.1016/j.cognition.2022.105120},
url = {http://arxiv.org/abs/2004.00055},
urldate = {2024-01-29},
abstract = {Mathematical proofs are both paradigms of certainty and some of the most explicitly-justified arguments that we have in the cultural record. Their very explicitness, however, leads to a paradox, because their probability of error grows exponentially as the argument expands. Here we show that under a cognitively-plausible belief formation mechanism that combines deductive and abductive reasoning, mathematical arguments can undergo what we call an epistemic phase transition: a dramatic and rapidly-propagating jump from uncertainty to near-complete confidence at reasonable levels of claim-to-claim error rates. To show this, we analyze an unusual dataset of forty-eight machine-aided proofs from the formalized reasoning system Coq, including major theorems ranging from ancient to 21st Century mathematics, along with four hand-constructed cases from Euclid, Apollonius, Spinoza, and Andrew Wiles. Our results bear both on recent work in the history and philosophy of mathematics, and on a question, basic to cognitive science, of how we form beliefs, and justify them to others.},
langid = {english},
file = {/home/danesabo/Zotero/storage/VVC8XMR4/Viteri and DeDeo - 2022 - Epistemic Phase Transitions in Mathematical Proofs.pdf}
}
@article{voevodskyOriginsMotivationsUnivalent,
title = {The {{Origins}} and {{Motivations}} of {{Univalent Foundations}}},
author = {Voevodsky, Vladimir},
langid = {english},
file = {/home/danesabo/Zotero/storage/43YCVSMW/Sörlin - Environmental Turn in the Human Sciences.pdf}
}
@article{volodinConceptInstrumentationDigital2019,
title = {Concept of Instrumentation of Digital Twins of Nuclear Power Plants Units as Observers for Digital {{NPP I}}\&{{C}} System},
author = {Volodin, V.S. and Tolokonskii, A.O.},
date = {2019-11-01},
journaltitle = {Journal of Physics: Conference Series},
shortjournal = {J. Phys.: Conf. Ser.},
volume = {1391},
number = {1},
pages = {012083},
issn = {1742-6588, 1742-6596},
doi = {10.1088/1742-6596/1391/1/012083},
url = {https://iopscience.iop.org/article/10.1088/1742-6596/1391/1/012083},
urldate = {2023-10-11},
abstract = {The relevance of the idea under consideration lies in the development of the use of digital twins of power units in the nuclear industry. With their help, we can not only predict the state of technological equipment, etc., but also solve the problem of parameter tuning of automatic regulators in different operating modes of NPP unit. Authors consider approaches to this problem based on optimal control theory, fuzzy logic and machine learning. Advantages and disadvantages of each approach are considered.},
langid = {english},
file = {/home/danesabo/Zotero/storage/SH7T5TZ5/Volodin and Tolokonskii - 2019 - Concept of instrumentation of digital twins of nuc.pdf}
}
@incollection{vorosIntroductionFormalMethods2004,
title = {An {{Introduction}} to {{Formal Methods}}},
booktitle = {{{UML-B Specification}} for {{Proven Embedded Systems Design}}},
author = {Voros, Nikolaos S. and Mueller, Wolfgang and Snook, Colin},
editor = {Bernin, Fredrik and Butler, Michael and Cansell, Dominique and Hallerstede, Stefan and Kronlöf, Klaus and Krupp, Alexander and Lecomte, Thierry and Lundell, Michael and Lundkvist, Ola and Marchetti, Michele and Mueller, Wolfgang and Oliver, Ian and Sabatier, Denis and Schattkowsky, Tim and Snook, Colin and Voros, Nikolaos S. and Zimmermann, Yann and Mermet, Jean},
date = {2004},
pages = {1--20},
publisher = {Springer US},
location = {Boston, MA},
doi = {10.1007/978-1-4020-2867-0_1},
url = {https://doi.org/10.1007/978-1-4020-2867-0_1},
urldate = {2024-07-09},
abstract = {This chapter begins with an introduction to the main concepts of formal methods. Languages and tools for developing formal System modeis are also described, while the use of semi formal notations and their integration with formal methods is covered as well. At the end of the chapter, an overview of the current Status of formal methods in embedded System design is presented.},
isbn = {978-1-4020-2867-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/XENN9EAI/Voros et al. - 2004 - An Introduction to Formal Methods.pdf}
}
@article{wadlerPropositionsTypes2015,
title = {Propositions as Types},
author = {Wadler, Philip},
date = {2015-11-23},
journaltitle = {Communications of the ACM},
shortjournal = {Commun. ACM},
volume = {58},
number = {12},
pages = {75--84},
issn = {0001-0782, 1557-7317},
doi = {10.1145/2699407},
url = {https://dl.acm.org/doi/10.1145/2699407},
urldate = {2024-02-22},
abstract = {Connecting mathematical logic and computation, it ensures that some aspects of programming are absolute.},
langid = {english},
file = {/home/danesabo/Zotero/storage/L56337XT/Wadler - 2015 - Propositions as types.pdf}
}
@misc{wadlerPropositionTypes,
title = {Proposition as {{Types}}},
author = {Wadler, Philip},
file = {/home/danesabo/Zotero/storage/AZ6HK6QN/propositions-as-types.pdf}
}
@article{wagnerDigitalTwinsPower2024,
title = {Digital {{Twins}} in {{Power Systems}}: {{A Proposal}} for a {{Definition}}},
shorttitle = {Digital {{Twins}} in {{Power Systems}}},
author = {Wagner, Timo and Kittl, Chris and Jakob, Joshua and Hiry, Johannes and Häger, Ulf},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {16--23},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3328581},
url = {https://ieeexplore.ieee.org/document/10398557/},
urldate = {2024-03-13},
abstract = {The term “digital twin” was already introduced by Michael Grieves in 2002 (see Grieves, 2016), and after about 20 years the concept has found its way into the energy sector on a broader base. The first applications of digital twins were for product lifecycle management within the aerospace industry at NASA. After this initial implementation of digital twinning, the digital twin technique for lifecycle management was supplemented by networkability. Since then digital twins have been widely embraced by many industrial stakeholders, allowing machines and processes to optimize their production. Today this development is considered as the fourth industrial revolution (Industry 4.0).},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/C9DMSYH8/Wagner et al. - 2024 - Digital Twins in Power Systems A Proposal for a D.pdf;/home/danesabo/Zotero/storage/V8XDSUNR/10398557.html}
}
@article{wallPolynomialsWhoseZeros1945,
title = {Polynomials {{Whose Zeros Have Negative Real Parts}}},
author = {Wall, H. S.},
date = {1945-06-01},
journaltitle = {The American Mathematical Monthly},
publisher = {Taylor \& Francis},
issn = {0002-9890},
doi = {10.2307/2305291},
url = {https://www.tandfonline.com/doi/abs/10.1080/00029890.1945.11991574},
urldate = {2024-03-04},
abstract = {(1945). Polynomials Whose Zeros Have Negative Real Parts. The American Mathematical Monthly: Vol. 52, No. 6, pp. 308-322.},
langid = {english},
file = {/home/danesabo/Zotero/storage/HJLNFYUV/00029890.1945.html}
}
@article{wangAdaptiveCriticNonlinear2017,
title = {Adaptive {{Critic Nonlinear Robust Control}}: {{A Survey}}},
shorttitle = {Adaptive {{Critic Nonlinear Robust Control}}},
author = {Wang, Ding and He, Haibo and Liu, Derong},
date = {2017-10},
journaltitle = {IEEE Transactions on Cybernetics},
shortjournal = {IEEE Trans. Cybern.},
volume = {47},
number = {10},
pages = {3429--3451},
issn = {2168-2267, 2168-2275},
doi = {10.1109/TCYB.2017.2712188},
url = {http://ieeexplore.ieee.org/document/7967695/},
urldate = {2024-05-20},
file = {/home/danesabo/Zotero/storage/FD3USCZJ/Wang et al. - 2017 - Adaptive Critic Nonlinear Robust Control A Survey.pdf}
}
@article{wangAdaptiveCriticNonlinear2017a,
title = {Adaptive {{Critic Nonlinear Robust Control}}: {{A Survey}}},
shorttitle = {Adaptive {{Critic Nonlinear Robust Control}}},
author = {Wang, Ding and He, Haibo and Liu, Derong},
date = {2017-10},
journaltitle = {IEEE Transactions on Cybernetics},
volume = {47},
number = {10},
pages = {3429--3451},
issn = {2168-2275},
doi = {10.1109/TCYB.2017.2712188},
url = {https://ieeexplore.ieee.org/abstract/document/7967695/},
urldate = {2025-04-07},
abstract = {Adaptive dynamic programming (ADP) and reinforcement learning are quite relevant to each other when performing intelligent optimization. They are both regarded as promising methods involving important components of evaluation and improvement, at the background of information technology, such as artificial intelligence, big data, and deep learning. Although great progresses have been achieved and surveyed when addressing nonlinear optimal control problems, the research on robustness of ADP-based control strategies under uncertain environment has not been fully summarized. Hence, this survey reviews the recent main results of adaptive-critic-based robust control design of continuous-time nonlinear systems. The ADP-based nonlinear optimal regulation is reviewed, followed by robust stabilization of nonlinear systems with matched uncertainties, guaranteed cost control design of unmatched plants, and decentralized stabilization of interconnected systems. Additionally, further comprehensive discussions are presented, including event-based robust control design, improvement of the critic learning rule, nonlinear H∞ control design, and several notes on future perspectives. By applying the ADP-based optimal and robust control methods to a practical power system and an overhead crane plant, two typical examples are provided to verify the effectiveness of theoretical results. Overall, this survey is beneficial to promote the development of adaptive critic control methods with robustness guarantee and the construction of higher level intelligent systems.},
keywords = {Adaptive critic designs,adaptive/approximate dynamic programming (ADP),boundedness,convergence,Dynamic programming,Learning (artificial intelligence),neural networks,Nonlinear systems,optimal control,Optimal control,reinforcement learning,robust control,Robust control,Robustness,stability,Uncertainty},
file = {/home/danesabo/Zotero/storage/CMHWUSWG/Wang et al. - 2017 - Adaptive Critic Nonlinear Robust Control A Survey.pdf}
}
@inproceedings{wangDiffuseBotBreedingSoft2023,
title = {{{DiffuseBot}}: {{Breeding Soft Robots With Physics-Augmented Generative Diffusion Models}}},
booktitle = {Advances in {{Neural Information Processing Systems}}},
author = {Wang, Tsun-Hsuan Johnson and Zheng, Juntian and Ma, Pingchuan and Du, Yilun and Kim, Byungchul and Spielberg, Andrew and Tenenbaum, Josh and Gan, Chuang and Rus, Daniela},
editor = {Oh, A. and Naumann, T. and Globerson, A. and Saenko, K. and Hardt, M. and Levine, S.},
date = {2023},
volume = {36},
pages = {44398--44423},
publisher = {Curran Associates, Inc.},
url = {https://proceedings.neurips.cc/paper_files/paper/2023/file/8b1008098947ad59144c18a78337f937-Paper-Conference.pdf}
}
@inproceedings{wangFormalAnalysisSecurity2017,
title = {Formal {{Analysis}} of {{Security Properties}} of {{Cyber-Physical System Based}} on {{Timed Automata}}},
booktitle = {2017 {{IEEE Second International Conference}} on {{Data Science}} in {{Cyberspace}} ({{DSC}})},
author = {Wang, Ting and Su, Qi and Chen, Tieming},
date = {2017-06},
pages = {534--540},
publisher = {IEEE},
location = {Shenzhen, China},
doi = {10.1109/DSC.2017.44},
url = {http://ieeexplore.ieee.org/document/8005528/},
urldate = {2023-10-10},
abstract = {For the research and development of CyberPhysical System (CPS), the security problems have gradually emerged. This paper explores the design of security for CPS. We focus on a kind of common attacks that destroys the critical system parameters to paralyze the system. Timed Automata are used for formalizing the behaviors of CPS, since the requirements on time are necessary for CPS. The modeling of CPS includes three aspects: the interactions between the various components of the CPS, the attacker, and the recovery mechanism. A modeling framework is given to illustrate our method. We also take the network water level control system as an example to illustrate our modeling processes. By using the model checking tool PAT, the security properties are verified and the results are analyzed.},
eventtitle = {2017 {{IEEE Second International Conference}} on {{Data Science}} in {{Cyberspace}} ({{DSC}})},
isbn = {978-1-5386-1600-0},
langid = {english},
file = {/home/danesabo/Zotero/storage/4FL6TSHL/Wang et al. - 2017 - Formal Analysis of Security Properties of Cyber-Ph.pdf}
}
@article{wangFormalModelBasedDesign2019,
title = {A {{Formal Model-Based Design Method}} for {{Robotic Systems}}},
author = {Wang, Rui and Guan, Yong and Song, Houbing and Li, Xinxin and Li, Xiaojuan and Shi, Zhiping and Song, Xiaoyu},
date = {2019-03},
journaltitle = {IEEE Systems Journal},
shortjournal = {IEEE Systems Journal},
volume = {13},
number = {1},
pages = {1096--1107},
issn = {1932-8184, 1937-9234, 2373-7816},
doi = {10.1109/JSYST.2018.2867285},
url = {https://ieeexplore.ieee.org/document/8464674/},
urldate = {2023-10-10},
abstract = {The model-based approach has been widely applied to the design of software. However, most of these approaches depend on simulation and manual code implementation, which reduces the efficiency and quality of software. In this paper, we present a new model-based approach, which automatically generates the executable C++ code running on the popular Robot Operation System (ROS). Our approach consists of three phases: modeling, verification, and automatic code generation. In the modeling phase, the internal interaction behaviors of robot systems are modeled as a network of timed automata. In the verification phase, the safety requirements are formalized and verified. In the code generation phase, a code generation tool can generate executable C++ code from the verified timed automata model. It bridges the gap between the formal model and the error-prone system implementation. Compared with existing method, the code generator provides the abstractions and mapping of ROS instructions, which realize the seamless connection between the generated code and ROS. The tool also supports most of the complex structures and advanced features of timed automata such as timer, committed location, and synchronous action. For evaluation, a real-industrial robot application of grasping a cup is conducted using our modelbased design method, and the generated code can be directly deployed and successfully accomplishes the grasping task.},
langid = {english},
file = {/home/danesabo/Zotero/storage/GJ8Q4YD8/Wang et al. - 2019 - A Formal Model-Based Design Method for Robotic Sys.pdf}
}
@online{wangPINNsBasedUncertaintyQuantification2023,
title = {{{PINNs-Based Uncertainty Quantification}} for {{Transient Stability Analysis}}},
author = {Wang, Ren and Zhong, Ming and Xu, Kaidi and Sánchez-Cortés, Lola Giráldez and Guerra, Ignacio de Cominges},
date = {2023-11-21},
eprint = {2311.12947},
eprinttype = {arXiv},
eprintclass = {cs, eess},
url = {http://arxiv.org/abs/2311.12947},
urldate = {2024-01-30},
abstract = {This paper addresses the challenge of transient stability in power systems with missing parameters and uncertainty propagation in swing equations. We introduce a novel application of Physics-Informed Neural Networks (PINNs), specifically an Ensemble of PINNs (E-PINNs), to estimate critical parameters like rotor angle and inertia coefficient with enhanced accuracy and reduced computational load. E-PINNs capitalize on the underlying physical principles of swing equations to provide a robust solution. Our approach not only facilitates efficient parameter estimation but also quantifies uncertainties, delivering probabilistic insights into the system behavior. The efficacy of E-PINNs is demonstrated through the analysis of \$1\$-bus and \$2\$-bus systems, highlighting the model's ability to handle parameter variability and data scarcity. The study advances the application of machine learning in power system stability, paving the way for reliable and computationally efficient transient stability analysis.},
pubstate = {prepublished},
keywords = {Computer Science - Artificial Intelligence,Electrical Engineering and Systems Science - Systems and Control},
file = {/home/danesabo/Zotero/storage/NA3Q8IV8/Wang et al. - 2023 - PINNs-Based Uncertainty Quantification for Transie.pdf;/home/danesabo/Zotero/storage/KVHS32C8/2311.html}
}
@article{wardellMethodRevealingAddressing2016,
title = {A {{Method}} for {{Revealing}} and {{Addressing Security Vulnerabilities}} in {{Cyber-physical Systems}} by {{Modeling Malicious Agent Interactions}} with {{Formal Verification}}},
author = {Wardell, Dean C. and Mills, Robert F. and Peterson, Gilbert L. and Oxley, Mark E.},
date = {2016},
journaltitle = {Procedia Computer Science},
shortjournal = {Procedia Computer Science},
volume = {95},
pages = {24--31},
issn = {18770509},
doi = {10.1016/j.procs.2016.09.289},
url = {https://linkinghub.elsevier.com/retrieve/pii/S1877050916324619},
urldate = {2023-10-10},
abstract = {Several cyber-attacks on the cyber-physical systems (CPS) that monitor and control critical infrastructure were publically announced over the last few years. Almost without exception, the proposed security solutions focus on preventing unauthorized access to the industrial control systems (ICS) at various levels – the defense in depth approach. While useful, it does not address the problem of making the systems more capable of responding to the malicious actions of an attacker once they have gained access to the system. The first step in making an ICS more resilient to an attacker is identifying the cyber security vulnerabilities the attacker can use during system design. This paper presents a method that reveals cyber security vulnerabilities in ICS through the formal modeling of the system and malicious agents. The inclusion of the malicious agent in the analysis of an existing systems identifies security vulnerabilities that are missed in traditional functional model checking.},
langid = {english},
file = {/home/danesabo/Zotero/storage/XPXSX3AP/Wardell et al. - 2016 - A Method for Revealing and Addressing Security Vul.pdf}
}
@report{weinsteinQUANTIZATIONEFFECTSDIGITAL1969,
title = {{{QUANTIZATION EFFECTS IN DIGITAL FILTERS}}:},
shorttitle = {{{QUANTIZATION EFFECTS IN DIGITAL FILTERS}}},
author = {Weinstein, Clifford J.},
date = {1969-11-21},
institution = {Defense Technical Information Center},
location = {Fort Belvoir, VA},
doi = {10.21236/AD0706862},
url = {http://www.dtic.mil/docs/citations/AD0706862},
urldate = {2024-02-08},
abstract = {When a digital filter is implemented on a computer or with special-purpose hardware, errors and constraints due to finite word length are unavoidable. These quantization effects must be considered, both in deciding what register length is needed for a given filter implementation and in choosing between several possible implementations of the same filter design, which will be affected differently by quantization.},
langid = {english},
file = {/home/danesabo/Zotero/storage/VJ9FAH7X/Weinstein - 1969 - QUANTIZATION EFFECTS IN DIGITAL FILTERS.pdf}
}
@article{weiSystemTheoreticApproach2018,
title = {A {{System Theoretic Approach}} to {{Cybersecurity Risk Analysis}} and {{Mitigation}} for {{Autonomous Passenger Vehicles}}},
author = {Wei, Lee Chee and Madnick, Stuart E.},
date = {2018},
journaltitle = {SSRN Electronic Journal},
shortjournal = {SSRN Journal},
issn = {1556-5068},
doi = {10.2139/ssrn.3370555},
url = {https://www.ssrn.com/abstract=3370555},
urldate = {2023-11-03},
langid = {english}
}
@article{weizenbaumELIZAComputerProgram1966,
title = {{{ELIZA}}—a Computer Program for the Study of Natural Language Communication between Man and Machine},
author = {Weizenbaum, Joseph},
date = {1966-01-01},
journaltitle = {Commun. ACM},
volume = {9},
number = {1},
pages = {36--45},
issn = {0001-0782},
doi = {10.1145/365153.365168},
url = {https://doi.org/10.1145/365153.365168},
urldate = {2024-07-02},
keywords = {gen_ai},
file = {/home/danesabo/Zotero/storage/Y78493V7/Weizenbaum - 1966 - ELIZA—a computer program for the study of natural .pdf}
}
@inproceedings{wellingBayesianLearningStochastic2011,
title = {Bayesian Learning via Stochastic Gradient {{Langevin}} Dynamics},
booktitle = {Proceedings of the 28th International Conference on Machine Learning ({{ICML-11}})},
author = {Welling, Max and Teh, Yee W.},
date = {2011},
pages = {681--688}
}
@online{wengAutoencoderBetaVAE2018,
title = {From {{Autoencoder}} to {{Beta-VAE}}},
author = {Weng, Lilian},
date = {2018-08-12T00:00:00+00:00},
url = {https://lilianweng.github.io/posts/2018-08-12-vae/},
urldate = {2023-10-11},
abstract = {[Updated on 2019-07-18: add a section on VQ-VAE \& VQ-VAE-2.] [Updated on 2019-07-26: add a section on TD-VAE.] Autocoder is invented to reconstruct high-dimensional data using a neural network model with a narrow bottleneck layer in the middle (oops, this is probably not true for Variational Autoencoder, and we will investigate it in details in later sections). A nice byproduct is dimension reduction: the bottleneck layer captures a compressed latent encoding.},
langid = {english},
file = {/home/danesabo/Zotero/storage/JNA8P8DJ/2018-08-12-vae.html}
}
@inproceedings{weynsSurveyFormalMethods2012,
title = {A Survey of Formal Methods in Self-Adaptive Systems},
booktitle = {Proceedings of the {{Fifth International C}}* {{Conference}} on {{Computer Science}} and {{Software Engineering}}},
author = {Weyns, Danny and Iftikhar, M. Usman and family=Iglesia, given=Didac Gil, prefix=de la, useprefix=true and Ahmad, Tanvir},
date = {2012-06-27},
series = {{{C3S2E}} '12},
pages = {67--79},
publisher = {Association for Computing Machinery},
location = {New York, NY, USA},
doi = {10.1145/2347583.2347592},
url = {https://doi.org/10.1145/2347583.2347592},
urldate = {2025-03-31},
abstract = {One major challenge in self-adaptive systems is to assure the required quality properties. Formal methods provide the means to rigorously specify and reason about the behaviors of self-adaptive systems, both at design time and runtime. To the best of our knowledge, no systematic study has been performed on the use of formal methods in self-adaptive systems. As a result, there is no clear view on what methods have been used to verify self-adaptive systems, and what support these methods offer to software developers. As such insight is important for researchers and engineers, we performed a systematic literature review covering 12 main software engineering venues and 4 journals, resulting in 75 papers used for data collection. The study shows that the attention for self-adaptive software systems is gradually increasing, but the number of studies that employ formal methods remains low. The main focus of formalization is on modeling and reasoning. Model checking and theorem proving have gained limited attention. The main concerns of interest in formalization of self-adaptation are efficiency/performance and reliability. Important adaptation concerns, such as security and scalability, are hardly considered. To verify the concerns of interest, a set of new properties are defined, such as interference freedom, responsiveness, mismatch, and loss-tolerance. A relevant part of the studies use formal methods at runtime, but the use is limited to modeling and analysis. Formal methods can be applied to other runtime activities of self-adaptation, and there is a need for light-weight tools to support runtime verification.},
isbn = {978-1-4503-1084-0}
}
@article{wilsonBestPracticesScientific2014,
title = {Best {{Practices}} for {{Scientific Computing}}},
author = {Wilson, Greg and Aruliah, D. A. and Brown, C. Titus and Hong, Neil P. Chue and Davis, Matt and Guy, Richard T. and Haddock, Steven H. D. and Huff, Kathryn D. and Mitchell, Ian M. and Plumbley, Mark D. and Waugh, Ben and White, Ethan P. and Wilson, Paul},
date = {2014-01-07},
journaltitle = {PLOS Biology},
shortjournal = {PLOS Biology},
volume = {12},
number = {1},
pages = {e1001745},
publisher = {Public Library of Science},
issn = {1545-7885},
doi = {10.1371/journal.pbio.1001745},
url = {https://journals.plos.org/plosbiology/article?id=10.1371/journal.pbio.1001745},
urldate = {2023-10-27},
abstract = {We describe a set of best practices for scientific software development, based on research and experience, that will improve scientists' productivity and the reliability of their software.},
langid = {english},
file = {/home/danesabo/Zotero/storage/ASKUBTZP/Wilson et al. - 2014 - Best Practices for Scientific Computing.pdf}
}
@article{wooldridgeLECTURE6INTRODUCTION,
title = {{{LECTURE}} 6: {{INTRODUCTION TO FORMAL METHODS}}},
author = {Wooldridge, Mike},
journaltitle = {Software Engineering},
langid = {english}
}
@article{wuDigitalTwinsMicrogrids2024,
title = {Digital {{Twins}} for {{Microgrids}}: {{Opening}} a {{New Dimension}} in the {{Power System}}},
shorttitle = {Digital {{Twins}} for {{Microgrids}}},
author = {Wu, Ying and Guerrero, Josep M. and Wu, Yanpeng and Bazmohammadi, Najmeh and Vasquez, Juan C. and Cabrera, Andrea Justo and Lu, Ning},
date = {2024-01},
journaltitle = {IEEE Power and Energy Magazine},
volume = {22},
number = {1},
pages = {35--42},
issn = {1558-4216},
doi = {10.1109/MPE.2023.3324296},
url = {https://ieeexplore.ieee.org/document/10398548/},
urldate = {2024-03-13},
abstract = {The need for affordable, reliable, sustainable, and modern energy is now more important than ever because of the climate crisis. Climate change will push up to 130 million people into poverty over the next 10 years and continue to cause more unpredictable natural disasters, such as cyclones, flooding, earthquakes, landslides, tsunamis, and volcanic eruptions. Power outages do not occur only in remote rural areas but also in developed countries, lasting for several hours and even a couple of days, due to the extreme weather in recent years. Microgrids, as a flexible architecture capable of integrating local distributed energy resources (DERs), can satisfy wide-ranging demands via their variable solutions, from off-grid to on-grid applications.},
eventtitle = {{{IEEE Power}} and {{Energy Magazine}}},
file = {/home/danesabo/Zotero/storage/WX3U8WEL/Wu et al. - 2024 - Digital Twins for Microgrids Opening a New Dimens.pdf;/home/danesabo/Zotero/storage/MXY9KRLA/10398548.html}
}
@article{yaacoubCyberphysicalSystemsSecurity2020,
title = {Cyber-Physical Systems Security: {{Limitations}}, Issues and Future Trends},
shorttitle = {Cyber-Physical Systems Security},
author = {Yaacoub, Jean-Paul A. and Salman, Ola and Noura, Hassan N. and Kaaniche, Nesrine and Chehab, Ali and Malli, Mohamad},
date = {2020-09},
journaltitle = {Microprocessors and Microsystems},
shortjournal = {Microprocessors and Microsystems},
volume = {77},
pages = {103201},
issn = {01419331},
doi = {10.1016/j.micpro.2020.103201},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0141933120303689},
urldate = {2023-10-11},
langid = {english},
file = {/home/danesabo/Zotero/storage/78PSLB9E/Yaacoub et al. - 2020 - Cyber-physical systems security Limitations, issu.pdf}
}
@unpublished{yangDiffusionModelsComprehensive2022,
title = {Diffusion Models: {{A}} Comprehensive Survey of Methods and Applications},
author = {Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Shao, Yingxia and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan},
date = {2022},
eprint = {2209.00796},
eprinttype = {arXiv}
}
@article{yangDiffusionModelsComprehensive2024,
title = {Diffusion {{Models}}: {{A Comprehensive Survey}} of {{Methods}} and {{Applications}}},
shorttitle = {Diffusion {{Models}}},
author = {Yang, Ling and Zhang, Zhilong and Song, Yang and Hong, Shenda and Xu, Runsheng and Zhao, Yue and Zhang, Wentao and Cui, Bin and Yang, Ming-Hsuan},
date = {2024-04-30},
journaltitle = {ACM Computing Surveys},
shortjournal = {ACM Comput. Surv.},
volume = {56},
number = {4},
pages = {1--39},
issn = {0360-0300, 1557-7341},
doi = {10.1145/3626235},
url = {https://dl.acm.org/doi/10.1145/3626235},
urldate = {2024-05-20},
abstract = {Diffusion models have emerged as a powerful new family of deep generative models with record-breaking performance in many applications, including image synthesis, video generation, and molecule design. In this survey, we provide an overview of the rapidly expanding body of work on diffusion models, categorizing the research into three key areas: efficient sampling, improved likelihood estimation, and handling data with special structures. We also discuss the potential for combining diffusion models with other generative models for enhanced results. We further review the wide-ranging applications of diffusion models in fields spanning from computer vision, natural language processing, temporal data modeling, to interdisciplinary applications in other scientific disciplines. This survey aims to provide a contextualized, in-depth look at the state of diffusion models, identifying the key areas of focus and pointing to potential areas for further exploration. Github: https://github.com/YangLing0818/Diffusion-Models-Papers-Survey-Taxonomy},
langid = {english},
file = {/home/danesabo/Zotero/storage/4QVSPKRW/Yang et al. - 2024 - Diffusion Models A Comprehensive Survey of Method.pdf}
}
@article{yangMeasureRiskDecisionmaking2005,
title = {A Measure of Risk and a Decision-Making Model Based on Expected Utility and Entropy},
author = {Yang, Jiping and Qiu, Wanhua},
date = {2005-08},
journaltitle = {European Journal of Operational Research},
shortjournal = {European Journal of Operational Research},
volume = {164},
number = {3},
pages = {792--799},
issn = {03772217},
doi = {10.1016/j.ejor.2004.01.031},
url = {https://linkinghub.elsevier.com/retrieve/pii/S0377221704000773},
urldate = {2024-01-26},
abstract = {In this paper we extend the classical decision model under risk to a more general case, in which the state of nature corresponding to each risky action may have its own distribution. More specifically, we propose an expected utilityentropy (EU-E) measure of risk and a decision-making model based on expected utility and entropy. The EU-E measure of risk reflects an individual’s intuitive attitude toward risk. The decision model incorporates the expected utility decision criterion as a special case. Using this decision model, a class of decision problems, which cannot be dealt with the expected utility or mean–variance criterion reasonably, can be solved. Besides, some famous decision paradoxes can be interpreted. This decision model can either serve as a descriptive or a normative decision model involving risk.},
langid = {english},
file = {/home/danesabo/Zotero/storage/I9TCGTGB/Yang and Qiu - 2005 - A measure of risk and a decision-making model base.pdf}
}
@article{yaoModelBasedDeepTransfer2022,
title = {Model-{{Based Deep Transfer Learning Method}} to {{Fault Detection}} and {{Diagnosis}} in {{Nuclear Power Plants}}},
author = {Yao, Yuantao and Ge, Daochuan and Yu, Jie and Xie, Min},
date = {2022-03-02},
journaltitle = {Frontiers in Energy Research},
shortjournal = {Front. Energy Res.},
volume = {10},
pages = {823395},
issn = {2296-598X},
doi = {10.3389/fenrg.2022.823395},
url = {https://www.frontiersin.org/articles/10.3389/fenrg.2022.823395/full},
urldate = {2023-10-11},
abstract = {Deep learning–based nuclear intelligent fault detection and diagnosis (FDD) methods have been widely developed and have achieved very competitive results with the progress of artificial intelligence technology. However, the pretrained model for diagnosis tasks is hard in achieving good performance when the reactor operation conditions are updated. On the other hand, retraining the model for a new data set will waste computing resources. This article proposes an FDD method for cross-condition and cross-facility tasks based on the optimized transferable convolutional neural network (CNN) model. First, by using the pretrained model’s prior knowledge, the model’s diagnosis performance to be transferred for source domain data sets is improved. Second, a model-based transfer learning strategy is adopted to freeze the feature extraction layer in a part of the training model. Third, the training data in target domain data sets are used to optimize the model layer by layer to find the optimization model with the transferred layer. Finally, the proposed comprehensive simulation platform provides source and target cross-condition and cross-facility data sets to support case studies. The designed model utilizes the strong nonlinear feature extraction performance of a deep network and applies the prior knowledge of pretrained models to improve the accuracy and timeliness of training. The results show that the proposed method is superior to achieving good generalization performance at less training epoch than the retraining benchmark deep CNN model.},
langid = {english},
file = {/home/danesabo/Zotero/storage/92IWNIQD/Yao et al. - 2022 - Model-Based Deep Transfer Learning Method to Fault.pdf}
}
@incollection{yuSTLmcRobustSTL2022,
title = {{{STLmc}}: {{Robust STL Model Checking}} of {{Hybrid Systems Using SMT}}},
shorttitle = {{{STLmc}}},
booktitle = {Computer {{Aided Verification}}},
author = {Yu, Geunyeol and Lee, Jia and Bae, Kyungmin},
editor = {Shoham, Sharon and Vizel, Yakir},
date = {2022},
volume = {13371},
pages = {524--537},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-031-13185-1_26},
url = {https://link.springer.com/10.1007/978-3-031-13185-1_26},
urldate = {2023-11-02},
abstract = {We present the STLmc model checker for signal temporal logic (STL) properties of hybrid systems. The STLmc tool can perform STL model checking up to a robustness threshold for a wide range of hybrid systems. Our tool utilizes the refutation-complete SMT-based bounded model checking algorithm by reducing the robust STL model checking problem into Boolean STL model checking. If STLmc does not find a counterexample, the system is guaranteed to be correct up to the given bounds and robustness threshold. We demonstrate the effectiveness of STLmc on a number of hybrid system benchmarks.},
isbn = {978-3-031-13184-4 978-3-031-13185-1},
langid = {english},
file = {/home/danesabo/Zotero/storage/3YTF9M9I/Yu et al. - 2022 - STLmc Robust STL Model Checking of Hybrid Systems.pdf}
}
@article{zacchialunStateArtCyberphysical2019,
title = {State of the Art of Cyber-Physical Systems Security: {{An}} Automatic Control Perspective},
shorttitle = {State of the Art of Cyber-Physical Systems Security},
author = {Zacchia Lun, Yuriy and D’Innocenzo, Alessandro and Smarra, Francesco and Malavolta, Ivano and Di Benedetto, Maria Domenica},
date = {2019-03-01},
journaltitle = {Journal of Systems and Software},
shortjournal = {Journal of Systems and Software},
volume = {149},
pages = {174--216},
issn = {0164-1212},
doi = {10.1016/j.jss.2018.12.006},
url = {https://www.sciencedirect.com/science/article/pii/S0164121218302681},
urldate = {2025-03-31},
abstract = {Cyber-physical systems are integrations of computation, networking, and physical processes. Due to the tight cyber-physical coupling and to the potentially disrupting consequences of failures, security here is one of the primary concerns. Our systematic mapping study sheds light on how security is actually addressed when dealing with cyber-physical systems from an automatic control perspective. The provided map of 138 selected studies is defined empirically and is based on, for instance, application fields, various system components, related algorithms and models, attacks characteristics and defense strategies. It presents a powerful comparison framework for existing and future research on this hot topic, important for both industry and academia.},
keywords = {Cyber-physical systems,Security,Systematic mapping study},
file = {/home/danesabo/Zotero/storage/L7RAH6DU/Zacchia Lun et al. - 2019 - State of the art of cyber-physical systems security An automatic control perspective.pdf;/home/danesabo/Zotero/storage/5WXZYJW6/S0164121218302681.html}
}
@article{zahidSystematicMappingSemiformal2022,
title = {A Systematic Mapping of Semi-Formal and Formal Methods in Requirements Engineering of Industrial {{Cyber-Physical}} Systems},
author = {Zahid, Farzana and Tanveer, Awais and Kuo, Matthew M. Y. and Sinha, Roopak},
date = {2022-08},
journaltitle = {Journal of Intelligent Manufacturing},
shortjournal = {J Intell Manuf},
volume = {33},
number = {6},
pages = {1603--1638},
issn = {0956-5515, 1572-8145},
doi = {10.1007/s10845-021-01753-8},
url = {https://link.springer.com/10.1007/s10845-021-01753-8},
urldate = {2023-10-10},
abstract = {The requirements engineering of Industrial Cyber-Physical Systems is extremely challenging due to large system sizes, component heterogeneity, involvement of multi-discipline stakeholders and machines, and continuous evolution. Formal and semi-formal languages, techniques, tools and frameworks can assist by providing repeatable and rigorous structures for eliciting, specifying, analysing, verifying and maintaining requirements. Various approaches have been proposed, but a contemporary and comprehensive study providing a landscape of the state-of-the-art is currently missing. This article reports a systematic mapping study covering 93 primary studies published between 2009 and October 2020. We categorise surveyed studies by current research directions in the use of semi-formal and formal methods for Requirements Engineering phases for Industrial Cyber-Physical Systems. We also identify gaps in current research and develop a novel conceptual model capturing the relationship between available formalisms and Requirements Engineering activities. We find that extensive work has been carried out on the formal analysis and verification of safety and timings requirements. However, the use of semi-formal notations, works on key phases like requirements elicitation and management, and the adoption of industrial standards are largely missing. Moreover, we find no literature providing methods to handle privacy and trust requirements, which have become critical concerns in this area.},
langid = {english},
file = {/home/danesabo/Zotero/storage/QSAFGNUU/Zahid et al. - 2022 - A systematic mapping of semi-formal and formal met.pdf}
}
@online{zhangExplainableHumanintheloopDynamic2022,
title = {Explainable {{Human-in-the-loop Dynamic Data-Driven Digital Twins}}},
author = {Zhang, Nan and Bahsoon, Rami and Tziritas, Nikos and Theodoropoulos, Georgios},
date = {2022-11-22},
eprint = {2207.09106},
eprinttype = {arXiv},
eprintclass = {cs, eess},
url = {http://arxiv.org/abs/2207.09106},
urldate = {2023-10-11},
abstract = {Digital Twins (DT) are essentially Dynamic Data-driven models that serve as real-time symbiotic “virtual replicas” of real-world systems. DT can leverage fundamentals of Dynamic Data-Driven Applications Systems (DDDAS) bidirectional symbiotic sensing feedback loops for its continuous updates. Sensing loops can consequently steer measurement, analysis and reconfiguration aimed at more accurate modelling and analysis in DT. The reconfiguration decisions can be autonomous or interactive, keeping human-in-the-loop. The trustworthiness of these decisions can be hindered by inadequate explainability of the rationale, and utility gained in implementing the decision for the given situation among alternatives. Additionally, different decision-making algorithms and models have varying complexity, quality and can result in different utility gained for the model. The inadequacy of explainability can limit the extent to which humans can evaluate the decisions, often leading to updates which are unfit for the given situation, erroneous, compromising the overall accuracy of the model. The novel contribution of this paper is an approach to harnessing explainability in human-in-the-loop DDDAS and DT systems, leveraging bidirectional symbiotic sensing feedback. The approach utilises interpretable machine learning and goal modelling to explainability, and considers trade-off analysis of utility gained. We use examples from smart warehousing to demonstrate the approach.},
langid = {english},
pubstate = {prepublished},
file = {/home/danesabo/Zotero/storage/6EZU83L3/Zhang et al. - 2022 - Explainable Human-in-the-loop Dynamic Data-Driven .pdf}
}
@inproceedings{zhangUnderstandingUncertaintyCyberPhysical2016,
title = {Understanding {{Uncertainty}} in {{Cyber-Physical Systems}}: {{A Conceptual Model}}},
shorttitle = {Understanding {{Uncertainty}} in {{Cyber-Physical Systems}}},
booktitle = {Modelling {{Foundations}} and {{Applications}}},
author = {Zhang, Man and Selic, Bran and Ali, Shaukat and Yue, Tao and Okariz, Oscar and Norgren, Roland},
editor = {Wąsowski, Andrzej and Lönn, Henrik},
date = {2016},
pages = {247--264},
publisher = {Springer International Publishing},
location = {Cham},
doi = {10.1007/978-3-319-42061-5_16},
abstract = {Uncertainty is intrinsic in most technical systems, including Cyber-Physical Systems (CPS). Therefore, handling uncertainty in a graceful manner during the real operation of CPS is critical. Since designing, developing, and testing modern and highly sophisticated CPS is an expanding field, a step towards dealing with uncertainty is to identify, define, and classify uncertainties at various levels of CPS. This will help develop a systematic and comprehensive understanding of uncertainty. To that end, we propose a conceptual model for uncertainty specifically designed for CPS. Since the study of uncertainty in CPS development and testing is still irrelatively unexplored, this conceptual model was derived in a large part by reviewing existing work on uncertainty in other fields, including philosophy, physics, statistics, and healthcare. The conceptual model is mapped to the three logical levels of CPS: Application, Infrastructure, and Integration. It is captured using UML class diagrams, including relevant OCL constraints. To validate the conceptual model, we identified, classified, and specified uncertainties in two distinct industrial case studies.},
isbn = {978-3-319-42061-5},
langid = {english},
file = {/home/danesabo/Zotero/storage/J3FYJD5D/Zhang et al. - 2016 - Understanding Uncertainty in Cyber-Physical System.pdf}
}
@article{zhaoNeuralLyapunovControl2021,
title = {Neural {{Lyapunov Control}} for {{Power System Transient Stability}}: {{A Deep Learning-Based Approach}}},
shorttitle = {Neural {{Lyapunov Control}} for {{Power System Transient Stability}}},
author = {Zhao, Tianqiao and Wang, Jianhui and Lu, Xiaonan and Du, Yuhua},
date = {2021-08-05},
journaltitle = {IEEE Transactions on Power Systems},
volume = {37},
number = {BNL-222935-2022-JAAM},
publisher = {IEEE},
issn = {0885-8950},
doi = {10.1109/tpwrs.2021.3102857},
url = {https://www.osti.gov/biblio/1868519},
urldate = {2024-01-17},
abstract = {We report that power system control and transient stability analysis play essential roles in secure system operation. Control of power systems typically involves highly nonlinear and complex dynamics. Most of the existing works address such problems with additional assumptions in system dynamics, leading to a requirement for a complete and general solution. This paper, therefore, proposes a novel control framework for various power system control and stability problems leveraging a learning-based approach. The proposed framework includes a two-module structure that iteratively and jointly learns the candidate Lyapunov function and control law via deep neural networks in a learning module. Meanwhile, it guides the learning procedure towards valid results satisfying Lyapunov conditions in a falsification module. The introduced termination criteria ensure provable system stability. This control framework is verified through several studies handling different types of power system control problems. The results show that the proposed framework is generalizable and can simplify the control design for complex power systems with the stability guarantee and enlarged region of attraction.},
issue = {2},
langid = {english},
file = {/home/danesabo/Zotero/storage/7RV26D7X/Zhao et al. - 2021 - Neural Lyapunov Control for Power System Transient.pdf}
}
@article{zhaoStabilityL2gainControl2008,
title = {On Stability, {{L2-gain}} and {{H}}∞ Control for Switched Systems},
author = {Zhao, Jun and Hill, David J.},
date = {2008-05-01},
journaltitle = {Automatica},
shortjournal = {Automatica},
volume = {44},
number = {5},
pages = {1220--1232},
issn = {0005-1098},
doi = {10.1016/j.automatica.2007.10.011},
url = {https://www.sciencedirect.com/science/article/pii/S0005109807004505},
urldate = {2024-01-16},
abstract = {This paper addresses the issues of stability, L2-gain analysis and H∞ control for switched systems via multiple Lyapunov function methods. A concept of general Lyapunov-like functions is presented. A necessary and sufficient condition for stability of switched systems is given in terms of multiple generalized Lyapunov-like functions, which enables derivation of improved stability tests, an L2-gain characterization and a design method for stabilizing switching laws. A solution to the H∞ control problem for switched systems is also provided.},
file = {/home/danesabo/Zotero/storage/TKKQIFS3/Zhao and Hill - 2008 - On stability, L2-gain and H∞ control for switched .pdf;/home/danesabo/Zotero/storage/NYPRM7Y7/S0005109807004505.html}
}
@article{zhenhaiMultiargumentControlMode2016,
title = {Multi-Argument {{Control Mode Switching Strategy}} for {{Adaptive Cruise Control System}}},
author = {Zhenhai, Gao and Jun, Wang and Hongyu, Hu and Wei, Yan and Dazhi, Wang and Lin, Wang},
date = {2016-01-01},
journaltitle = {Procedia Engineering},
shortjournal = {Procedia Engineering},
series = {Green {{Intelligent Transportation System}} and {{Safety}}},
volume = {137},
pages = {581--589},
issn = {1877-7058},
doi = {10.1016/j.proeng.2016.01.295},
url = {https://www.sciencedirect.com/science/article/pii/S1877705816003222},
urldate = {2023-11-20},
abstract = {Adaptive Cruise Control system contains the distance control function which is an extension of the conventional Cruise Control system. ACC system has to switch to appropriate control modes according to different traffic scenes. The existing switching strategies are generally designed based on two arguments including relative distance and relative velocity between the host vehicle and the preceding vehicle. Because switching thresholds of the existing methods are mostly determined based on steady states of control mode, the switching process cannot be continuous and smooth in many cases. In order to overcome the shortage of existing switching strategy, a new switch strategy is put forward in this paper which considers three arguments: distance, relative velocity and acceleration. This new strategy can make vehicle acceleration continuous and smooth during control mode switching, which improves the comfort performance of ACC system. Moreover, the decision algorithms of cruise mode, follow mode and approach mode in ACC system are built. The new switching strategy with three arguments is established in this paper. At last, the road tests show that the proposed switching strategy is able to switch to correct control mode according to actual traffic scenes. In addition, the switching progress is smoother than the existing two arguments switching strategy.},
file = {/home/danesabo/Zotero/storage/V42HQ6C5/Zhenhai et al. - 2016 - Multi-argument Control Mode Switching Strategy for.pdf;/home/danesabo/Zotero/storage/VFRJU8BV/S1877705816003222.html}
}
@article{zhongAnalysisEnergyLaboratory2023,
title = {Analysis of {{Energy Laboratory Safety Management}} in {{China Based}} on the {{System-Theoretic Accident Model}} and {{Processes}}/{{System Theoretic Process Analysis STAMP}}/{{STPA Model}}},
author = {Zhong, Shuheng and Du, Jinping and Jiang, Xidi},
date = {2023-07-25},
journaltitle = {Sustainability},
shortjournal = {Sustainability},
volume = {15},
number = {15},
pages = {11505},
issn = {2071-1050},
doi = {10.3390/su151511505},
url = {https://www.mdpi.com/2071-1050/15/15/11505},
urldate = {2023-11-03},
abstract = {Laboratory safety in colleges and universities has received wider attention as a critical annual inspection by the Ministry of Education. The laboratory environment is complex and diverse, with many hazard factors. To effectively prevent the occurrence of laboratory emergencies in universities, the STAMP/STPA model is used to analyze the safety of energy laboratory safety management in a resource-based university. Between 2021 and 2022, we carried out laboratory safety inspection and field observation for a mining resource university in China, and identified 16 unsafe control actions in the field of energy laboratory safety management in the university, and identified ten critical causal factors leading to unsafe control actions. Combining the actual situation of the mining resource university, the short-term countermeasures and long-term countermeasures to improve laboratory safety management are proposed to guarantee the university’s laboratory safety management. Moreover, the research results have suggestions for the construction and development of laboratory safety management at similar universities.},
langid = {english},
file = {/home/danesabo/Zotero/storage/RNUKHQWX/Zhong et al. - 2023 - Analysis of Energy Laboratory Safety Management in.pdf}
}
@inproceedings{zhouNeuralLyapunovControl2022,
title = {Neural {{Lyapunov Control}} of {{Unknown Nonlinear Systems}} with {{Stability Guarantees}}},
author = {Zhou, Ruikun and Quartz, Thanin and Sterck, Hans De and Liu, Jun},
date = {2022-05-16},
url = {https://openreview.net/forum?id=QvlcRh8hd8X},
urldate = {2024-01-17},
abstract = {Learning for control of dynamical systems with formal guarantees remains a challenging task. This paper proposes a learning framework to simultaneously stabilize an unknown nonlinear system with a neural controller and learn a neural Lyapunov function to certify a region of attraction (ROA) for the closed-loop system with provable guarantees. The algorithmic structure consists of two neural networks and a satisfiability modulo theories (SMT) solver. The first neural network is responsible for learning the unknown dynamics. The second neural network aims to identify a valid Lyapunov function and a provably stabilizing nonlinear controller. The SMT solver verifies the candidate Lyapunov function satisfies the Lyapunov conditions. We further provide theoretical guarantees of the proposed learning framework and show that the obtained Lyapunov function indeed verifies for the unknown nonlinear system under mild assumptions. We illustrate the effectiveness of the results with a few numerical experiments.},
eventtitle = {Advances in {{Neural Information Processing Systems}}},
langid = {english},
file = {/home/danesabo/Zotero/storage/2U4E5YQH/Zhou et al. - 2022 - Neural Lyapunov Control of Unknown Nonlinear Syste.pdf}
}
@article{zonouzDetectingIndustrialControl2014,
title = {Detecting {{Industrial Control Malware Using Automated PLC Code Analytics}}},
author = {Zonouz, Saman and Rrushi, Julian and McLaughlin, Stephen},
date = {2014-11},
journaltitle = {IEEE Security \& Privacy},
shortjournal = {IEEE Secur. Privacy},
volume = {12},
number = {6},
pages = {40--47},
issn = {1540-7993, 1558-4046},
doi = {10.1109/MSP.2014.113},
url = {https://ieeexplore.ieee.org/document/7006408/},
urldate = {2023-10-10},
langid = {english},
file = {/home/danesabo/Zotero/storage/P2TJC2AF/Zonouz et al. - 2014 - Detecting Industrial Control Malware Using Automat.pdf}
}
Reference in New Issue View Git Blame Copy Permalink