Distributing Automata for Asynchronous Networks of Processors
暂无分享,去创建一个
Benoît Caillaud | Paul Caspi | Claude Jard | Alain Girault | B. Caillaud | C. Jard | P. Caspi | A. Girault
[1] Yves Métivier,et al. Recognizable Subsets of Some Partially Abelian Monoids , 1985, Theor. Comput. Sci..
[2] Brian A. Davey,et al. An Introduction to Lattices and Order , 1989 .
[3] J. R. Kennaway,et al. An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems , 1993 .
[4] Wieslaw Zielonka,et al. Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..
[5] Albert Benveniste,et al. The synchronous approach to reactive and real-time systems , 1991 .
[6] M. Clerbout,et al. Semi-commutations , 1987, Inf. Comput..
[7] Ernst-Rüdiger Olderog,et al. Verification of Sequential and Concurrent Programs , 1997, Graduate Texts in Computer Science.
[8] Richard P. Hopkins. Distributable nets , 1990, Applications and Theory of Petri Nets.
[9] Kassem Saleh,et al. A service-based method for the synthesis of communications protocols , 1990 .
[10] Benoît Caillaud,et al. Correctness of Automated Distribution of Sequential Programs , 1993, PARLE.
[11] Jean-Louis Pazat,et al. PANDORE: a system to manage data distribution , 1992 .
[12] P. Caspi,et al. Distributing reactive systems , 1994 .
[13] Gérard Berry,et al. Real Time Programming: Special Purpose or General Purpose Languages , 1989, IFIP Congress.
[14] Antoni W. Mazurkiewicz,et al. Trace Theory , 1986, Advances in Petri Nets.