Search
Search Results
-
Coalition Alternating-Time Temporal Logic: A Logic to Find Good Coalitions to Achieve Strategic Objectives
Alternating-time Temporal Logic (ATL) extends the temporal logic CTL, permitting quantification over coalitions of agents. During the model checking...
-
Specification Sketching for Linear Temporal Logic
Virtually all verification and synthesis techniques assume that formal specifications are readily available, functionally correct, and fully match...
-
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems
This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (...
-
Convolutional Graph Neural Networks for Predicting Enthalpy of Formation in Intermetallic Compounds Using Continuous Filter Convolutional Layers
Accurately predicting the enthalpy of formation for intermetallic compounds plays a crucial role in materials design and optimization. This article...
-
Separators in Continuous Petri Nets
Leroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking...
-
Interpolation and Quantifiers in Ortholattices
We study quantifiers and interpolation properties in orthologic, a non-distributive weakening of classical logic that is sound for formula validity...
-
Checking and Sketching Causes on Temporal Sequences
Temporal causality describes what concrete input behavior is responsible for some observed output behavior on a trace of a reactive system, and can...
-
On the Translation of Automata to Linear Temporal Logic
While the complexity of translating future linear temporal logic (LTL) into automata on infinite words is well-understood, the size increase involved...
-
Formalization and Verification of the Zab Protocol Using CSP
ZooKeeper Atomic Broadcast (Zab) is a high-performance atomic broadcast protocol, which is a key component of Apache ZooKeeper. By ensuring strong...
-
Thread-Local, Step-Local Proof Obligations for Refinement of State-Based Concurrent Systems
This paper presents a proof technique for proving refinements for general state-based models of concurrent systems that reduces proving forward...
-
Labelled Sequent Calculi for Conditional Logics: Conditional Excluded Middle and Conditional Modus Ponens Finally Together
We introduce labelled sequent calculi for Conditional Logics with a selection function semantics. Conditional Logics are a sort of generalization of...
-
MLTL Multi-type (MLTLM): A Logic for Reasoning About Signals of Different Types
Modern cyber-physical systems (CPS) operate in complex systems of systems that must seamlessly work together to control safety- or mission-critical...
-
Input and Understanding of Chemical Symbols in Multimedia Education Software
People’s demand for knowledge and skills in work and life will increase day by day. Because multimedia education software has many advantages, such...
-
Mining Specification Parameters for Multi-class Classification
We present a method for mining parameters of temporal specifications for signal classification. Given a parametric formula and a set of labeled...
-
Labelled Calculi for the Logics of Rough Concepts
We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic...
-
ACR-GNN: Adaptive Cluster Reinforcement Graph Neural Network Based on Contrastive Learning
It has been amply proven that the graph neural networks (GNNs) are effective at various graph-level tasks. The chemical molecule properties...
-
Ill-Founded Proof Systems for Intuitionistic Linear-Time Temporal Logic
We introduce ill-founded sequent calculi for two intuitionistic linear-time temporal logics. Both logics are based on the language of intuitionistic...
-
Agent Behavior Composition in Stochastic Settings
Behavior composition problem is particularly relevant for multi-agent systems and aims at building a complex target behavior using several agent...
-
Maximum Satisfiability of Mission-Time Linear Temporal Logic
Mission-time Linear Temporal Logic (MLTL) is a variant of Linear Temporal Logic (LTL) with finite interval bounds on temporal operators, and is a...
-
SMT Sampling via Model-Guided Approximation
We investigate the domain of satisfiable formulas in satisfiability modulo theories (SMT), in particular, automatic generation of a multitude of...