Imagen de Portada

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Quansah, Paapa Kwesi, Bonnah, Ernest
Formato:	Preprint
Publicado:	2026
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

Robust Probabilistic Temporal Logics
por: Zimmermann, Martin
Publicado: (2023)

Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
por: Bollig, Benedikt
Publicado: (2026)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
por: Besset, Antoine, et al.
Publicado: (2025)

Positional Properties in Temporal Logic
por: Newman, Jessica, et al.
Publicado: (2026)

Model Checking Temporal Properties of Recursive Probabilistic Programs
por: Winkler, Tobias, et al.
Publicado: (2021)

A Note on Runtime Verification of Concurrent Systems
por: Leucker, Martin
Publicado: (2025)

Learning Probabilistic Temporal Logic Specifications for Stochastic Systems
por: Roy, Rajarshi, et al.
Publicado: (2025)

Online Monitoring of Metric Temporal Logic using Sequential Networks
por: Ulus, Dogan
Publicado: (2019)

Safety Verification of Stochastic Systems under Signal Temporal Logic Specifications
por: Ma, Liqian, et al.
Publicado: (2025)

Runtime Verification via Rational Monitor with Imperfect Information
por: Ferrando, Angelo, et al.
Publicado: (2024)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
por: Li, Shuo, et al.
Publicado: (2023)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
por: Li, Junle, et al.
Publicado: (2025)

NeuroNL2LTL: A Neurosymbolic Framework for Natural Language Translation of Linear Temporal Logic
por: Quansah, Paapa Kwesi, et al.
Publicado: (2026)

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

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

A Completeness Theorem for Probabilistic Regular Expressions
por: Różowski, Wojciech, et al.
Publicado: (2023)

Minimising the Probabilistic Bisimilarity Distance
por: Kiefer, Stefan, et al.
Publicado: (2024)

Recomposition: A New Technique for Efficient Compositional Verification
por: Dardik, Ian, 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)

Logics for Context-free Hyperproperties
por: Winter, Sarah, et al.
Publicado: (2026)

Parameterized Verification of Quantum Circuits (Technical Report)
por: Abdulla, Parosh Aziz, et al.
Publicado: (2025)

Robust Probabilistic Bisimilarity for Labelled Markov Chains
por: Fatmi, Syyeda Zainab, et al.
Publicado: (2025)

Decision Questions for Probabilistic Automata on Small Alphabets
por: Bell, Paul C., et al.
Publicado: (2021)

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

Bisimulations and Logics for Higher-Dimensional Automata
por: Zouari, Safa, et al.
Publicado: (2024)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
por: Nakamura, Yoshiki
Publicado: (2026)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
por: Tsai, Wei-Lun, et al.
Publicado: (2026)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
por: Ho, Hsi-Ming, et al.
Publicado: (2025)

Temporal Ensemble Logic
por: Zhang, Guo-Qiang
Publicado: (2024)

Positive Hennessy-Milner Logic for Branching Bisimulation
por: Geuvers, Herman, et al.
Publicado: (2022)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
por: Achilleos, Antonis, et al.
Publicado: (2024)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
por: Bozga, Marius, et al.
Publicado: (2023)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
por: Guha, Shibashis, et al.
Publicado: (2026)

Automaton-based Characterisations of First Order Logic over Infinite Trees
por: Benerecetti, Massimo, et al.
Publicado: (2026)

An Automaton-based Characterisation of First-Order Logic over Infinite Trees
por: Benerecetti, Massimo, et al.
Publicado: (2025)

Parity Games on Temporal Graphs
por: Austin, Pete, et al.
Publicado: (2023)

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
por: Mandrioli, Dino, et al.
Publicado: (2020)

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

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
por: De Giacomo, Giuseppe, et al.
Publicado: (2025)

On the Expressiveness of State Space Models via Temporal Logics
por: Alsmann, Eric, et al.
Publicado: (2026)