( en | de | ru )

 

Disambiguation of "Sistla, A. Prasad"

Author of the publication

copydeleteadd this publication to your clipboard
Quantitative Temporal Reasoning.

, , , and . CAV, volume 531 of Lecture Notes in Computer Science, page 136-145. Springer, (1990)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Venkata Subbarayudu Sistla

Sharad Prasad

Kumkum Prasad

Athul Prasad

Prasad Samarakoon

 

Other publications of authors with the same name

Using Temporal Logic for Automatic Verification of Finite State Systems., , , and . Logics and Models of Concurrent Systems, volume 13 of NATO ASI Series, page 3-26. Springer, (1984)Temporal Conditions with Retroactive and Proactive Updates., , and . ARTDB, page 122-141. Springer, (1995)Querying the Uncertain Position of Moving Objects., , , and . Temporal Databases, Dagstuhl, volume 1399 of Lecture Notes in Computer Science, page 310-337. Springer, (1997)Probabilistic Automata with Isolated Cut-Points., , and . MFCS, volume 8087 of Lecture Notes in Computer Science, page 254-265. Springer, (2013)Decidable and Expressive Classes of Probabilistic Automata., , , and . FoSSaCS, volume 9034 of Lecture Notes in Computer Science, page 200-214. Springer, (2015)Approximating Probabilistic Automata by Regular Languages., , and . CSL, volume 119 of LIPIcs, page 14:1-14:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Reasoning in a Restricted Temporal Logic, and . Inf. Comput., 102 (2): 167-195 (February 1993)Deciding Differential Privacy for Programs with Finite Inputs and Outputs., , , , and . LICS, page 141-154. ACM, (2020)Automatic Verification of Finite State Concurrent Systems Using Temporal Logic Specifications: A Practical Approach., , and . POPL, page 117-126. ACM Press, (1983)Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach., and . ACM Trans. Program. Lang. Syst., 19 (4): 617-638 (1997)