Related Experiment Video
Updated: Aug 3, 2025

RBDT: A Computerized Task System based in Transposition for the Continuous Analysis of Relational Behavior Dynamics in Humans
Published on: July 17, 2021
First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization,
Aart Middeldorp1, Alexander Lochmann1, Fabian Mitterwallner1
1Department of Computer Science, University of Innsbruck, Innsbruck, Austria.
The decidability of first-order theory for linear variable-separated rewrite systems is established. A new decision procedure, implemented in the FORT tool, utilizes tree automata and has been formally verified.
Area of Science:
- Computer Science
- Formal Methods
- Automata Theory
Background:
- The first-order theory of rewriting is crucial for program analysis and verification.
- Decidability of this theory for specific classes of rewrite systems is a key research challenge.
Purpose of the Study:
- To present a novel decision procedure for the first-order theory of linear variable-separated rewrite systems.
- To introduce FORT, a tool for decision and synthesis based on this procedure.
- To enhance the expressiveness and versatility of the theory and tool.
Main Methods:
- Development of a new decision procedure based on tree automata techniques.
- Formal verification of the procedure using the Isabelle theorem prover.
- Implementation of the procedure in the FORT decision and synthesis tool.
- Design of a certificate language for verifying FORT's output using FORTify.
Main Results:
- The first-order theory of rewriting is proven decidable for linear variable-separated rewrite systems.
- The FORT tool demonstrates decision and synthesis capabilities for properties within this theory.
- Extensive experiments validate the performance and applicability of the developed methods.
Conclusions:
- The presented decision procedure and FORT tool offer a robust solution for analyzing linear variable-separated rewrite systems.
- Formal verification ensures the correctness of the decision procedure.
- The certificate language and FORTify provide a mechanism for trusted verification of results.
Related Concept Videos
Classification of Systems-I
Homogeneity dictates that if an input x(t) is multiplied by a constant c, the output y(t) is multiplied by the same constant. Mathematically, this is expressed as:
First Order Systems
When a first-order system is subjected to a unit-step input, its response is characterized by its transfer function. By applying the Laplace transform of the unit-step input to the transfer function, expanding the...
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...
State Space Representation
Consider an RLC circuit, a...
Woodward–Hoffmann Selection Rules and Microscopic Reversibility
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....

