A Variety of Request-Response Specifications

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Aiba, Daichi, Waga, Masaki, Fujinami, Hiroya, Muroya, Koko, Ouchi, Shutaro, Ueda, Naoki, Yokoyama, Yosuke, Wada, Yuta, Hasuo, Ichiro
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911172972773376
author Aiba, Daichi
Waga, Masaki
Fujinami, Hiroya
Muroya, Koko
Ouchi, Shutaro
Ueda, Naoki
Yokoyama, Yosuke
Wada, Yuta
Hasuo, Ichiro
author_facet Aiba, Daichi
Waga, Masaki
Fujinami, Hiroya
Muroya, Koko
Ouchi, Shutaro
Ueda, Naoki
Yokoyama, Yosuke
Wada, Yuta
Hasuo, Ichiro
contents We find, motivated by real-world applications, that the well-known request-response specification comes with multiple variations, and that these variations should be distinguished. As the first main contribution, we introduce a classification of those variations into six types, and present it as a decision tree, where a user is led to the type that is suited for their application by answering a couple of questions. Our second main contribution is the formalization of those six types in various formalisms such as temporal logics, grammars, and automata; here, two types out of the six are non-regular specifications and their formalization requires extended formalisms. We also survey tools for monitoring these specifications to cater for practitioners' needs.
format Preprint
id arxiv_https___arxiv_org_abs_2509_13078
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle A Variety of Request-Response Specifications
Aiba, Daichi
Waga, Masaki
Fujinami, Hiroya
Muroya, Koko
Ouchi, Shutaro
Ueda, Naoki
Yokoyama, Yosuke
Wada, Yuta
Hasuo, Ichiro
Formal Languages and Automata Theory
We find, motivated by real-world applications, that the well-known request-response specification comes with multiple variations, and that these variations should be distinguished. As the first main contribution, we introduce a classification of those variations into six types, and present it as a decision tree, where a user is led to the type that is suited for their application by answering a couple of questions. Our second main contribution is the formalization of those six types in various formalisms such as temporal logics, grammars, and automata; here, two types out of the six are non-regular specifications and their formalization requires extended formalisms. We also survey tools for monitoring these specifications to cater for practitioners' needs.
title A Variety of Request-Response Specifications
topic Formal Languages and Automata Theory
url https://arxiv.org/abs/2509.13078