Formal Methods for the Design of Real-Time Systems
From MaRDI portal
Publication:5494303
DOI10.1007/b110123zbMath1105.68057OpenAlexW36240330MaRDI QIDQ5494303
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b110123
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (33)
Timed recursive state machines: expressiveness and complexity ⋮ Learning One-Clock Timed Automata ⋮ Exact Incremental Analysis of Timed Automata with an SMT-Solver ⋮ Model measuring for discrete and hybrid systems ⋮ On the Modeling of Sequential Reactive Systems by Means of Real Time Automata ⋮ On clock-aware LTL parameter synthesis of timed automata ⋮ On the complexity of verification of time-sensitive distributed systems ⋮ Minimization of the number of clocks for timed scenarios ⋮ Untangling the graphs of timed automata to decrease the number of clocks ⋮ A survey of timed automata for the development of real-time systems ⋮ The tail-recursive fragment of timed recursive CTL ⋮ Testing membership for timed automata ⋮ Equivalence checking and intersection of deterministic timed finite state machines ⋮ An efficient customized clock allocation algorithm for a class of timed automata ⋮ Asynchronous correspondences between hybrid trajectory semantics ⋮ A Kleene-Schützenberger theorem for weighted timed automata ⋮ A rewriting framework and logic for activities subject to regulations ⋮ Efficient emptiness check for timed Büchi automata ⋮ Some Recent Results in Metric Temporal Logic ⋮ Timed Automata with Integer Resets: Language Inclusion and Expressiveness ⋮ Parameter synthesis for hierarchical concurrent real-time systems ⋮ Finding minimum and maximum termination time of timed automata models with cyclic behaviour ⋮ Unifying behavioral equivalences of timed transition systems ⋮ A menagerie of timed automata ⋮ MSO logics for weighted timed automata ⋮ Formal language properties of hybrid systems with strong resets ⋮ A Kleene-Schützenberger Theorem for Weighted Timed Automata ⋮ Unnamed Item ⋮ An Introduction to Timed Automata ⋮ Checking Timed Büchi Automata Emptiness Using LU-Abstractions ⋮ On the Supports of Recognizable Timed Series ⋮ Decision problems for lower/upper bound parametric timed automata ⋮ On the determinization of event-clock input-driven pushdown automata
Uses Software
This page was built for publication: Formal Methods for the Design of Real-Time Systems
