| MEENAKSHI, B. AND RAMANUJAM, R. 2000. Reasoning about message passing in finite state environments. In International Colloquium on Automata, Languages and Programming (ICALP'00). Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, 487--498. |
....out by Madhusudan and Meenakshi [16] it is desirable to find the existence of temporal logics interpreted over ECMSC words that are trace closed in some sense, i.e. whose formulas are satisfied by either all linearizations of an ECMSC or none of them. First attempts in this regard were done in [18] and [4] We will now establish a strong connection between ECMSCs and the theory of Mazurkiewicz traces, which subsequently yields trace closed logics as well as corresponding decision procedures in a natural manner. With respect to #, the dependence relation D(#) # # ) is given by (#, ....
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proc. of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), LNCS 1853. Springer, 2000.
....out by Madhusudan and Meenakshi [14] it is desirable to find the existence of temporal logics interpreted over ECMSC words that are trace closed in some sense, i.e. whose formulas are satisfied by either all linearizations of an ECMSC or none of them. First attempts in this regard were done in [15] and [4] We will now establish a strong connection between ECMSCs and the theory of Mazurkiewicz traces, which subsequently yields trace closed logics as well as corresponding decision procedures in a natural manner. With respect to #, the dependence relation D(#) # # ) is given by (#, ....
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS. Springer, 2000.
No context found.
MEENAKSHI, B. AND RAMANUJAM, R. 2000. Reasoning about message passing in finite state environments. In International Colloquium on Automata, Languages and Programming (ICALP'00). Lecture Notes in Computer Science, vol. 1853. Springer-Verlag, 487--498.
No context found.
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of Lecture Notes in Computer Science, pages 487--498. Springer-Verlag, 2000.
No context found.
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of LNCS.
No context found.
B. Meenakshi and R. Ramanujam. Reasoning about message passing in finite state environments. In International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of Lecture Notes in Computer Science, pages 487--498. Springer-Verlag, 2000.
No context found.
Meenakshi, B., Ramanujam, R.: Reasoning about message passing in finite state environments. In Montanari, U., Rolim, J.D.P., Welzl, E., eds.: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000. Volume 1853 of LNCS., Geneva, Springer-Verlag (2000) 487--498
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC