Shrinking timed automata

DOI10.1016/j.ic.2014.01.002zbMath1285.68090MaRDI QIDQ2637311

Patricia Bouyer, Nicolas Markey, Ocan Sankur

Publication date: 11 February 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.002

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

Unnamed Item

Uses Software

• Kronos
• Giotto

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of a clock synchronization protocol for wireless sensor networks
• Robust safety of timed automata
• Automatic verification of a lip-synchronisation protocol using UPPAAL
• A theory of timed automata
• PLC-automata: A new class of implementable real-time automata
• Dynamical properties of timed automata
• Almost ASAP semantics: from timed models to timed implementations
• A lattice-theoretical fixpoint theorem and its applications
• Robust Controller Synthesis in Timed Automata
• Quantitative Robustness Analysis of Flat Timed Automata
• Untimed Language Preservation in Timed Systems
• Timed Automata Can Always Be Made Implementable
• Solving Fixed-Point Equations by Derivation Tree Analysis
• Robust Reachability in Timed Automata: A Game-Based Approach
• Robust Model-Checking of Timed Automata via Pumping in Channel Machines
• Dynamical Properties of Timed Automata Revisited
• Model Checking Timed Automata with Priorities Using DBM Subtraction
• Symbolic Robustness Analysis of Timed Automata
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• CONCUR 2004 - Concurrency Theory
• Robust Analysis of Timed Automata Via Channel Machines
• Lectures on Concurrency and Petri Nets
• Timed Parity Games: Complexity and Robustness
• Formal Modeling and Analysis of Timed Systems
• Analysis of timed systems using time-abstracting bisimulations