Abstract
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.
This work has been sponsored by IFCPAR Project 1502-1. This work has also been supported in part by BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Aarhus University, Denmark.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold: Finite transition systems and semantics of communicating sytems, Prentice-Hall (1994). 220
E. Badouel and Ph. Darondeau: Theory of Regions. Lectures on Petri nets I (Basic Models), LNCS 1491 (1998) 529–588. 219
I. Castellani, M. Mukund and P.S. Thiagarajan: Characterizing decomposable transition systems, Internal Report, Chennai Mathematical Institute (1999). 226, 230
A. Ehrenfeucht and G. Rozenberg: Partial 2-structures; Part II, State spaces of concurrent systems, Acta Inf. 27 (1990) 348–368. 219
J.F. Groote and F. Moller: Verification of Parallel Systems via Decomposition, Proc. CONCUR’92, LNCS 630 (1992) 62–76. 220
G.J. Holzmann: The model checker SPIN, IEEE Trans. on Software Engineering, 23, 5 (1997) 279–295. 220
R.P. Kurshan: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Princeton University Press (1994). 220
A. Mazurkiewicz: Basic notions of trace theory, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (eds.), Linear time, branching time and partial order in logics and models for concurrency, LNCS 354 (1989) 285–363. 220
R. Milner: Communication and Concurrency, Prentice-Hall, London (1989). 220, 227
F. Moller: Axioms for Concurrency, Ph.D. Thesis, University of Edinburgh (1989). 220
F. Moller and R. Milner: Unique decomposition of processes, Theor. Comput. Sci. 107 (1993) 357–363. 220
R. Morin: Decompositions of asynchronous systems, Proc. CONCUR’98, LNCS 1466 (1998) 549–564. 220, 222
M. Mukund: Petri Nets and Step Transition Systems, Int. J. Found. Comput. Sci. 3, 4 (1992) 443–478. 219
M. Nielsen, G. Rozenberg and P.S. Thiagarajan: Elementary transition systems, Theor. Comput. Sci. 96 (1992) 3–33. 219
P.S. Thiagarajan: A trace consistent subset of PTL, Proc. CONCUR’95, LNCS 962 (1995) 438–452. 220, 229, 229
G. Winskel and M. Nielsen: Models for concurrency, in S. Abramsky, D. Gabbay and T.S.E. Maibaum, eds, Handbook of Logic in Computer Science, Vol 4, Oxford (1995) 1–148. 219
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castellani, I., Mukund, M., Thiagarajan, P.S. (1999). Synthesizing Distributed Transition Systems from Global Specifications. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive