Synthesizing distributed transition systems from global specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1738, Issue , 1999, Pages 219-231

  Castellani, Ilaria ^a   Mukund, Madhavan ^b   Thiagarajan, P S ^b  

^a INRIA   (France)

^b CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

BISIMULATIONS; DISTRIBUTED IMPLEMENTATION; GLOBAL TRANSITIONS; INFORMATION CONCERNING; LOCAL TRANSITIONS; SYNCHRONIZED PRODUCT; SYNTHESIS PROBLEMS; TRANSITION SYSTEM;

SPECIFICATIONS;

EID: 84958741987     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46691-6_17     Document Type: Conference Paper

References (16)

1. A. Arnold: Finite transition systems and semantics of communicating sytems, Prentice-Hall (1994).
2. E. Badouel and Ph. Darondeau: Theory of Regions. Lectures on Petri nets I (Basic Models), LNCS 1491 (1998) 529-588.
3. I. Castellani, M. Mukund and P.S. Thiagarajan: Characterizing decomposable transition systems, Internal Report, Chennai Mathematical Institute (1999).
4. A. Ehrenfeucht and G. Rozenberg: Partial 2-structures; Part II, State spaces of concurrent systems, Acta Inf. 27 (1990) 348-368.
5. J.F. Groote and F. Moller: Verification of Parallel Systems via Decomposition, Proc. CONCUR’92, LNCS 630 (1992) 62-76.
6. G.J. Holzmann: The model checker SPIN, IEEE Trans. on Software Engineering, 23, 5 (1997) 279-295.
7. R.P. Kurshan: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Princeton University Press (1994).
8. 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.
9. R. Milner: Communication and Concurrency, Prentice-Hall, London (1989).
10. F. Moller: Axioms for Concurrency, Ph.D. Thesis, University of Edinburgh (1989).
11. F. Moller and R. Milner: Unique decomposition of processes, Theor. Compute. Sci. 107 (1993) 357-363.
12. R. Morin: Decompositions of asynchronous systems, Proc. CONCUR’98, LNCS 1466 (1998) 549-564.
13. M. Mukund: Petri Nets and Step Transition Systems, Int. J. Found. Comput. Sci. 3, 4 (1992) 443-478.
14. M. Nielsen, G. Rozenberg and P.S. Thiagarajan: Elementary transition systems, Theor. Comput. Sci. 96 (1992) 3-33.
15. P.S. Thiagarajan: A trace consistent subset of PTL, Proc. CONCUR’95, LNCS 962 (1995) 438-452.
16. 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.