scientific article; zbMATH DE number 1337733
From MaRDI portal
Publication:4264103
zbMATH Open0930.68077MaRDI QIDQ4264103FDOQ4264103
Authors: Béatrice Bérard, Volker Diekert, Paul Gastin, A. Petit 
Publication date: 16 September 1999
Title of this publication is not available (Why is that?)
Recommendations
- On the power of non-observable actions in timed automata
- Removing \(\epsilon \)-transitions in timed automata
- Removing all silent transitions from timed automata
- Undecidability Results for Timed Automata with Silent Transitions
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
Cited In (44)
- A survey of timed automata for the development of real-time systems
- Timed hyperproperties
- Model-based verification, optimization, synthesis and performance evaluation of real-time systems
- Compositional schedulability analysis of real-time actor-based systems
- Timed recursive state machines: expressiveness and complexity
- Reachability in timed automata with diagonal constraints
- On the initialization of clocks in timed formalisms
- Folk theorems on the determinization and minimization of timed automata
- Interrupt timed automata: verification and expressiveness
- Conformance testing for real-time systems
- Timed automata with non-instantaneous actions
- Configurable verification of timed automata with discrete variables
- Timed automata and additive clock constraints
- Removing all silent transitions from timed automata
- Reachability relations of timed pushdown automata
- Removing \(\epsilon \)-transitions in timed automata
- Distributed event clock automata (extended abstract)
- SetExp: a method of transformation of timed automata into finite state automata
- Updatable timed automata
- On the optimal reachability problem of weighted timed automata
- Reachability in timed counter systems
- When are timed automata weakly timed bisimilar to time Petri nets?
- \(\varepsilon\)-transitions in concurrent timed automata
- Model Checking Real-Time Systems
- Timed substitutions for regular signal-event languages
- Model checking for probabilistic timed automata
- Parameter synthesis for hierarchical concurrent real-time systems
- Optimal controller synthesis for timed systems
- Concurrency in timed automata
- Timed Automata with Integer Resets: Language Inclusion and Expressiveness
- Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
- Interrupt Timed Automata
- Exact Incremental Analysis of Timed Automata with an SMT-Solver
- A menagerie of timed automata
- Formal language properties of hybrid systems with strong resets
- Equivalences for silent transitions in probabilistic systems (extended abstract)
- Efficient CTMC Model Checking of Linear Real-Time Objectives
- Undecidability Results for Timed Automata with Silent Transitions
- Equivalence checking and intersection of deterministic timed finite state machines
- Computing the bandwidth of meager timed automata
- Bounded determinization of timed automata with silent transitions
- Bounded determinization of timed automata with silent transitions
- An introduction to timed automata
- On the power of non-observable actions in timed automata
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4264103)
