English
Related papers

Related papers: An Improved Decision Procedure for Linear Time Mu-…

200 papers

This article proposes a novel high-performance computing approach for the prediction of the temperature field in powder bed fusion (PBF) additive manufacturing processes. In contrast to many existing approaches to part-scale simulations,…

Computational Engineering, Finance, and Science · Computer Science 2023-09-18 Sebastian D. Proell , Peter Munch , Martin Kronbichler , Wolfgang A. Wall , Christoph Meier

Over the past several years, various federated learning (FL) methodologies have been developed to improve model accuracy, a primary performance metric in machine learning. However, to utilize FL in practical decision-making scenarios,…

Machine Learning · Computer Science 2025-01-24 Yun-Wei Chu , Dong-Jun Han , Seyyedali Hosseinalipour , Christopher Brinton

An improved approach to updating the electric field in simulations of Coulomb gases using the local lattice technique introduced by Maggs and Rossetto, is described and tested. Using the Fast Fourier Transform (FFT) an independent…

Other Condensed Matter · Physics 2009-11-11 A. Duncan , R. D. Sedgewick , R. D. Coalson

Propositional linear time temporal logic (LTL) is the standard temporal logic for computing applications and many reasoning techniques and tools have been developed for it. Tableaux for deciding satisfiability have existed since the 1980s.…

Logic in Computer Science · Computer Science 2016-04-15 Mark Reynolds

To securely transmit sensitive information into the future, Time-Lock Puzzles (TLPs) have been developed. Their applications include scheduled payments, timed commitments, e-voting, and sealed-bid auctions. Homomorphic TLP is a key variant…

Cryptography and Security · Computer Science 2024-06-25 Aydin Abadi

LTL is frequently used to express specifications in many domains such as embedded systems or business processes. Witnesses can help to understand why an LTL specification is satisfiable, and a number of approaches exist to make…

Logic in Computer Science · Computer Science 2013-06-13 Viktor Schuppan

Runtime verification encompasses several lightweight techniques for checking whether a system's current execution satisfies a given specification. We focus on runtime verification for Linear Temporal Logic (LTL). Previous work describes…

Logic in Computer Science · Computer Science 2025-08-12 Javier Esparza , Vincent Fischer

Temporal Logic (TL) guided control problems have gained interests in recent years. By using the TL, one can specify a wide range of temporal constraints on the system and is widely used in cyber-physical systems. On the other hand, Control…

Systems and Control · Computer Science 2019-03-12 Guang Yang , Roberto Tron , Calin Belta

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also…

Logic in Computer Science · Computer Science 2017-01-11 Joel Ouaknine , James Worrell

In this paper, a fault-tolerant approach to mitigate transient and permanent faults of arithmetic and logic operations of embedded processors called FT-EALU is proposed. In this method, each operation is replicated in time and the derived…

Hardware Architecture · Computer Science 2022-04-05 Athena Abdi , Sina Shahoveisi

Federated Learning (FL) is a learning paradigm that protects privacy by keeping client data on edge devices. However, optimizing FL in practice can be difficult due to the diversity and heterogeneity of the learning system. Despite recent…

Machine Learning · Computer Science 2023-02-21 Yongxin Guo , Tao Lin , Xiaoying Tang

Safety-critical infrastructures must operate in a safe and reliable way. Fault tree analysis is a widespread method used for risk assessment of these systems: fault trees (FTs) are required by, e.g., the Federal Aviation Administration and…

Logic in Computer Science · Computer Science 2025-08-05 Stefano M. Nicoletti , Milan Lopuhaä-Zwakenberg , E. Moritz Hahn , Mariëlle Stoelinga

Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of…

Logic in Computer Science · Computer Science 2011-11-15 Takashi Tomita , Shigeki Hagihara , Naoki Yonezaki

Process mining extracts valuable insights from event data to help organizations improve their business processes, which is essential for their growth and success. By leveraging process mining techniques, organizations gain a comprehensive…

Databases · Computer Science 2024-06-14 Nesma M. Zaki , Iman M. A. Helal , Ehab E. Hassanein , Ahmed Awad

Large language models (LLMs) are increasingly used to assist ideation in research, but evaluating the quality of LLM-generated research proposals remains difficult: novelty and soundness are hard to measure automatically, and large-scale…

Computation and Language · Computer Science 2026-05-27 Heng Wang , Pengcheng Jiang , Jiashuo Sun , Zhiyi Shi , Haofei Yu , Jiawei Han , Heng Ji

In this work, we consider the problem of designing secure and efficient federated learning (FL) frameworks. Existing solutions either involve a trusted aggregator or require heavyweight cryptographic primitives, which degrades performance…

Cryptography and Security · Computer Science 2022-01-31 Jieren Deng , Chenghong Wang , Xianrui Meng , Yijue Wang , Ji Li , Sheng Lin , Shuo Han , Fei Miao , Sanguthevar Rajasekaran , Caiwen Ding

This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short).…

Logic in Computer Science · Computer Science 2014-02-12 Marcello M. Bersani , Achille Frigeri , Angelo Morzenti , Matteo Pradella , Matteo Rossi , Pierluigi San Pietro

Max-Plus Linear (MPL) systems are an algebraic formalism with practical applications in transportation networks, manufacturing and biological systems. In this paper, we investigate the problem of automatically analyzing the properties of…

Formal Languages and Automata Theory · Computer Science 2023-08-22 Muhammad Syifa'ul Mufid , Andrea Micheli , Alessandro Abate , Alessandro Cimatti

Probabilistic Temporal Tensor Factorization (PTTF) is an effective algorithm to model the temporal tensor data. It leverages a time constraint to capture the evolving properties of tensor data. Nowadays the exploding dataset demands a large…

Machine Learning · Statistics 2016-11-14 Guangxi Li , Zenglin Xu , Linnan Wang , Jinmian Ye , Irwin King , Michael Lyu

We propose a new algorithm for solving the graph-fused lasso (GFL), a method for parameter estimation that operates under the assumption that the signal tends to be locally constant over a predefined graph structure. Our key insight is to…

Machine Learning · Statistics 2015-06-02 Wesley Tansey , James G. Scott