Specifying real-time finite-state systems in linear logic (extended abstract)

Electronic Notes in Theoretical Computer Science

Volumn 16, Issue 1, 1998, Pages 42-59

  Kanovich, Max I ^a   Okada, Mitsuhiro ^b   Scedrov, Andre ^c  

^a RUSSIAN STATE UNIVERSITY FOR THE HUMANITIES   (Russian Federation)

^b KEIO UNIVERSITY   (Japan)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MATHEMATICAL MODELS; REAL TIME SYSTEMS;

FINITE-STATE SYSTEMS; LINEAR IMPLICATIONS; LINEAR ORDERING; PROVABILITY PROBLEMS;

COMPUTER PROGRAMMING;

EID: 0038245727     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80591-2     Document Type: Conference Paper

References (52)

1. M. Abadi, and L. Lamport An old-fashioned recipe for real time ACM Transactions on Programming Languages and Systems 16 5 1994 1543 1571
2. R. Alur, and T.A. Henzinger Logics and models of real time: a survey J.W. de Bakker Real Time: Theory in Practice 1992 74 106 Springer LNCS 600
3. R. Alur, and T.A. Henzinger Real-time logics: complexity and expressiveness Information and Computation 104 1993 35 77
4. R. Alur, and D.L. Dill A theory of timed automata Theoretical Computer Science 126 1994 183 235
5. R. Alur, and D.L. Dill Automata-theoretic verification of real-time systems In Formal Methods for Real-Time Computing 1996 Trends in Software Series, John Wiley & Sons Publishers 55 82
6. R. Alur, T. Feder, and T.A. Henzinger The benefits of relaxing punctuality Journal of the ACM 43 1996 116 146
7. N. Shankar. Mechanical verification of real-time systems using PVS. In C. Courcoubetis, editor, 5-th International Conference on Computer-Aided Verification. Springer LNCS 697, 1993. Expanded version available as a Technical Report SRI-CSL-92-12, November, 1992.
8. P.C. Olveczky, and J. Meseguer Specifying real-time systems in rewriting logic Electronic Notes in Theoretical Computer Science 4 1996
9. J.S. Ostroff Temporal Logic of Real-Time Systems 1990 Research Studies Press
10. Z. Manna, and A. Pnueli The Temporal Logic of Reactive and Concurrent Systems: Specification 1992 Springer-Verlag
11. A. Pnueli The temporal logic of programs In Proc. 18-th Annual Symposium on the Foundations of Computer Science 1977 46 57
12. L. Lamport The temporal logic of actions ACM Transactions on Programming Languages and Systems 16 3 1994 872 923
13. J. Davies, and S. Schneider A brief history of Timed CSP Theoretical Computer Science 138 August 1989 243 271 1995. See also Technical Report PRG-75, Oxford University Computing Laboratory
14. F. Moller, and C. Tofts A temporal calculus of communicating systems In CONCUR ′90 1990 Springer LNCS 458 401 415
15. X. Nicollin, and J. Sifakis The algebra of timed processes ATP: Theory and application Information and Computation 114 1994 131 178
16. M. Hennessy, and T. Reagan A process algebra for timed systems Information and Computation 117 1995 221 239
17. P. Brémond-Grégoire, J.-Y. Choi, and I. Lee A complete axiomatization of finite-state ACSR processes Information and Computation 138 1997 124 159
18. A.P. Sistla, M. Vardi, and P. Wolper The complementation problem for Büchi automata with applications to temporal logic Theoretical Computer Science 49 1987 217 237
19. A.P. Sistla, and E.M. Clarke The complexity of propositional linear temporal logics Journal of the ACM 32 3 1985 733 749
20. J.-Y. Girard Linear logic Theoretical Computer Science 50 1987 1 102
21. J.-Y. Girard Linear logic: its syntax and semantics J.-Y. Girard Y. Lafont L. Regnier Advances in linear logic. London Mathematical Society Lecture Note Series 1995 Available by anonymous ftp from lmd.univ-mrs.fras/pub/girard/Synsem.ps.Z
22. A. Scedrov A brief guide to linear logic G. Rozenberg A. Salomaa Current Trends in Theoretical Computer Science 1993 World Scientific Publishing Co 377 394
23. A. Scedrov Linear logic and computation: a survey H. Schwichtenberg Proof and Computation, Proceedings Marktoberdorf Summer School 1993 1994 NATO Advanced Science Institutes, Series F, Springer-Verlag Berlin 281 298
24. M.I. Kanovich The complexity of Horn fragments of linear logic Annals of Pure and Applied Logic 69 1994 195 241
25. J.-M. Andreoli Logic programming with focusing proofs in linear logic Journal of Logic and Computation 2 3 1992 297 347
26. T. Andreoli, J.-M. Castagnetti, and R. Pareschi Static analysis of linear logic programming New Generation Computing 15 4 1997
27. J.S. Hodas Logic programming in intuitionistic linear logic: theory, design, and implementation Dissertation, University of Pennsylvania 1994
28. J.S. Hodas, and D. Miller Logic programming in a fragment of intuitionistic linear logic Information and Computation 110 1994 327 365
29. D. Miller A multiple-conclusion specification logic Theoretical Computer Science 165 1996 201 232
30. N. Kobayashi Concurrent linear logic programming Dissertation, University of Tokyo 1996
31. N. Kobayashi, and A. Yonezawa Asynchronous communication model based on linear logic Formal Aspects of Computing 7 1995 113 149
32. N. Kobayashi, and A. Yonezawa Higher-order concurrent linear logic programming In Theory and Practice of Parallel Programming 907 1995 Springer, LNCS 137 166
33. I. Cervesato, and F. Pfenning A linear logical framework In Proc. 11-th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, NJ July 1996 264 275
34. A. Aiba, K. Yokota, and H. Tsuda. Heterogeneous Distributed Cooperative Problem Solving System Helios and its Cooperation Mechanisms. International Journal of Cooperative Information Systems, 4(4):369-385, 1995.
35. C. Hankin, D. Le Metayer, and D. Sands. Refining multiset transformers. Theoretical Computer Science, to appear.
36. N. Marti-Oliet, and J. Meseguer From Petri nets to linear logic through categories: A survey Internat. J. Foundations Comp. Sci. 2 1991 297 399
37. A. Asperti A logic for concurrency Technical report, Dipartimento di Informatica, Universitá di Pisa 1987
38. C.A. Gunter, and V. Gehlot Nets as tensor theories G. De Michelis Proc. 10-th International Conference on Application and Theory of Petri Nets, Bonn 1989 174 191
39. V. Gehlot, and C.A. Gunter Normal process representatives In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia June 1990
40. N. Marti-Oliet, and J. Meseguer From Petri nets to linear logic Mathematical Structures in Computer Science 1 1991 66 101 Revised version of paper in Springer LNCS 389.
41. U. Engberg, and G. Winskel Petri nets as models of linear logic A. Arnold Proceedings of CAAP ′90. Springer LNCS 431 1990
42. P. Lincoln, J. Mitchell, A. Scedrov, and N. Shankar Decision problems for propositional linear logic Annals of Pure and Applied Logic 56 1992 239 311
43. P. Lincoln, and T. Winkler Constant-Only Multiplicative Linear Logic is NP-Complete Theoretical Computer Science 135 1994 155 169
44. P. Lincoln, and N. Shankar Proof search in first order linear logic and other cut free sequent calculi In Proc. 9-th Annual IEEE Symposium on Logic in Computer Science, Paris July 1994 282 291
45. P. Lincoln, and A. Scedrov First order linear logic without modalities is NEXPTIME-hard Theoretical Computer Science 135 1994 139 154
46. R. Alur, C. Courcoubetis, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine The algorithmic analysis of hybrid systems Theoretical Computer Science 138 1995 3 34
47. R. Alur, T.A. Henzinger, and H. Wong-Toi Symbolic analysis of hybrid systems In Proc. 37-th IEEE Conference on Decision and Control 1997
48. F. Fages, P. Ruet, and S. Soliman Phase semantics and verification of concurrent constraint programs In Proc. 13-th Annual IEEE Symposium on Logic in Computer Science, Indianapolis 1998
49. D. Miller, R. McDowell, and C. Palamidessi Encoding transition systems in sequent calculus: Preliminary report Electronic Notes in Theoretical Computer Science 3 1996
50. M.I. Kanovich Effective calculi as a technique for search reduction American Mathematical Society Translations 178 1987 133 148 148-168 1996. Russian original in: Voprosy Kibernetiki, Moscow, No. 131
51. M.I. Kanovich Effective program synthesis in computational models Journal of Logic Programming 9 1990 159 177
52. M.I. Kanovich The relational knowledge-base interpretation and feasible theorem-proving for intuitionistic propositional logic. University of Amsterdam, Institute for Logic, Language and Computation, ILLC Prepublication Series ML- December 1993 93-21