1992 | |
---|---|
[ACD+92] | Rajeev Alur,
Costas Courcoubetis,
David L. Dill,
Nicolas Halbwachs, and
Howard Wong-Toi.
An Implementation of three algorithms for timing
verification based on automata emptiness.
In RTSS'92,
pages 157-166.
IEEE Comp. Soc. Press, December 1992.
|
[AH92] | Rajeev Alur and
Thomas A. Henzinger.
Logics and Models of Real Time: A Survey.
In REX'91,
Lecture Notes in Computer Science 600, pages 74-106. Springer-Verlag, 1992.
|
[AH92] | Rajeev Alur and
Thomas A. Henzinger.
Back to the Future: Towards a Theory of Timed
Regular Languages.
In FOCS'92,
pages 177-186.
IEEE Comp. Soc. Press, October 1992.
|
[AL92] | Martín Abadi and Leslie Lamport. An old-fashioned recipe for real time. In REX'91, Lecture Notes in Computer Science 600, pages 1-27. Springer-Verlag, 1992. |
[BBC92] | Danièle Beauquier,
Jean Berstel, and
Philippe Chrétienne.
Éléments d'algorithmique.
Masson, 1992.
|
[BCG+92] | Samuel R. Buss,
Stephen A. Cook,
Vineet Gupta, and
Vijaya Ramachandran.
An Optimal Parallel Algorithm for Formula
Evaluation.
SIAM Journal on Computing 21(4):755-780. Society for Industrial and Applied Math., August 1992.
|
[BCM+92] | Jerry R. Burch, Edmund M. Clarke, Kenneth L. McMillan, David L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation 98(2):142-170. Academic Press, June 1992. |
[BCO+92] | François Baccelli,
Guy Cohen,
Geert Jan Olsder, and
Jean-Pierre Quadrat.
Shynchronization and Linearity. An Algebra For
Discrete Event Systems.
John Wiley & Sons, 1992.
|
[BGS92] | José Balcázar, Joaquim Gabarró, and Miklós Sántha. Deciding bisimilarity is P-complete. Formal Aspects of Computing 4(1 supplement):638-648. Springer-Verlag, November 1992. |
[CS92] | Rance Cleaveland and Bernhard Steffen. A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal Mu-Calculus. Formal Methods in System Design 2(2):121-147. Kluwer Academic, 1992. |
[CY92] | Costas Courcoubetis and Mihalis Yannakakis. Minimum and Maximum Delay Problems in Real-Time Systems. Formal Methods in System Design 1(4):385-415. Kluwer Academic, December 1992. |
[EMS+92] | E. Allen Emerson,
Aloysius Ka-Lau Mok,
A. Prasad Sistla, and
Jayashankar Srinivasan.
Quantitative Temporal Reasoning.
Real-Time Systems 4:331-352. Kluwer Academic, 1992.
|
[GS92] | Steven M. German and A. Prasad Sistla. Reasoning about Systems with Many Processes. Journal of the ACM 39(3):675-735. ACM Press, July 1992. |
[HMP92] | Thomas A. Henzinger,
Zohar Manna, and
Amir Pnueli.
What Good are Digital Clocks?.
In ICALP'92,
Lecture Notes in Computer Science 623, pages 545-558. Springer-Verlag, July 1992.
|
[HMP92] | Thomas A. Henzinger,
Zohar Manna, and
Amir Pnueli.
Timed Transition Systems.
In REX'91,
Lecture Notes in Computer Science 600, pages 226-251. Springer-Verlag, 1992.
|
[Koz92] | Dexter C. Kozen. The design and analysis of algorithms. Springer-Verlag, 1992. |
[Lar92] | Kim Skak Larsen.
Length of Maximal Common Subsequences.
Technical Report PB-426, DAIMI, Faculty of Science, University of Aarhus,
Denmark, October 1992.
|
[LS92] | Nancy Lynch and
Nir Shavit.
Timing-Based Mutual Exclusion.
In RTSS'92,
pages 2-11.
IEEE Comp. Soc. Press, December 1992.
|
[NYY92] | Anil Nerode,
Alexander Yakhnis, and
Vladimir Yakhnis.
Concurrent programs as strategies in games.
In Logic from Computer Science,
Mathematical Sciences Research Institute
Publications 21, pages 405-479. Springer-Verlag, 1992.
|
[Ost92] | Jonathan S. Ostroff. Formal methods for the specification and design of real-time safety critical systems. Journal of Systems and Software 18(1):33-60. Elsevier, April 1992. |
[RMD+92] | Y. Srinivas Ramakrishna,
Louise E. Moser,
Laura K. Dillon,
P. Michael Melliar-Smith, and
George Kutty.
An Automata Theoretic Decision Procedure for
Propositional Temporal Logic with Since and Until.
Fundamenta Informaticae 17(3):272-282. IOS Press, November 1992.
|
[Saf92] | Shmuel Safra. Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition. In STOC'92, pages 272-282. ACM Press, 1992. |
[Wig92] | Avi Wigderson.
The Complexity of Graph Connectivity.
In MFCS'92,
Lecture Notes in Computer Science 629, pages 112-132. Springer-Verlag, August 1992.
|
Search
Displayed 23 resultsList of authors
- 1
- 3
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1