Cover Image

Temporal Causal Models as a Model of Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gladyshev, Maksim, Alechina, Natasha, Logan, Brian
Format:	Preprint
Published:	2026
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Spatio-Temporal view on the Topological Functioning Model
by: Spichkova, Maria
Published: (2025)

Computational Model for Parsing Expression Grammars
by: Rubtsov, Alexander, et al.
Published: (2024)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)

Synchronous Signal Temporal Logic for Decidable Verification of Cyber-Physical Systems
by: Roop, Partha, et al.
Published: (2026)

Computational Complexity of Alignments
by: Schwanen, Christopher T., et al.
Published: (2026)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
by: Becker, Ruben, et al.
Published: (2024)

Model Checking for Multi-Agent Systems Modeled By Epistemic Process Calculus
by: Yu, Qixian, et al.
Published: (2025)

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)

Polyregular Model Checking
by: Lopez, Aliaume, et al.
Published: (2025)

RESTL: Reinforcement Learning Guided by Multi-Aspect Rewards for Signal Temporal Logic Transformation
by: Fang, Yue, et al.
Published: (2025)

Learning EFSM Models with Registers in Guards
by: Vega, Germán, et al.
Published: (2024)

Conservative Perception Models for Probabilistic Verification
by: Cleaveland, Matthew, et al.
Published: (2025)

Regular Languages in the Sliding Window Model
by: Ganardi, Moses, et al.
Published: (2024)

Alloy-Driven Verification of Object-Centric Event Data: From Temporal Logic to Knowledge Graphs
by: Latif, Saba, et al.
Published: (2025)

Computing measures of weak-MSO definable sets of trees
by: Niwiński, Damian, et al.
Published: (2024)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)

The rIC3 Hardware Model Checker
by: Su, Yuheng, et al.
Published: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property
by: Bonizzoni, Paola, et al.
Published: (2024)

A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
by: Leys, Tim, et al.
Published: (2024)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Random Testing of Model Checkers for Timed Automata with Automated Oracle Generation
by: Manini, Andrea, et al.
Published: (2025)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)

Time for Quiescence: Modelling quiescent behaviour in testing via time-outs in timed automata
by: Briones, Laura Brandán, et al.
Published: (2025)

Mind the Gap: A Formal Investigation of the Relationship Between Log and Model Complexity -- Extended Version
by: Schalk, Patrizia, et al.
Published: (2025)

Universally Wheeler Languages
by: Becker, Ruben, et al.
Published: (2025)

Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
by: Paul, Subrata, et al.
Published: (2024)

Planning with Linear Temporal Logic Specifications: Handling Quantifiable and Unquantifiable Uncertainty
by: Yu, Pian, et al.
Published: (2025)

Neuro-Symbolic Generation of Explanations for Robot Policies with Weighted Signal Temporal Logic
by: Yuasa, Mikihisa, et al.
Published: (2025)

LTL-D*: Incrementally Optimal Replanning for Feasible and Infeasible Tasks in Linear Temporal Logic Specifications
by: Ren, Jiming, et al.
Published: (2024)

Completely reachable automata: a quadratic decision algorithm and a quadratic upper bound on the reaching threshold
by: Ferens, Robert, et al.
Published: (2022)

Weighted Tree Automata -- May it be a little more?
by: Fülöp, Zoltán, et al.
Published: (2022)

Minimizing Cost Register Automata over a Field
by: Benalioua, Yahia Idriss, et al.
Published: (2023)

An Iterative Approach for Heterogeneous Multi-Agent Route Planning with Resource Transportation Uncertainty and Temporal Logic Goals
by: Cardona, Gustavo A., et al.
Published: (2025)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
by: Chocholatý, David, et al.
Published: (2023)

Transducing Language Models
by: Snæbjarnarson, Vésteinn, et al.
Published: (2026)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
by: Maneth, Sebastian, et al.
Published: (2023)