MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Mihalis Yannakakis – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 31 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Yannakakis:1981:CMF  
  • by Yan Mihalis Yannakakis
  • … Wimmer. On the dimension of biinfinite systems. SIAM Journal on Algebraic and Discrete Methods, 5(1):9--10, March 1984. CODEN SJAMDU. ISSN 0196-5212. Wimmer:1984:DBI [Wim84b] Harald K. Wimmer. On the dimension of bi-infinite systems. SIAM Journal on Algebraic and Discrete Methods, 5(1):9--10, 19…
  • Add To MetaCart
  • Efficiently Computing Succinct Trade-off Curves  
  • by Sergei Vassilvitskii, Mihalis Yannakakis — 2004 — In Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP’04). LNCS 3142
  • …Abstract. Trade-off (aka Pareto) curves are typically used to represent the trade-off among different objectives in multiobjective optimization problems. Although trade-off curves are exponentially large for typical combinatorial optimization problems (and infinite for continuous problems), it was o…
  • Cited by 4 (0 self)Add To MetaCart
  • Algorithmic verification of recursive probabilistic state machines  
  • by Kousha Etessami, Mihalis Yannakakis — 2005 — In Proc. 11th TACAS
  • …Abstract. Recursive Markov Chains (RMCs) ([EY04]) are a natural abstract model of procedural probabilistic programs and related systems involving recursion and probability. They succinctly define a class of denumerable Markov chains that generalize multi-type branching (stochastic) processes. In thi…
  • Cited by 18 (5 self)Add To MetaCart
  • Recursive Markov decision processes and recursive stochastic games  
  • by Kousha Etessami, Mihalis Yannakakis — 2005 — In Proc. of 32nd Int. Coll. on Automata, Languages, and Programming (ICALP’05
  • …Abstract. We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), and study the decidability and complexity of algorithms for their analysis and verification. These models extend Recursive Markov Chains (RMCs), introduced in [EY05a,EY05b] as a natural …
  • Cited by 18 (5 self)Add To MetaCart
  • Model checking of message sequence charts  
  • by Rajeev Alur, Mihalis Yannakakis — 1999
  • …Abstract. Scenario-based speci cations such as message sequence charts (MSC) o er an intuitive and visual way of describing design requirements. Such speci cations focus on message exchanges among communicating entities in distributed software systems. Structured speci cations such as MSC-graphs and…
  • Cited by 101 (6 self)Add To MetaCart
  • Model Checking of Hierarchical State Machines  
  • by Rajeev Alur, Mihalis Yannakakis — 1998 — In Symposium on the Foundations of Software Engineering
  • …Model checking is emerging as a practical tool for detecting logical errors in early stages of system design. We investigate the model checking of hierarchical (nested) systems, i.e. finite state machines whose states themselves can be other machines. This nesting ability is common in various softwa…
  • Cited by 54 (8 self)Add To MetaCart
  • Principles And Methods Of Testing Finite State Machines - A Survey  
  • by David Lee, Mihalis Yannakakis — 1996 — Proceedings of the IEEE
  • …With advanced computer technology, systems are getting larger to fulfill more complicated tasks, however, they are also becoming less reliable. Consequently, testing is an indispensable part of system design and implementation; yet it has proved to be a formidable task for complex systems. This moti…
  • Cited by 159 (10 self)Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB