We study the problem of synthesizing distributed implementations from global specifications. In particular, we characterize when a global transition system can be implemented as a synchronized product of local transition systems. Our work extends a number of previous studies in this area which have tended to make strong assumptions about the specification-either in terms of determinacy or in terms of information concerning concurrency. We also examine the more difficult problem where the correctness of the implementation in relation to the specification is stated in terms of bisimulation rather than isomorphism. As an important first step, we show how the synthesis problem can be solved in this setting when the implementation is required to be deterministic. © Springer-Verlag Berlin Heidelberg 1999.
CITATION STYLE
Castellani, I., Mukund, M., & Thiagarajan, P. S. (1999). Synthesizing distributed transition systems from global specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1738, pp. 219–231). Springer Verlag. https://doi.org/10.1007/3-540-46691-6_17
Mendeley helps you to discover research relevant for your work.