Imagen de Portada

Message complexity for unary multiautomata systems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Choffrut, Christian
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
por: Bollig, Benedikt, et al.
Publicado: (2025)

Cyclic system for an algebraic theory of alternating parity automata
por: Das, Anupam, et al.
Publicado: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
por: Rooduijn, Jan, et al.
Publicado: (2024)

The role of counting quantifiers in laminar set systems
por: Campbell, Rutger, et al.
Publicado: (2025)

Minimization of Streaming Transducers
por: Bianchini, Christian, et al.
Publicado: (2026)

A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)

Function spaces for orbit-finite sets
por: Bojańczyk, Mikołaj, et al.
Publicado: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
por: Barloy, Corentin, et al.
Publicado: (2025)

Positive First-order Logic on Words and Graphs
por: Kuperberg, Denis
Publicado: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
por: Das, Anupam, et al.
Publicado: (2025)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

A formal query language and automata model for aggregation in complex event recognition
por: Bourhis, Pierre, et al.
Publicado: (2026)

Solvability of orbit-finite systems of linear equations
por: Ghosh, Arka, et al.
Publicado: (2022)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2024)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
por: Chen, Yu-Fang, et al.
Publicado: (2024)

Simple grammar bisimilarity, with an application to session type equivalence
por: Poças, Diogo, et al.
Publicado: (2024)

On Dependent Variables in Reactive Synthesis
por: Akshay, S., et al.
Publicado: (2024)

Attractors of Parikh mapping iterations
por: Chunikhin, Alexander
Publicado: (2024)

Invariants for One-Counter Automata with Disequality Tests
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
por: Caltais, Georgiana, et al.
Publicado: (2024)

Logic and Languages of Higher-Dimensional Automata
por: Amrane, Amazigh, et al.
Publicado: (2024)

Complete Test Suites for Automata in Monoidal Closed Categories
por: Kocsis, Bálint, et al.
Publicado: (2024)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
por: Winter, Sarah, et al.
Publicado: (2024)

Higher-Dimensional Timed Automata for Real-Time Concurrency
por: Amrane, Amazigh, et al.
Publicado: (2024)

Deciding the synthesis problem for hybrid games through bisimulation
por: Dima, Catalin, et al.
Publicado: (2024)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
por: Chistikov, Dmitry, et al.
Publicado: (2024)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
por: Bueri, Lucas, et al.
Publicado: (2024)

Recomposition: A New Technique for Efficient Compositional Verification
por: Dardik, Ian, et al.
Publicado: (2024)

Positive and monotone fragments of FO and LTL
por: Kuperberg, Denis, et al.
Publicado: (2024)

Random Graph Generation in Context-Free Graph Languages
por: Vastarini, Federico, et al.
Publicado: (2024)

Random Deterministic Automata With One Added Transition
por: Carayol, Arnaud, et al.
Publicado: (2024)

An automata-based approach for synchronizable mailbox communication
por: Delpy, Romain, et al.
Publicado: (2024)

Improved Algorithm for Reachability in $d$-VASS
por: Fu, Yuxi, et al.
Publicado: (2024)

The Algebras for Automatic Relations
por: Morvan, Rémi
Publicado: (2024)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
por: Zheng, Yangluo
Publicado: (2024)

Arbitrary-arity Tree Automata and QCTL
por: Laroussinie, François, et al.
Publicado: (2024)

Quasi-Isometric Reductions Between Infinite Strings
por: Celine, Karen Frilya, et al.
Publicado: (2024)

Slightly Non-Linear Higher-Order Tree Transducers
por: Nguyên, Lê Thành Dũng, et al.
Publicado: (2024)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
por: Takata, Yoshiaki, et al.
Publicado: (2024)