Results 71 to 80 of about 44,054 (190)

Formalization and Validation of Safety-Critical Requirements [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2010
The validation of requirements is a fundamental step in the development process of safety-critical systems. In safety critical applications such as aerospace, avionics and railways, the use of formal methods is of paramount importance both for ...
Alessandro Cimatti   +3 more
doaj   +1 more source

(Co‐)Reference All the Way Down: A Unified Theory of (Pro) Nominals in Ordinary English

open access: yesTheoria, EarlyView.
ABSTRACT This essay joins two themes, both arising from Kripke's inspiring ideas in the theory of reference. The first theme concerns reference in general. The second examines the notion of co‐reference and the role it plays in a unified theory of pronouns for natural language.
Jessica Pepp, Joseph Almog
wiley   +1 more source

Complexity results for modal logic with recursion via translations and tableaux [PDF]

open access: yesLogical Methods in Computer Science
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations
Luca Aceto   +4 more
doaj   +1 more source

A Constructive Quantum Lov\'asz Local Lemma for Commuting Projectors [PDF]

open access: yes, 2013
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors.
Arad, Itai, Sattath, Or
core  

Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation

open access: yesJournal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.
ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini   +3 more
wiley   +1 more source

HyperLTL Satisfiability Is Highly Undecidable, HyperCTL$^*$ is Even Harder [PDF]

open access: yesLogical Methods in Computer Science
Temporal logics for the specification of information-flow properties are able to express relations between multiple executions of a system. The two most important such logics are HyperLTL and HyperCTL*, which generalise LTL and CTL* by trace ...
Marie Fortin   +3 more
doaj   +1 more source

Efficient Mechanisms for Multi‐Asset Bilateral Trading

open access: yesJournal of Public Economic Theory, Volume 28, Issue 2, April 2026.
ABSTRACT We study when ex‐post efficient bilateral trade is possible under two‐sided asymmetric information with two agents and two assets, subject to balanced budget and voluntary participation constraints. We characterize how the interaction between asset characteristics and ownership structure determines the possibility of efficiency.
Nicolás Figueroa, Vasiliki Skreta
wiley   +1 more source

Robust Control Design and Analysis Based on Lifting Linearization of Nonlinear Systems Under Uncertain Initial Conditions

open access: yesInternational Journal of Robust and Nonlinear Control, Volume 36, Issue 5, Page 3047-3067, 25 March 2026.
ABSTRACT This paper presents a robust control synthesis and analysis framework for nonlinear systems with uncertain initial conditions. First, a deep learning‐based lifting approach is proposed to approximate nonlinear dynamical systems with linear parameter‐varying (LPV) state‐space models in higher‐dimensional spaces while simultaneously ...
Sourav Sinha, Mazen Farhood
wiley   +1 more source

Efficient Scheduling Algorithms for Multicore Cyclic Executives With Precedence and Exclusion Relations

open access: yesConcurrency and Computation: Practice and Experience, Volume 38, Issue 5, March 2026.
ABSTRACT Cyclic executives (CEs) offer the advantage of ensuring complete determinism with minimal runtime overhead, often making them the preferred choice for safety‐critical real‐time systems. However, generating CEs for multicore processors while addressing task precedence and exclusion relations presents significant challenges.
Bruno Nogueira   +4 more
wiley   +1 more source

Terminal Satisfiability in GSTE

open access: yesJournal of Applied Mathematics, 2014
Generalized symbolic trajectory evaluation (GSTE) is an extension of symbolic trajectory evaluation (STE) and a method of model checking. GSTE specifications are given as assertion graphs.
Yongsheng Xu   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy