Distributed safety controllers for web services
Anders B. Sandholm,Michael I. Schwartzbach +1 more
- 28 Mar 1998
- pp 270-284
TL;DR: High-level synchronization constraints are used, written in a version of monadic second-order logic on finite strings, to synthesize safety controllers for interactive web services to avoid state-space explosions and to increase the flow capacities of services.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Mona implementation secrets
TL;DR: An overview of MONA and a selection of implementation "secrets" that have been discovered and tested over the years, including formula reductions, DAGification, guided tree automata, three-valued logic, eager minimization, BDD-based automata representations, and cache-conscious data structures are presented.
170
PowerForms: Declarative client-side form field validation
TL;DR: This work presents PowerForms, which is an add-on to HTML forms that allows a purely declarative specification of input formats and sophisticated interdependencies of form fields, and is seen as inspiration for a future extension of HTML.
143
•Journal Article
What is a “good” encoding of guarded choice?
TL;DR: In this article, the authors present a series of encodings for languages with (1) input-guarded choice, (2) both input-and outputguarded choices, and (3) mixed-guarding choice, and investigate them with respect to compositionality and divergencefreedom.
120
CoFI: the common framework initiative for algebraic specification and development
Peter D. Mosses
- 01 May 2001
TL;DR: The proliferation of specification languages, some differing in only quite minor ways from each other, is a considerable obstacle for the use of algebraic methods in industrial contexts, making it difficult to exploit standard examples, case studies and training material.
The bigwig Project
TL;DR: The -bigwig- project, which aims to design and implement a high-level domain-specific language for programming interactive Web services, uses the available Web technologies as target languages, making - bigwig- available on almost any combination of browser and server, without relying on plug-ins or server modules.
References
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
•Book
Symbolic Model Checking
Edmund M. Clarke,Kenneth L. McMillan,Sérgio Campos,Vassili Hartonas-Garmhausen +3 more
- 31 Jul 1993
TL;DR: Using symbolic model checking techniques it is possible to verify industrial-size finite state systems and models with more than 10120 states have been verified using special techniques.
The control of discrete event systems
Peter J. Ramadge,W. M. Wonham +1 more
- 01 Jan 1989
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.
3K
Decidability of second-order theories and automata on infinite trees
TL;DR: In this article, it was shown that the second-order theory of countable linearly ordered sets is decidable, and that the theory of automata on infinite trees is also decidable.