Upload
lamnhi
View
221
Download
1
Embed Size (px)
Citation preview
Bibliography
[ACD90]
[ADA83]
[AHU74]
[AMP92]
[AW85]
[BBB89]
[BC85]
[BCG87]
R. Alur, C. Courcoubetis, and D. Dill. Model checking of real-time systems. In Fifth IEEE Symposium on Logic in Computer Science, Philadelphia, 1990.
ADA. The Programming Language ADA Reference Manual, LNCS 155. Springer Verlag, 1983.
A. Aho, J. Hopcroft, and J. Ullman. Design and analysis of computer Algorithms. Addison Wesley, 1974.
C. Andre, J.P. Marmorat, and J.P. Paris. Execution machines for Esterel. In 1st European Control Conference, Grenoble, July 1992.
E. A. Ashcroft and W. W. Wadge. LUCID, the data-flow programming language. Academic Press, 1985.
R. Bernhard, G. Berry, and F. Boussinot. The occ c generated code interface manual. Technical Report Ecole Nationale Superieure des Mines de Paris, December 1989.
M. C. Browne and E. M. Clarke. SML - a high-level language for the design and verification of finite state machines. Research Report CMU-CS-85-179, Carnegie Mellon University, 1985.
G. Berry, P. Couronne, and G. Gonthier. Programmation synchrone des systemes reactifs, le langage ESTEREL. Technique et Science Informatique, 4:305-316, 1987.
161
162
[BCG88]
BIBLIOGRAPHY
G. Berry, P. Couronne, and G. Gonthier. Synchronous programming of reactive systems, an introduction to ESTEREL.
In K. Fuchi and M. Nivat, editors, Programming 0/ Future Generation Computers. Elsevier Science Publisher B.V. (North Holland), 1988. INRIA Report 647.
[BCH+85] J-L. Bergerand, P. Caspi, N. Halbwachs, D. Pilaud, and E. Pilaud. Outline of areal-time data-flow language. In 1985 Real-Time Symposium, San Diego, December 1985.
[BCHP86] J-L. Bergerand, P. Caspi, N. Halbwachs, and J. Plaice. Automatie control systems programming using areal-time declarative Ianguage. In IFAC/IFIP Symp. 'SOCOCO 86, Graz, May 1986.
[BCM90a] C. Berthet, O. Coudert, and J. C. Maclre. New ideas on symbolic manipulations of finite state machines. In International Con/erence on Computer Design (ICCD) , Cambridge, September 1990.
[BCM+90b] J.R. Bureh, E.M. Clarke, K.L. Me Millan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Fifth IEEE Symposium on Logic in Computer Seien ce, Philadelphia, 1990.
[BCP88]
[Ben91]
[Ber89]
B. Buggiani, P. Caspi, and D. Pilaud. Programming distributed automatie control systems: a language and compiler solution. Technical Report SPECTRE L4, IMAG, GrenobIe, July 1988.
A. Benveniste. Constructive probability and the SIGN ALEA language: building and handling stochastic processes via programming. RR 1532, INRIA, 1991.
G. Berry. Real time programming: Special purpose or general purpose languages. In IFIP World Computer Congress, San Francisco, 1989.
BIBLIOGRAPHY 163
[Ber91a] G. Berry. A hardware implementation of pure ESTEREL. In ACM Workshop on Formal Methods in VLSI Design, Miami, January 1991.
[Ber91b] G. Berry. Programming a digital watch in ESTEREL v3_2. Technical Report 08/91, Centre de Mathematiques Appliquees, Ecole des Mines de Paris, Sophia-Antipolis, 1991.
[BFH90] A. Bouajjani, J. C. Fernandez, and N. Halbwachs. On the verification of safety properties. Technical Report SPECTRE L12, IMAG, Grenoble, March 1990.
[BFH+92] A. Bouajjani, J. C. Fernandez, N. Halbwachs, P. Raymond, and C. Ratel. Minimal state graph generation. Seienee 0/ Computer Programming, 18:247~269, 1992.
[BG88] G. Berry and G. Gonthier. The synchronous pro gramming language ESTEREL, design, semantics, implementation. Technical Report 842, INRlA, 1988. To appear in Seienee 0/ Computer Programming.
[BHSV90] R. K. Brayton, G. D. Hachtel, and A. L. SangiovanniVincentelli. Multilevel logic synthesis. Proeeedings 0/ the IEEE, 78(2), 1990.
[BL85] D. Borrione and C. Le Faou. Overview oft he CASCADE multilevel hardware description language and its mixed mode simulation mechanisms. In Computer Hardware Deseription Languages and Their Applieations. Elsevier Science, North Holland, 1985.
[BL90]
[Bou91]
A. Benveniste and P. LeGuernic. Hybrid dynamical systems theory and the SIGNAL language. IEEE Transactions on Automatie Control, 35(5):535-546, May 1990.
F. Boussinot. Programming a reflex game in Esterel v3_2. Research Report 07/91, Centre de Mathematiques Appliquees, Ecole des Mines de Paris, Sophia-Antipolis, 1991.
184 BIBLIOGRAPHY
[BRdSV90] G. Boudol, V. Roy, R. de Simone, and D. Vergamini. Process calculi, !rom theory to practice: Verification tools. In International Workshop on Automatie Verifieation Methods for Finite State Systems, Grenoble, LNCS 407. Springer Verlag, 1990.
[Bro89] M. Broy. Functional specification of time sensitive commuIPcating systems. In REX Workshop, 1989.
[BRV90] P. Bertin, D. Roncin, and J. Vuillemin. Introduction to programmable a.ctive memories. In J. McCanny, J. Me Whirter, and E. Swartzlander, editors, Systolie Array Processors. Prentice-Hall, 1990.
[Bry86] R. E. Bryant. Graph-ba.sed algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-692, 1986.
[Brz64] J. A. Brzozowski. Derivative ofregular expressions. JACM, 11(4), 1964.
[BS87] G. Berry and R. Sethi. From regular expressions to deterministic automata. TCS, 25(1), 1987.
[BS91] F. Boussinot and R. de Simone. The ESTEREL language. Proceedings of the IEEE, 79(9):1293-1304, September 1991.
[CBM89] O. Coudert, C. Berthet, and J. C. Madre. Verification of synchronous sequential machines based on symbolic execution. In International Workshop on Automatie Verifieation Methods for Finite State Systems, Grenoble, LNCS 407 .. Springer Verlag, 1989.
[CES86]
[CM90]
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatie verification of finite-state concurrent systems using temporallogic specifications. ACM TOPLAS, 8(2), 1986.
O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In International Conferenee on Computer Aided Design (ICCAD), Santa Clara, 1990.
BIBLIOGRAPHY 185
[CM91] E. Coste-Maniere. Synchronisme et asynchronisme dans la programm at ion des systemes robotiques: apport du langage Esterel et de concepts objets. Thesis, Ecole Nationale Superieure des Mines de Paris, 1991.
[CMB90] O. Coudert, J. C. Madre, and C. Berthet. Verifying temporal properties of sequential machines without building their state diagrams. In R. Kurshan, editor, Intemational Workshop on Computer Aided Verijication, Rutgers, June 1990.
[Cou90] Ph. Couronne. Le systeme ESTEREL v2. Thesis, Universite Paris VII, December 1990.
[CPHP87] P. Caspi, D. Pilaud, N. Halbwachs, and J. Plaice. LUSTRE: a declarative language for programming synchronous systems. In 14th ACM Symposium on Principles of Programming Languages, Munchen, January 1987.
[Fer90] J. C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Science of Computer Programming, 13(2-3), May 1990.
[GGB87] T. Gauthier, P. Le Guernic, and L. Besnard. Signal, a declarative language for synchronous programming of realtime systems. In Proc. 3rd. Conf. on Functional Programming Languages and Computer Architecture, LNCS 274. Springer Verlag, 1987.
[Ghe92] G. Gherardi. Sahara: un environnement de mise au point graphique pour les programmes Esterel (in Preparation). Thesis, Universite de Nice, 1992.
[Glo89] A-C. Glory. Verification de proprietes de programmes Hots de donnees synchrones. Thesis, Universite Joseph Fourier, Grenoble, December 1989.
[GMP+90] N. Ghezal, S. Matiatos, P. Piovezan, Y. Sorel, and M. Sorine. SYNDEX, un environnement de programm at ion
166 BIBLIOGRAPHY
pour multi-processeur de traitement du signal. Mecanismes de communication. Technical Report 1236, INRIA Rocquencourt, France, 1990.
[Gon85] G. Gonthier. Private communication. 1985.
[Gon88] G. Gonthier. Semantiques et modeles d'execution des langages reactifs synchrones; application a. ESTEREL. Thesis, University of Paris VI, 1988.
[Gra82] J. R. Mc Graw. The VAL language: Description and analysis. ACM TOPLAS, 4(1), January 1982.
[Har87] D. Harel. Statecharts: A visual approach to complex systems. Science 0/ Computer Programming, 8(3), 1987.
[HCRP91] N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud. The synchronous dataflow programming language LUSTRE. Proceedings 0/ the IEEE, 79(9):1305-1320, September 1991.
[HGd88] C. Huizing, R. Gerth, and W. P. de Roever. Modelling Statecharts behaviour in a fully abstract way. In 13th CAAP, LNCS 299. Springer Verlag, 1988.
[HL90] N. Halbwachs and F. Lagnier. An experience in proving regular networks of processes by modular model checking. Technical Report SPECTRE L13 (to appear in Acta Informatica), IMAG, Grenoble, March 1990.
[Ho187] G. J. Holzmann. On limits and possibilities of automated protocols analysis. In IFIP WG-6.1 7th. International Con/erence on Protocol Specijication, -Testing and Verijication. North Holland, 1987.
[HP85] D. Harel and A. Pnueli. On the development of reactive systems. In Logic and Models 0/ Concurrent Systems, NATO Advanced Study Institute on Logics and Models /or Verification and Specijication 0/ Concurrent Systems. Springer Verlag, 1985.
BIBLIOGRAPHY 167
[HPOG89] N. Halbwachs, D. Pilaud, F. Ouabdesselam, and A.C. Glory. Specifying, programming and verifying real-time systems, using a synchronous declarative language. In Workshop on Automatie Verifieation Methods for Finite State Systems, Grenoble, LNCS 407. Springer Verlag, June 1989.
[HPSS86] D. Harel, A. Pnueli, J. P. Schmidt, and R. Sherman. On the formal semantics of Statecharts. In Logie in Computer Scienee, 1986.
[HRR91] N. Halbwachs, P. Raymond, and C. Rate!. Generating efficient code from data-flow programs. In Third International Symposium on Programming Language Implementation and Logie Programming, Passau, August 1991.
[INM84] INMOS Ltd. The Oeeam Programming Manual. PrenticeHall International, 1984.
[Kah74] G. Kahn. The semantics of a simple language for parallel programming. In IFIP 74. North Holland, 1974.
[KQ77] G. Kahn and D. B. Mac Queen. Coroutines and networks of parallel processes. In IFIP Congress, 1977.
[LBBG85] P. LeGuernic, A. Benveniste, P. Bournai, and T. Gautier. SIGNAL: a data-flow oriented language for signal processing. RR 378, INRIA, 1985.
[LeG89] B. LeGoff. Inference de controle hierarchique, application au temps ree!. Thesis, Universite Rennes 1, June 1989.
[LGLL91] P. LeGuernic, T. Gautier, M. LeBorgne, and C. LeMaire. Programming real time applications with SIGNAL. Proeeedings of the IEEE, 79(9):1321-1336, September 1991.
[Mar89] F. Maraninchi. Argonaute: graphical description, semantics and verification of reactive systems by using a process algebra. In International Workshop on Automatie Verifieation Methods for Finite State Systems, Grenoble, LNCS 407. Springer Verlag, 1989.
168
[Mar90]
[Mil80]
[MiI83]
[MM84]
[par92]
[PH87]
[PH88]
[pla88]
[Plo81]
[Pnu77]
[PS87]
BIBLIOGRAPHY
F. Maraninchi. Argos, un langage graphique pour la conception, la description et la validation des systemes reactifs. Thesis, Universite Joseph Fourier, Grenoble, 1990.
R. Milner. A Calculus 0/ Communicating Systems, LNCS 9t. Springer Verlag, 1980.
R. Milner. Calculi for synchrony and asynchrony. TCS, 25(3), July 1983.
B. Moszkowski and Z. Manna. Reasoning in interval temporal logic. In Workshop on Logics 0/ Programs, LNCS 164. Springer Verlag, 1984.
J-P. Paris. Execution de t8.ches asynchrones depuis Esterel. Thesis, University of Nice, 1992.
J. A. Plaice and N. Halbwachs. LUSTRE-v2 user's guide and reference manual. Technical Report SPECTRE L2, IMAG, Grenoble, October 1987.
D. Pilaud and N. Halbwachs. From a synchronous declarative language to a temporal logic dealing with multiform time. In M. Joseph, editor, Symposium on Formal Techniques in Real- Time and Fault- Tolerant Systems, LNCS 331. Springer Verlag, September 1988.
J. A. Plaice. Semantique et compilation de LUSTRE, un langage declaratif synchrone. Thesis, Institut National Polytechnique de Grenoble, 1988.
G. D. Plotkin. A structural approach to operational semantics. Lecture notes, Aarhus University, 1981.
A. Pnueli. The temporallogic of programs. In 18th Symp. on the Foundations 0/ Computer Science. IEEE, 1977.
J. A. Plaice and J-B. Saint. The LUSTRE-EsTEREL portable format. Unpublished report, INRIA, Sophia Antipolis, 1987.
BIBLIOGRAPHY 169
[PT87]
[QS82]
[Ray88]
[RdS90]
[RH91a]
[RH91b]
[RHR91]
[Roc89]
[Roy90]
R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM J. Comput., 16(6), 1987.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CES AR. In International Symposium on Programming, LNCS 137. Springer Verlag, April 1982.
P. Raymond. Compilation separee de programmes LUSTRE. Technical Report SPECTRE L5, IMAG, Grenoble, June 1988.
V. Roy and R. de Simone. Auto and Autograph. In R. Kurshan, editor, International Workshop on Computer Aided Verification, Rutgers, June 1990.
F. Rocheteau and N. Halbwachs. Implementing reactive pro grams on circuits, a hardware implementation of LUSTRE. In REx Workshop on Real-Time: Theory in Practice, DePlasmolen {Netherlands}, LNCS 600, pages 195-208. Springer Verlag, June 1991.
F. Rocheteau and N. Halbwachs. POLLUX, a LUSTRE based hardware design environment. In P. Quinton and Y. Robert, editors, Conference on Algorithms and Parallel VLSI Architectures II, Chateau de Bonas, June 1991.
C. Ratei, N. Halbwachs, and P. Raymond. Pro gramming and verifying critical systems by means of the synchronous data-fiow programming language LUSTRE. In ACM-SIGSOFT'91 Conference on Software for Critical Systems, New Orleans, December 1991.
F. Rocheteau. Programmation d'un circuit massivement parallele a. l'aide d'un langage declaratif synchrone. Technical Report SPECTRE LI0, IMAG, Grenoble, June 1989.
V. Roy. AUTOGRAPH, un outil de visualisation pour les calculs de processus. Thesis, University of Nice, 1990.
170 BIBLIOGRAPHY
[RRSV87] J. L. Riehier, C. Rodriguez, J. Sifakis, and J. Voiron. VerIDeation in XESAR of the sliding window protoeol. In IFIP WG-6.1 7th. International Conference on Protocol Specijication, Testing and Verijication. North Holland, 1987.
[RSS9] V. Roy and R. de Simone. An AUTOGRAPH primer. Teehnie al Report INRIA, May 1989.
[SP90] J-B. Saint and J-P. Paris. Les instructions du eode intermediaire, description syntaxique. Unpublished report, INRIA, Sophia Antipolis, 1990.
[STB91] H. Savoj, H. Touati, and R. K. Brayton. The use of image eomputation teehniques in extracting Ioeal don't eares and network optimization. In International Conference on Computer Aided Design (ICCAD), November 1991.
[Ver86] D. Vergamini. Verifieation by means of observational equivalenee on automata. Technieal Report 501, INRIA, 1986.
[Xil88] XiIinx, Ine. The Programmable Gate Array Data Book. Product Specifieation, 1988.
Index
ADA 4, 5, 22, 100, 104 AFCET xii ALDEBARAN 100 ARGOS 39-51, xii, xiii, 7, 8, 77,
85, 92, 100, 108, 157, 159
arrays (in LUSTRE) 123, 124, 159
assertion (in LUSTRE) 57,59,60, 63,68,99,141,144,146
AUTO 101, 149-155 AUTOGRAPH 102, 149 automat on 3, 6, 8, 11, 39, 40,
49, 78, 79, 85, 86, 90, 91, 92, 96-101, 108, 109, 114, 117, 143, 145, 149, 150, 151
- (in ARGOS) 40,41, 42, 44, 46 - (minimization) 99, 100, 158 avait-case (ESTEREL) 20 avait (ESTEREL) 18, 19 basic dock (LUSTRE) 56, 57, 58,
59, 61, 62, 81 Benveniste A. xii, xiii, 68 Berry G. xii, xiii, 11 binary decision diagram (BDD)
136, 147 bisimulation 149, 151-154
171
broadcasting (of signals) 4, 12, 13, 21, 22, 23, 41, 43
Brzozowski J.A. 86 Caspi P. xii, xiii
causality 8, 29, 31, 39, 45, 62, 75-79, 83, 85, 95, 159
CISI xiii, 11 dock 8, 55, 105, 107, 118, 120,
131, 132, 133 - (in LUSTRE) 56-62,64,65,67,
80, 81, 94, 96 - (in SIGNAL) 68-71, 81-83 complex system 6 control structure 8, 65, 85, 96 coroutine 106, 107 current (LUSTRE) 59, 96 current value of a signal (Es-
TEREL) 12, 14 data-flow 53, 54, 55, 61, 68, 118 data management 7
data operator 57, 58, 81 data structure 7
DEC-PRL 118, 119
default (SIGNAL) 70 delay (in SIGNAL) 69
dependence 54, 62, 83, 105, 107 derivative 86
172
determinism 2, 4, 5, 30, 41, 45, 46, 68, 75, 78, 79, 85, 159
deterministic merge (in SIGNAL)
70 distributed code 8, 102, 103-116 do-upto (ESTEREL) 19 do-vatching (ESTEREL) 17 dummy communication 108, 114 EMC 101 emi t (ESTEREL) 16 ENSMP xi, xiii, 11 environment xi, 1, 5, 6, 11, 12,
14, 16, 26, 41, 59, 70, 141, 146
ESTEREL 11-36, xi, xiii, 7, 8, 39, 40, 41, 43, 45, 46, 49, 57, 59, 60, 62, 65, 68, 75, 77, 85, 93, 96, 99, 100, 108, 117, 118, 129, 149, 157, 158, 159
event 6 - (external) 5 - (in ESTEREL) 13, 17, 30, 85,
86, 87, 91 every (ESTEREL) 19 exception handling (in ARGOS)
47 extraction operator (SIGNAL) 69 flow (in LUSTRE) 56 followed-by (LUSTRE) 58 gate array 117 hal t (ESTEREL) 15 hardware 2, 3, 54, 55, 117-136,
158, 159 Barel D. 39
INDEX
hierarchical decomposition (AR-
GOs) 41, 44 history 6, 13 host language 7, 13, 32, 57, 100 IC 92, 100, 157, 158 ILOG xiii, 11 IMAG xi, xii, xiii, 39, 55 immediate (ESTEREL) 17, 34 INRIA xi, xiii, 11, 149 instantaneous dialogue 22-24 interactive system 1, 2, 7 interface 1, 6, 7, 14, 32, 60, 62,
63, 65, 66, 71, 80, 101, 158
- generator 102 interrupt 2, 3, 4, 7 - (in ARGOS) 44, 46, 49 - (in ESTEREL) 15, 18, 31, 35,
46, 89, 159 IRISA xi, xiii, 68 L.O xi, xii Le Guernic P. xii, xiii, 68 liveness property 140 local signal - (in ARGOS) 40, 42-44,46, 77,
78 - (in ESTEREL) 15, 29, 30, 34,
89 loop-each (ESTEREL) 19 LUSTRE 55-67, xi, xii, xiii, 7,
8, 53, 68, 69, 71, 79, 81, 83, 85, 93, 100, 104, 105, 107, 108, 117, 118, 129, 140, 141, 143, 157, 159
Maraninchi F. xii, xiii
INDEX
Merlin Gerin 55 model checking 143, 147 - (symbolic) 147 modular vermcation 140, 146 module (ESTEREL) 13, 15, 16 node (LUSTRE) 60, 61 - and docks (L USTRE) 61 - expansion (LUSTRE) 93, 94 normal termination (ARGOS) 47 nothing (ESTEREL) 15 observation 3, 8, 149 observational congruence 151 OC 8, 100-102, 108, 109, 114,
157, 158 OCCAM 4, 104 OCMIN 100 operating system xi, 1, 2, 3, 4, 6 PAM 118-:120, 123, 124 parallel - composition (SIGNAL) 70 - operator (ARGOS) 41, 44, 47 - statement (ESTEREL) 15, 16 Petri net 3 Pnueli A. 39 potential 76, 77 present (ESTEREL) 17 previous operator (LUSTRE) 58 priority 2, 4, 18, 20, 35, 47 process calculus 140, 149 programmable active bit 118 protocol xii, 1, 100, 103 pure signal (ESTEREL) 12, 13,
16, 68, 85 reaction 6, 7, 41, 42, 43, 44, 49,
75, 76, 77, 88, 91, 93, 97, 100, 112, 114, 150
173
- time 55, 92, 117, 118, 147 reactive - kernel 7 - system xi, 1, 2, 3, 5, 22, 27,
53, 55, 103, 117, 139, 140
reduction (of automata) 3, 149-155
reflex game 21, 31, 102 relations (in ESTEREL) 14, 33,
59, 60, 87 reliability 1, 2 rendez-vous 4 run statement (ESTEREL) 15, 16 safety property 139, 140, 141,
143 SAHARA 102 sensor 7, 103 - (in ESTEREL) 11, 12, 14 sequential code 8, 85-102, 104-
106, 158 SIGNAL 68-72, xi, 7, 8, 55, 81,
82, 104, 107, 15~ 159 signal - (in ARGOS) 40 - (in ESTEREL) 11 - (in SIGNAL) 68 - combination (ESTEREL) 13,
16 - top 12 silicon compiling 8, 117-136 simultaneous, simultaneity 5, 6,
12, 13, 16, 17, 18, 20, 21, 24, 41, 45
single loop 94-96, 98 SML xi
174
STATECHARTS xi, xii, 30, 39, 41 state graph 143 stopwatch 14, 23, 25, 29, 31, 49,
65, 76, 86 substitution principle 57 sustain (ESTEREL) 20, 24 synchronous, synchrony xi, xii,
5, 6, 7, 11, 12, 16, 17, 21, 23, 29, 39, 55, 56, 70, 71, 75, 91, 92, 104, 11~ 118, 14~149, 157
synchro (SIGNAL) 71 task based model 4 temporallogic 3, 140, 141 tick 13, 20, 24, 87, 89, 132, 133 timed graph 140 time out (ESTEREL) 19 time - (execution) xi, 2, 3,6,92,103 - (multiform) 5, 21, 57 - (physical) 5, 56
TNI xiii, 68 transformation al system 1, 7 trap-ex i t (ESTEREL) 15 valued signal (ESTEREL) 12 verification 2, 3, 8, 54, 60, 92,
101, 139-155
- (static) 8, 75-83 Verilog xiii, 55 watch 14, 22,49 watchdog 17, 19, 62, 63, 64, 94,
125, 136, 144 vhen operator - (in LUSTRE) 58 - (in SIGNAL) 69
INDEX
withdrawal (in ESTEREL) 18, 31, 46
XESAR 101