1989 | |
---|---|
[AD89] | André Arnold et
Anne Dicky.
An Algebraic Characterization of Transition System
Equivalences.
Information and Computation 82(2):198-229. Academic Press, août 1989.
|
[AH89] | Rajeev Alur et
Thomas A. Henzinger.
A Really Temporal Logic.
In FOCS'89,
pages 164-169.
IEEE Comp. Soc. Press, octobre 1989.
|
[All89] | Eric Allender.
P-Uniform Circuit Complexity.
Journal of the ACM 36(4):912-928. ACM Press, octobre 1989.
|
[ALW89] | Martín Abadi, Leslie Lamport et Pierre Wolper. Realizable and Unrealizable Specifications of Reactive Systems. In ICALP'89, Lecture Notes in Computer Science 372, pages 1-17. Springer-Verlag, juillet 1989. |
[AS89] | Bowen Alpern et
Fred B. Schneider.
Verifying Temporal Properties without Temporal
Logic.
ACM Transactions on Programming Languages and
Systems 11(1):147-167. ACM Press, janvier 1989.
|
[BT89] | Dimitri P. Bertsekas et
John N. Tsitsiklis.
Parallel and distributed computation: numerical
methods.
Prentice Hall, 1989.
|
[Gab89] | Dov M. Gabbay.
The Declarative Past and Imperative Future:
Executable Temporal Logic for Interactive Systems.
In TLS'87,
Lecture Notes in Computer Science 398, pages 409-448. Springer-Verlag, 1989.
|
[HL89] | Hans Hüttel et
Kim Guldstrand Larsen.
The Use of Static Constructs in a Modal Process
Logic.
In Logic at Botik 89 – Proceedings of the
Symposium on Logical Foundations of Computer
Science,
Lecture Notes in Computer Science 363, pages 163-180. Springer-Verlag, juillet 1989.
|
[HS89] | Jaakko Hintikka et Gabriel Sandu. Informational Independence as a Semantical Phenomenon. In Proceedings of the 8th International Congress of Logic, Methodology and Philosophy of Science, Studies in Logic and the Foundations of Mathematics 70, pages 571-589. North-Holland, janvier 1989. |
[IK89] | Neil Immerman et
Dexter C. Kozen.
Definability with Bounded Number of Bound Variables.
Information and Computation 83(2):121-139. Academic Press, novembre 1989.
|
[Mil89] | Robin Milner.
Communication and concurrency.
Prentice Hall International Series in Computer
Science.
Prentice Hall, décembre 1989.
|
[NS89] | Maurice Nivat et Ahmed Saoudi. Automata on Infinite Objects and Their Applications to Logic and Programming. Information and Computation 83(1):41-64. Academic Press, octobre 1989. |
[PR89] | Amir Pnueli et Roni Rosner. On the Synthesis of a Reactive Module. In POPL'89, pages 179-190. ACM Press, janvier 1989. |
[PR89] | Amir Pnueli et Roni Rosner. On the Synthesis of an Asynchronous Reactive Module. In ICALP'89, Lecture Notes in Computer Science 372, pages 652-671. Springer-Verlag, juillet 1989. |
[RW89] | Peter J. Ramadge et
W. Murray Wonham.
The Control of Discrete Event Systems.
Proceedings of the IEEE 77(1):81-98. IEEE Comp. Soc. Press, janvier 1989.
|
[Saf89] | Shmuel Safra.
Complexity of Automata on Infinite Objects.
PhD thesis,
Weizmann Institute of Science, Rehovot, Israel,
Mars 1989.
|
[SE89] | Robert S. Streett et E. Allen Emerson. An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus. Information and Computation 81(3):249-264. Academic Press, 1989. |
[Var89] | Moshe Y. Vardi.
A Note on the Reduction of Two-Way Automata to
One-Way Automata.
Information Processing Letters 30(5):261-264. Elsevier, mars 1989.
|
Sélectionner
18 correspondances trouvéesListe des auteurs
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1