Protocol Synthesis from Context-Free Processes using Event Structures
Abstract:
In this paper, we propose a protocol synthesis method based on a partial order model (called event structures) for the class of context-free processes. First, we assign a unique name called event ID to every event executable by a given service specification. An event ID is a finite sequence of symbols derived from the context-free process specification. Then we show that some interesting sets of events are expressible by regular expressions on symbols, and that the event structure can be finitely represented by a set of relations among the regular expressions. Finally, we present a method to derive a protocol specification which implements a given service specification on distributed nodes, by using the obtained finite representation of event structures. The derived protocol specification contains the minimum message exchanges necessary to ensure the partial order of events of the service specification.
Citations
| 2771 | Introduction to Automata Theory, Languages and Computation – Hopcroft, Ullman - 1979 |
| 183 | unknown title – ISO - 1989 |
| 22 | Quantitative and Qualitative Extensions of Event Structures – Katoen - 1996 |
| 19 | Deriving protocol specifications from service specifications written – Kant, Higashino, et al. |
| 15 | Protocol synthesis in a state transition model – Chu, Liu - 1988 |
| 12 | Deriving protocol specifications from service specifications including parameters – Gotzhein, Bochmann - 1990 |
| 11 | An efficient verifier of truly concurrent properties – Bianchi, Coluccini, et al. - 1995 |
| 2 | Structural decomposition – Hultstrom - 1995 |
