MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Stavros Tripakis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 49 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Undecidable Problems of Decentralized Observation and Control  
  • by Stavros Tripakis — 2001
  • …We introduce a new notion of decentralized observability for discrete-event systems, which we call joint observability. We prove that checking joint observability of a regular language w.r.t. one observer is decidable, whereas for two (or more) observers the problem becomes undecidable. Based on thi…
  • Cited by 16 (2 self) – Add To MetaCart
  • Folk theorems on the determinization and minimization of timed automata  
  • by Stavros Tripakis — 2003 — In Proceedings of FORMATS 03
  • …www-verimag.imag.fr Abstract. Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not algorithmically solvable, if we require not just a yes/no answer, but also a witness. Mini…
  • Cited by 4 (1 self) – Add To MetaCart
  • Checking Timed Büchi Automata Emptiness on Simulation Graphs  
  • by Stavros Tripakis — 2006
  • …Abstract. This paper completes the work of [5,13] on checking language emptiness of timed Büchi automata efficiently. In [5,13] we showed how to check emptiness on the region-closed simulation graph. However, the latter is not used in practice, since its nodes are non-convex, thus, not easily repres…
  • Cited by 2 (0 self) – Add To MetaCart
  • Automated Module Composition  
  • by Stavros Tripakis — 2003 — Int. Conf. on Tools and Algor. for Constr. and Analysis of Systems
  • …We define an abstract problem of module composition (MC). In MC, modules are seen as black boxes with input and output ports. The objective is, given a set of available modules, to instantiate some of them (one or more times) and connect their ports, in order to obtain a target module. A general …
  • Cited by 1 (0 self) – Add To MetaCart
  • Timed Diagnostics for Reachability Properties  
  • by Stavros Tripakis — 1999 — In Proc. TACAS'99, volume 1579 of LNCS
  • …. We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state changes and the exact amount of time passing at each state. Our algorithm solves the problem in O(l \Delta n 2 ) time, whe…
  • Cited by 3 (0 self) – Add To MetaCart
  • Minimization of Timed Systems  
  • by Stavros Tripakis — 1998
  • …this report is organized as follows : in chapter 2 we introduce TA as a model of timed systems. Chapter 3 reviews the theoretical basis of our work, and presents the basic results of [BFH…
  • Cited by 3 (0 self) – Add To MetaCart
  • Checking Timed Büchi Automata Emptiness Efficiently  
  • by Stavros Tripakis — 2005 — Formal Methods in System Design
  • …Abstract. This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic because it uses the simulation graph (instead of the region graph). It is on-the-fly because the simulation graph is generated during the test for emptiness. We have i…
  • Cited by 8 (2 self) – Add To MetaCart
  • Verifying Progress in Timed Systems  
  • by Stavros Tripakis — 1999 — In ARTS'99
  • …In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (absence of deadlocks) and time progress (absence of deadlocks and timelocks) and give static sufficient conditions for a…
  • Cited by 7 (1 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB