FocusE: A semantic extension of FocusST
Fuente:
arXiv
Saved in:
| Main Author: | Spichkova, Maria |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| 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)
by: Spichkova, Maria
Published: (2025)
Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023)
by: Dixon, Alex, et al.
Published: (2023)
A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026)
by: De Maria, Elisabetta, et al.
Published: (2026)
Is decidability of the Submonoid Membership Problem closed under finite extensions?
by: Shafrir, Doron
Published: (2024)
by: Shafrir, Doron
Published: (2024)
A Unifying Approach to Picture Automata
by: Meeres, Yvo Ad, et al.
Published: (2025)
by: Meeres, Yvo Ad, et al.
Published: (2025)
A Variety of Request-Response Specifications
by: Aiba, Daichi, et al.
Published: (2025)
by: Aiba, Daichi, et al.
Published: (2025)
A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)
by: Baburin, Ivan, et al.
Published: (2024)
Corrections to A Menagerie of Timed Automata
by: Keiren, Jeroen J. A., et al.
Published: (2016)
by: Keiren, Jeroen J. A., et al.
Published: (2016)
A Factorization Theorem for Forest Algebras
by: Almagor, Shaull, et al.
Published: (2026)
by: Almagor, Shaull, et al.
Published: (2026)
A model of actors and grey failures
by: Bocchi, Laura, et al.
Published: (2022)
by: Bocchi, Laura, et al.
Published: (2022)
A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)
by: Ballarini, Paolo, et al.
Published: (2024)
A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)
by: Considine, Breandan
Published: (2024)
A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)
by: Schmid, Markus L.
Published: (2025)
A pumping-like lemma for languages over infinite alphabets
by: Danieli, Yoav
Published: (2025)
by: Danieli, Yoav
Published: (2025)
A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)
by: Schwartz, Daniel G.
Published: (2025)
A Linear-time Simulation of Deterministic $d$-Limited Automata
by: Rubtsov, Alexander
Published: (2023)
by: Rubtsov, Alexander
Published: (2023)
A Usage-Aware Sequent Calculus for Differential Dynamic Logic
by: Dotzel, Myra, et al.
Published: (2023)
by: Dotzel, Myra, et al.
Published: (2023)
A Regular and Complete Notion of Delay for Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2022)
by: Filiot, Emmanuel, et al.
Published: (2022)
A Complexity Bound for Determinisation of Min-Plus Weighted Automata
by: Almagor, Shaull, et al.
Published: (2026)
by: Almagor, Shaull, et al.
Published: (2026)
A short survey around the pumping lemma for context-free languages
by: Gullà, Gabriele
Published: (2024)
by: Gullà, Gabriele
Published: (2024)
A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
by: Akshay, S, et al.
Published: (2023)
by: Akshay, S, et al.
Published: (2023)
A quadratic lower bound for 2DFAs against one-way liveness
by: Adeogun, Kehinde, et al.
Published: (2026)
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)
by: Bergsträßer, Pascal, et al.
Published: (2024)
Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
by: Kim, Moon, et al.
Published: (2025)
by: Kim, Moon, 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)
by: Schalk, Patrizia, et al.
Published: (2025)
GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)
by: De Rosa, Mattia, 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)
by: Manini, Andrea, et al.
Published: (2026)
Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)
by: Cry, Pierre, et al.
Published: (2025)
Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)
by: Jeppson, Joshua, et al.
Published: (2025)
Hyper pattern matching
by: Waga, Masaki, et al.
Published: (2025)
by: Waga, Masaki, et al.
Published: (2025)
Input-Driven Pushdown Automata with Translucent Input Letters
by: Kutrib, Martin, et al.
Published: (2025)
by: Kutrib, Martin, et al.
Published: (2025)
Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)
by: Kan, Shuanglong, et al.
Published: (2025)
Componentwise Automata Learning for System Integration (Extended Version)
by: Fujinami, Hiroya, et al.
Published: (2025)
by: Fujinami, Hiroya, et al.
Published: (2025)
Universality Frontier for Asynchronous Cellular Automata
by: Baburin, Ivan, et al.
Published: (2025)
by: Baburin, Ivan, et al.
Published: (2025)
Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)
by: Mazowiecki, Filip, et al.
Published: (2025)
Castor Ministerialis
by: Hercher, Christian
Published: (2025)
by: Hercher, Christian
Published: (2025)
Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)
by: Memmi, Gerard
Published: (2025)
Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)
by: Almagor, Shaull, et al.
Published: (2025)
Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)
by: Slimi, Jaouhar, et al.
Published: (2025)
An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
by: Finkel, Alain, et al.
Published: (2025)
by: Finkel, Alain, et al.
Published: (2025)
Similar Items
-
Spatio-Temporal view on the Topological Functioning Model
by: Spichkova, Maria
Published: (2025) -
Saturating automata for game semantics
by: Dixon, Alex, et al.
Published: (2023) -
A Probabilistic Model-Checking Framework for Cognitive Assessment and Training
by: De Maria, Elisabetta, et al.
Published: (2026) -
Is decidability of the Submonoid Membership Problem closed under finite extensions?
by: Shafrir, Doron
Published: (2024) -
A Unifying Approach to Picture Automata
by: Meeres, Yvo Ad, et al.
Published: (2025)