Kronos

swMATH1270MaRDI QIDQ14010FDOQ14010

Author name not available (Why is that?)

Described by source

• Kronos: A verification tool for real-time systems

Cited In (only showing first 100 items - show all)

• A survey of timed automata for the development of real-time systems
• Model checking weighted integer reset timed automata
• Timed recursive state machines: expressiveness and complexity
• Adding Invariants to Event Zone Automata
• Efficient Detection of Zeno Runs in Timed Automata
• Scheduling with timed automata
• Formal Modeling and Analysis of Timed Systems
• Interrupt timed automata: verification and expressiveness
• Semantics and pragmatics of real-time maude
• Design and verification of long-running transactions in a timed framework
• Lectures on Concurrency and Petri Nets
• On using priced timed automata to achieve optimal scheduling
• Automated Technology for Verification and Analysis
• Event-clock automata: a determinizable class of timed automata
• Checking timed Büchi automata emptiness on simulation graphs
• Efficient on-the-fly algorithm for checking alternating timed simulation
• Title not available (Why is that?)
• Robust model-checking of timed automata via pumping in channel machines
• Robust reachability in timed automata: a game-based approach
• Testing timed automata
• Linear parametric model checking of timed automata
• Stochastic games for verification of probabilistic timed automata
• Coarse abstractions make Zeno behaviours difficult to detect
• Pushdown timed automata: A binary reachability characterization and safety verification.
• Title not available (Why is that?)
• Zone-Based Universality Analysis for Single-Clock Timed Automata
• Specification of real-time and hybrid systems in rewriting logic
• Improvements for the Symbolic Verification of Timed Automata
• Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
• On reachability and minimum cost optimal control
• Reachability analysis for timed automata using max-plus algebra
• Verification of timed automata via satisfiability checking
• Hybridization methods for the analysis of nonlinear systems
• Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
• Updatable timed automata
• A concurrency-preserving translation from time Petri nets to networks of timed automata
• State space computation and analysis of Time Petri Nets
• Performance analysis of probabilistic timed automata using digital clocks
• Checking timed Büchi automata emptiness efficiently
• Almost ASAP semantics: from timed models to timed implementations
• Model checking of time Petri nets using the state class timed automaton
• Model checking of biological systems
• Automatic verification of real-time systems with discrete probability distributions.
• Title not available (Why is that?)
• Verification of logic controllers for continuous plants using timed condition/event-system models
• Optimal reachability for multi-priced timed automata
• Symbolic reachability computation for families of linear vector fields
• Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
• How to stop time stopping
• CADP 2010: a toolbox for the construction and analysis of distributed processes
• When are timed automata weakly timed bisimilar to time Petri nets?
• Hybrid control of networked embedded systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• The Unmet Challenge of Timed Systems
• Tools and Algorithms for the Construction and Analysis of Systems
• Priced timed automata: theory and tools
• Generalized discrete timed automata: Decidable approximations for safety verification.
• The power of reachability testing for timed automata
• Can decision diagrams overcome state space explosion in real-time verification?
• Efficient emptiness check for timed Büchi automata
• Learning of event-recording automata
• Model checking for probabilistic timed automata
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Robust reachability in timed automata and games: a game-based approach
• On regions and zones for event-clock automata
• A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets
• Symbolic model checking for probabilistic timed automata
• Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k
• Rewriting modulo SMT and open system analysis
• Rewriting modulo SMT and open system analysis
• Constructing invariants for hybrid systems
• Decidable integration graphs.
• Hybrid automata, reachability, and systems biology
• Detecting synchronisation of biological oscillators by model checking
• Hybrid systems: From verification to falsification by combining motion planning and discrete search
• Analysis of timed systems using time-abstracting bisimulations
• Hybrid Automata in Systems Biology: How Far Can We Go?
• A partial order semantics approach to the clock explosion problem of timed automata
• Timed verification of the generic architecture of a memory circuit using parametric timed automata
• A quadratic-time DBM-based successor algorithm for checking timed automata
• Verification of asynchronous circuits using timed automata
• Title not available (Why is that?)
• Event clock automata: from theory to practice
• Title not available (Why is that?)
• Automated verification of an audio-control protocol using UPPAAL
• Model-checking timed temporal logics
• Forward analysis of updatable timed automata
• Title not available (Why is that?)
• Constructing test automata from graphical real-time requirements
• Title not available (Why is that?)
• Topologies, Continuity and Bisimulations
• Title not available (Why is that?)
• Explaining safety violations in real-time systems
• Timed CTL model checking in Real-Time Maude
• A Kleene-Schützenberger theorem for weighted timed automata
• Conformance testing for real-time systems
• Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
• Applications and Theory of Petri Nets 2004

This page was built for software: Kronos