Graphical Encoding of a Spatial Logic for the pi-Calculus
, 2007 This paper extends our graph-based approach to the verification of spatial properties of π-calculus specifications. The mechanism is based on an encoding for mobile calculi where each process is mapped into a graph (with interfaces) such that the ...
Gadducci, Fabio +4 more
core +1 more source
On translations of temporal logic of actions into monadic second-order logic
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On the Expansion of Monadic Second-Order Logic with Cantor-Bendixson Rank and Order Type Predicates [PDF]
In this work, we consider two extensions of monadic second-order logic, and study in what cases the classical decidability results are preserved. The first extension, MSO[CBrank_β], is MSO (over the signature of the binary tree) augmented with the extra
Rabinovich, Alexander, Colcombet, Thomas
core +1 more source
Monadic second order logic on graphs with local cardinality constraints
, 2011 We introduce the class of MSO-LCC problems, which are problems of the following form. Given a graph G and for each vertex v of G a set α( v ) of ...
Szeider, Stefan, Stefan Szeider
core +1 more source
The complexity of first-order and monadic second-order logic revisited
, 2004 The model-checking problem for a logic L on a class C of structures asks whether a given L-sentence holds in a given structure in C. In this paper, we give super-exponential lower bounds for fixed-parameter tractable model-checking problems for first ...
Frick, Markus, Grohe, Martin
core +1 more source
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
, 1990 The notion of a recognizable set of finite graphs is introduced. Every set of finite graphs, that is definable in monadic second-order logic is recognizable, but not vice versa.
Courcelle, Bruno
core +1 more source
Proving theorems by program transformation
, 2013 In this paper we present an overview of the unfold/fold proof method, a method for proving theorems about programs, based on program transformation. As a metalanguage for specifying programs and program properties we adopt constraint logic programming ...
Fioravanti, Fabio +3 more
core +1 more source
From transcendental egology to orientation theory: Toward a mereological foundation for the different senses of the "self" in conscious experience. [PDF]
Front Psychol, 2022 Guardiola JG.
europepmc +1 more source
A Hierarchical Approach to Graph Automata and Monadic Second-Order Logic over Graphs
, 2007 A hierarchical approach to the decomposition of graphs is introduced which is related to the notion of tree decomposition. On this basis a hierarchical automaton model for graphs is defined.
Ina Schiering
core
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Order (Dordr), 2023 Couceiro M, Duffus D.
europepmc +1 more source