Branching vs. Linear Time: Final Showdown
By Moshe Y. Vardi. International Conference on Tools and Algorithms for Construction and Analysis of Systems, 2001
301 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Software
View Paper: https://www.semanticscholar.org/paper/a59fc8afda29d921f243f335685fcd2c79ec9de2
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Axel van Lamsweerde
- Emmanuel Letier
- Wiebe van der Hoek
- Michael J. Wooldridge
- Carles Sierra
- Ludovic Piètre-Cambacédès
- Barbara Kordy
- Patrick Schweitzer
In Computational Theory and Mathematics
In Software
- Axel van Lamsweerde
- Emmanuel Letier
- Wiebe van der Hoek
- Michael J. Wooldridge
- Betty H. C. Cheng
- Carles Sierra
Citations in the corpus
- Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications (2003, background): “It is well-known that the branching temporal logic ctl lacks expressive power | fairness, for example, cannot be expressed in \vanilla" ctl (see e.g., [ 33 ] for a recent discussion on the relative merits of ctl versus other temporal logics).”
- Reasoning about partial goal satisfaction for requirements and design engineering (2004, background): “In principle, such systematic derivation is hampered by the incomparability in expressive power of the linear-time and branching-time paradigms [ 32 ].”