Content deleted Content added
Citation bot (talk | contribs) Add: s2cid. | Use this bot. Report bugs. | Suggested by Whoop whoop pull up | #UCB_webform 127/321 |
m Open access bot: doi updated in citation with #oabot. |
||
| (One intermediate revision by one other user not shown) | |||
Line 1:
{{No footnotes|date=April 2023}}
'''Fair computational tree logic''' is conventional [[computational tree logic]] studied with explicit fairness constraints.
Line 38 ⟶ 39:
==References==
* {{cite journal |author1=Emerson, E. A. |author2=Halpern, J. Y. |author2link = Joseph Halpern| title=Decision procedures and expressiveness in the temporal logic of branching time | journal=Journal of Computer and System Sciences| year=1985| volume=30 | issue=1 | pages=1–24 | doi=10.1016/0022-0000(85)90001-7| doi-access=free}}
* {{cite journal |author1=Clarke, E. M. |author1link = Edmund M. Clarke|author2=Emerson, E. A. |author3= Sistla, A. P. |name-list-style=amp | title=Automatic verification of finite-state concurrent systems using temporal logic specifications | journal=ACM Transactions on Programming Languages and Systems| year=1986| volume=8 | issue=2 | pages=244–263 | doi=10.1145/5397.5399| s2cid=52853200 | doi-access=free }}
[[Category:Temporal logic]]
| |||