Cover Image

A model of actors and grey failures

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bocchi, Laura, Lange, Julien, Thompson, Simon, Voinea, A. Laura
Format:	Preprint
Published:	2022
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

Mixed Choice in Asynchronous Multiparty Session Types
by: Bocchi, Laura, et al.
Published: (2026)

A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)

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

Nominal Automata with Name Deallocation
by: Prucker, Simon, et al.
Published: (2026)

Visibly Pushdown Languages in Groups
by: Ciobanu, Laura, et al.
Published: (2026)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)

Scalable Tree-based Register Automata Learning
by: Dierl, Simon, et al.
Published: (2024)

Corrections to A Menagerie of Timed Automata
by: Keiren, Jeroen J. A., et al.
Published: (2016)

Measure Many Quantum Finite Automata on Infinite Words
by: Midya, Abhisek, et al.
Published: (2026)

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

Quantum finite automata and linear context-free languages: a decidable problem
by: Bertoni, A., et al.
Published: (2013)

A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)

A Unifying Approach to Picture Automata
by: Meeres, Yvo Ad, et al.
Published: (2025)

A Variety of Request-Response Specifications
by: Aiba, Daichi, et al.
Published: (2025)

A Factorization Theorem for Forest Algebras
by: Almagor, Shaull, et al.
Published: (2026)

QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)

Safety and Liveness of Quantitative Properties and Automata
by: Boker, Udi, et al.
Published: (2023)

Quantitative Language Automata
by: Henzinger, Thomas A., et al.
Published: (2025)

A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)

Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

FocusE: A semantic extension of FocusST
by: Spichkova, Maria
Published: (2025)

A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

A Linear-time Simulation of Deterministic $d$-Limited Automata
by: Rubtsov, Alexander
Published: (2023)

A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)

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

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

A Usage-Aware Sequent Calculus for Differential Dynamic Logic
by: Dotzel, Myra, et al.
Published: (2023)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
by: Almagor, Shaull, et al.
Published: (2026)

A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)

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

A quadratic lower bound for 2DFAs against one-way liveness
by: Adeogun, Kehinde, et al.
Published: (2026)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
by: Bergsträßer, Pascal, et al.
Published: (2024)

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

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

WEX: Formal Specifications for Windows in Stream Processing
by: Hitarth, S, et al.
Published: (2022)

Correctness Notions for Petri Nets with Identifiers
by: van der Werf, Jan Martijn E. M., et al.
Published: (2022)