MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Computation Sequence Sets." – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 15 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Lightweight defect localization for java  
  • by Valentin Dallmeier, Christian Lindig, Andreas Zeller — 2005 — In Proceedings of the 19th European Conference on Object-Oriented Programming
  • … of the paper, we use P(T ) to denote the sequence set computed from T , not mentioning the fixed k explicitly…
  • Cited by 21 (4 self)Add To MetaCart
  • Model checking timed automata  
  • by Sergio Yovine — 1998 — In European Educational Forum: School on Embedded Systems
  • …. Forward traversal. This method consists in computing the sequence of sets of representativesF0F1…
  • Cited by 50 (1 self)Add To MetaCart
  • J.J.Ch.: Dynamic logic for plan revision in intelligent agents  
  • by M. Birna Van Riemsdijk, Frank S. De Boer, M. Birna, Riemsdijk Frank, S. Boer, John-jules Ch. Meyer, John-jules Ch. Meyer — Computational logic in multiagent systems: fifth international workshop (CLIMA’04). Volume 3487 of LNAI. (2005) 16–32
  • … configuration. Definition 9 (computation sequences) The set Σ + of finite computation sequences is defined as {σ…
  • Cited by 1 (0 self)Add To MetaCart
  • Semantics of Plan Revision in Intelligent  
  • by Agents Birna Van, M. Birna Van Riemsdijk, John-jules Ch. Meyer, Frank S. De Boer, M. Birna, Riemsdijk John-jules, Ch. Meyer, Frank S. Boer — 2004 — Theoretical Computer Science 351(2) (2006) 240–257 Special issue of Algebraic Methodology and Software Technology (AMAST’04
  • … the operational semantics. Definition 16. (computation sequences) The sets S + and S ∞ of respectively finite…
  • Add To MetaCart
  • Stability and Sequentiality in Dataflow Networks  
  • by Prakash Panangaden, Vasant Shanbhogue, Eugene W. Stark — 1990 — Proceedings of ICALP’90, Lecture Notes in Computer Science 443
  • …" to be an equivalence class of computation sequences. The set of all computations of an automaton starting from…
  • Cited by 9 (2 self)Add To MetaCart
  • Stability and Sequentiality in Dataflow Networks  
  • by Prakash Panangaden Vasant, Vasant Shanbhogue, Eugene W. Stark — 1990 — Proceedings of ICALP’90, Lecture Notes in Computer Science 443
  • …, and we define a "computation" to be an equivalence class of computation sequences. The set of all…
  • Add To MetaCart
  • The Common Fragment of CTL and LTL  
  • by Monika Maidl — 2000 — In IEEE Symposium on Foundations of Computer Science
  • … system can be considered as a computation tree, but also a as a set of computation sequences. The set
  • Cited by 23 (1 self)Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB