Concept

Predicate functor logic

Related publications (9)

Decomposing multipersistence modules using functor calculus

We apply poset cocalculus, a functor calculus framework for functors out of a poset, to study the problem of decomposing multipersistence modules into simpler components. We both prove new results in this topic and offer a new perspective on already established results. In particular, we show that a pointwise finite-dimensional bipersistence module is middle-exact if and only if it is isomorphic to the homology of a homotopy degree 1 functor, from which we deduce a novel, more synthetic proof of the interva

arXiv2025

The Complexity of Checking Non-Emptiness in Symbolic Tree Automata

We study the satisfiability problem of symbolic tree automata and decompose it into the satisfiability problem of the existential first-order theory of the input characters and the existential monadic second-order theory of the indices of the accepted words. We use our decomposition to obtain tight computational complexity bounds on the decision problem for this automata class and an extension that considers linear arithmetic constraints on the underlying effective Boolean algebra.

2023

Undecidability through Fourier series

In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. ...

Elsevier Science Bv2016

Configuration Logics - Modelling Architecture Styles

We study a framework for the specification of architecture styles as families of architectures involving a common set of types of components and coordination mechanisms. The framework combines two logics: 1)~interaction logics for the specification of architectures as generic coordination schemes involving a configuration of interactions between typed components; and 2)~configuration logics for the specification of architecture styles as sets of interaction configurations. Configuration logics can be consid

2015

On an Efficient Decision Procedure for Imperative Tree Data Structures

We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive

2011

Implicit methods for modeling gene regulatory networks

Abhishek Garg

Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from single-gene single-protein experimental approach to studying the behaviour of a ...

EPFL2009

The Role of Tarski’s Declarative Semantics in the Design of Modeling Languages

Alain Wegmann

This paper focuses on Tarski

s declarative semantics and their usefulness in the design of a modeling language. We introduce the principles behind Tarski

s approach to semantics and explain what advantages this offers in the context of modeling languages. Using sentential logic we demonstrate the necessity and sufficiency of Tarski

s semantics for effectively addressing several issues that arise in the design of modeling languages. We explain what role Tarski

s semantics play in the organization of a modeli

2003

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Matthias Zenger

We design and study newObj, a calculus and dependent type system for objects and classes which can have types as members. Type members can be aliases, abstract types, or new types. The type system can model the essential concepts of Java's inner classes as well as virtual types and family polymorphism found in BETA or gbeta. It can also model most concepts of SML-style module systems, including sharing constraints and higher-order functors, but excluding applicative functors. The type system can thus be use

2002

Symbolic Proof of CTL Formulae over Petri Nets

Didier Buchs

We present a method for proving properties of Petri nets expressed in the branching time temporal logic CTL. The framework of CTL formulae, viewed through the notions of predicates and predicate transformers in the context of Petri nets, is also presented. By overcoming the normal limitation of model checking which restricts its applicability to finite state systems this improvement will allow the use of symbolic model checking. The new concept of predicate structure, a symbolic representation of a set of m

1993

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.