Distributed Safety Controllers for Web Services

We show how to use high-level synchronization constraints, written in a version of monadic second-order logic on finite strings, to synthesize safety controllers for interactive web services. We improve on the naIve runtime model to avoid state-space explosions and to increase the flow capacities of services.

[1]  Ian Stark.  Names, Equations, Relations: Practical Ways to Reason about new , 1997, TLCA.

[2]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[3]  Anders B. Sandholm,et al.  Distributed Safety Controllers for Web Services , 1997 .

[4]  Olivier Danvy,et al.  Higher-Order Rewriting and Partial Evaluation , 1997, RTA.

[5]  J. Christopher Ramming,et al.  Programming the Web: An Application-Oriented Language for Hypermedia Service Programming , 1996, World Wide Web journal.

[6]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

[7]  Uwe Nestmann.  What is a "Good" Encoding of Guarded Choice? , 2000, Inf. Comput..

[8]  M. Rabin.  Decidability of second-order theories and automata on infinite trees. , 1969 .

[9]  Kenneth C. Cox.  Lunchbot: A Tale of Two Ways to Program Web Services , 1996 .

[10]  Nils Klarlund,et al.  Mona: Monadic Second-Order Logic in Practice , 1995, TACAS.

[11]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[12]  Paul Pettersson,et al.  Tools and Algorithms for the Construction and Analysis of Systems: 28th International Conference, TACAS 2022, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2022, Munich, Germany, April 2–7, 2022, Proceedings, Part II , 1998, TACAS.

[13]  Jana Kosecka,et al.  Control of Discrete Event Systems , 1992 .

[14]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .