Jump to content

Fair computational tree logic

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Grokmenow (talk | contribs) at 15:21, 26 January 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Fair Computational tree logic is conventional Computational tree logiclink Computational tree logic studied with explicit fairness constraints.

References

References

  • Emerson, E. A. and Halpern, J. Y. (1985). "Decision procedures and expressiveness in the temporal logic of branching time". Journal of Computer and System Sciences. 30 (1): 1–24.{{cite journal}}: CS1 maint: multiple names: authors list (link)
  • Clarke, E. M., Emerson, E. A., and Sistla, A. P. (1986). "Automatic verification of finite-state concurrent systems using temporal logic specifications". ACM Transactions on Programming Languages and Systems. 8 (2): 244–263.{{cite journal}}: CS1 maint: multiple names: authors list (link)
Retrieved from "https://en.wikipedia.org/w/index.php?title=Fair_computational_tree_logic&oldid=103388425"