Undecidability Results for Timed Automata with Silent Transitions

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Fundamenta Informaticae

• Publication date

  2009-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.3233/FI-2009-0063
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Universality Analysis for One-Clock Timed Automata

  2008cited by this paper
• Undecidability of Universality for Timed Automata with Minimal Resources

  2007cited by this paper
• Undecidable Problems About Timed Automata

  2006influential reference
• On Continuous Timed Automata with Input-Determined Guards

  2006cited by this paper
• Alternating timed automata

  2005cited by this paper
• Decidability and Complexity Results for Timed Automata via Channel Machines

  2005cited by this paper
• Timed Shuffle Expressions

  2005cited by this paper
• On the language inclusion problem for timed automata: closing a decidability gap

  2004cited by this paper
• On Recognizable Timed Languages

  2004influential reference
• Decision Problems for Timed Automata: A Survey

  2004cited by this paper
• Challenges in Timed Languages: from applied theory to basic theory (Column: Concurrency)

  2004cited by this paper
• Folk Theorems on the Determinization and Minimization of Timed Automata

  2003cited by this paper
• An algebraic approach to data languages and timed languages

  2003cited by this paper
• A logical characterization of data languages

  2002cited by this paper
• Timed regular expressions

  2002cited by this paper
• Real-Time Automata

  2001cited by this paper
• A Kleene/Büchi-like Theorem for Clock Languages

  2001cited by this paper
• A Logical Characterisation of Event Recording Automata

  2000cited by this paper
• Kleene Theorems for Event-Clock Automata

  1999cited by this paper
• Characterization of the Expressive Power of Silent Transitions in Timed Automata

  1998influential reference
• The Expressive Power of Clocks

  1995cited by this paper
• A Determinizable Class of Timed Automata

  1994cited by this paper
• A Theory of Timed Automata

  1994cited by this paper
• Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

  1994cited by this paper
• Automata For Modeling Real-Time Systems

  1990cited by this paper
• First case.

  1987cited by this paper
• SECOND CASE

  1916cited by this paper

• Enforcement of Opacity for Interval Weighted Discrete-Event System by Supervisory Control

  2026cites this paper
• State estimation for constant-time labeled automata under dense time

  2024cites this paper
• Equivalence checking and intersection of deterministic timed finite state machines

  2021cites this paper
• Model Checking Real-Time Systems

  2018cites this paper
• Closedness of the category of liminf complete fuzzy orders

  2016cites this paper
• A menagerie of timed automata

  2014cites this paper
• Petri nets for modeling robots

  2014cites this paper
• Discrete timed Petri nets

  2013cites this paper
• An Introduction to Timed Automata

  2013cites this paper
• The Right Timing: Reflections on the Modeling and Analysis of Time

  2013cites this paper
• Study of concurrency in real-time distributed systems. (La concurrence dans les systèmes temps-réel distribués)

  2012cites this paper
• A duality of generalized metric spaces

  2011cites this paper
• Supervision of distributed systems using constrained unfoldings of timed models. (Supervision de systèmes répartis utilisant des dépliages avec contraintes de modèles temporisés)

  2011cites this paper
• The formal ball model for -categories

  2010cites this paper
• Formal language properties of hybrid systems with strong resets

  2010cites this paper
• Analysis and applications of timed service protocols

  2010cites this paper
• Team MExICo Modelling and Exploitation of Interaction and Concurrency

  2010cites this paper
• Utilization of timed automata as a verification tool for real-time security protocols

  2010cites this paper
• The limit–colimit coincidence theorem for -categories

  2010cites this paper
• Removing All Silent Transitions from Timed Automata

  2009cites this paper
• Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions

  2009cites this paper
• Model based analysis of Time-aware Web service interactions

  2008cites this paper
• Timed Automata with Integer Resets: Language Inclusion and Expressiveness

  2008cites this paper