Abstract
In this paper, we use the constructs of branching temporal logic to formalize reasoning about a class of general flow systems, including discretetime transition systems, continuous-time differential inclusions, and hybrid-time systems such as hybrid automata. We introduce Full General Flow Logic, GFL*, which has essentially the same syntax as the well-known Full Computation Tree Logic, CTL*, but generalizes the semantics to general flow systems over arbitrary time-lines. We propose an axiomatic proof system for GFL* and establish its soundness w.r.t. the general flow semantics. © Springer-Verlag 2004.
Cite
CITATION STYLE
Davoren, J. M., Coulthard, V., Markey, N., & Moor, T. (2004). Non-deterministic temporal logics for general flow systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 280–295. https://doi.org/10.1007/978-3-540-24743-2_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
