Search
Search Results
-
Synthesis of Compact Strategies for Coordination Programs
In multi-agent settings, such as IoT and robotics, it is necessary to coordinate the actions of independent agents in order to achieve a joint...
-
The Inevitability of Vagueness in Fuzzy Logic
Fuzzy Logic, in its fuzzy control incarnation, can be as well seen as an answer to the belated question on how can an algorithm take in account the...
-
Deciding Boolean Separation Logic via Small Models
We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary nesting of separating conjunctions with boolean...
-
Neural Class Expression Synthesis in \(\mathcal {ALCHIQ(D)}\)
Class expression learning in description logics has long been regarded as an iterative search problem in an infinite conceptual space. Each iteration...
-
Evolutionary Synthesis of Gene Regulatory Dynamics
This chapter focuses on evolving the regulatory dynamics most commonly seen in nature. At first, an evolutionary algorithm is adopted to evolve the...
-
Guess and Then Check: Controller Synthesis for Safe and Secure Cyber-Physical Systems
In this paper, we report our ongoing work on safe and secure controller synthesis for cyber-physical systems (CPS). Our approach separates the...
-
Robust Alternating-Time Temporal Logic
In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial...
-
Dedicated hardware design for efficient quantum computations using classical logic gates
This work presents a novel approach to quantum computing by proposing a customizable hardware design of a dedicated processor that emulates the...
-
SwitchLog: A Logic Programming Language for Network Switches
The development of programmable switches such as the Intel Tofino has allowed network designers to implement a wide range of new in-network...
-
Runtime Verification Meets Controller Synthesis
Reactive synthesis guarantees correct-by-construction controllers from logical specifications, but is costly—2EXPTIME-complete in the size of the...
-
Optimal Manufacturing Controller Synthesis Using Situation Calculus
In this paper, we discuss a framework for synthesising manufacturing process controllers using situation calculus, a well-known second-order logic...
-
Most General Winning Secure Equilibria Synthesis in Graph Games
This paper considers the problem of co-synthesis in k-player games over a finite graph where each player has an individual...
-
Program Synthesis for Musicians: A Usability Testbed for Temporal Logic Specifications
In recent years, program synthesis research has made significant progress in creating user-friendly tools for Programming by example (PBE) and...
-
Synthesis of Distributed Protocols by Enumeration Modulo Isomorphisms
Synthesis of distributed protocols is a hard, often undecidable, problem. Completion techniques provide partial remedy by turning the problem into a...
-
An Experimental Toolchain for Strategy Synthesis with Spatial Properties
We investigate the application of strategy synthesis to enforce spatial properties. The Contract Automata Library (CATLib) performs both composition...
-
Satisfiability and Synthesis Modulo Oracles
In classic program synthesis algorithms, such as counterexample-guided inductive synthesis (CEGIS), the algorithms alternate between a synthesis...
-
Synthesis and Initialization of Adaptive Neuro-Fuzzy Control Based on the SDRE Technique for a Two-Link Manipulator
AbstractOne of the open problems in modern control theory is synthesis of adaptive control for nonlinear systems with parametric uncertainty and...
-
Logic-Level Fault Simulation
In this chapter, we present different applications of SSBDDs and S3BDDs in the field of simulation of digital circuits. We have developed algorithms...
-
Methods for Changing Parallelism in the Process of High-Level VLSI Synthesis
AbstractIn this paper, methods for increasing the efficiency of VLSI development based on the method of architecture-independent design are proposed....
-
Probabilistic Program Verification via Inductive Synthesis of Inductive Invariants
Essential tasks for the verification of probabilistic programs include bounding expected outcomes and proving termination in finite expected runtime....