Uppaal

No author found.

Related Items (only showing first 100 items - show all)

Refinement of Timing Constraints for Concurrent Tasks with Scheduling ⋮ Quantitative Model Checking for a Controller Design ⋮ A case study on parametric verification of failure detectors ⋮ Foundations of Software Science and Computational Structures ⋮ Hybrid Systems: Computation and Control ⋮ Formal Approaches to Software Testing ⋮ Formal Approaches to Software Testing ⋮ Formal Approaches to Software Testing ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Real-Time Systems ⋮ Timed Basic Parallel Processes ⋮ Lectures on Concurrency and Petri Nets ⋮ Applications and Theory of Petri Nets 2005 ⋮ FM 2005: Formal Methods ⋮ MTCS 2000. Proceedings of the international satellite workshop on models for time-critical systems, State College, University Park, PA, USA, 26 August 2000 ⋮ Analysis of timed systems using time-abstracting bisimulations ⋮ Tools and algorithms for the construction and analysis of systems. 7th international conference, TACAS 2001, held as part of the joint European conferences on theory and practice of software, ETAPS 2001, Genova, Italy, April 2--6, 2001. Proceedings ⋮ Testing timed automata ⋮ Conformance tests for real-time systems with timed automata specifications ⋮ Modeling and verification of parallel processes. 4th Summer school, MOVEP 2000, Nantes, France, June 19--23, 2000. Revised tutorial lectures ⋮ Inference of Event-Recording Automata Using Timed Decision Trees ⋮ Formal approaches to agent-based systems. 1st international workshop, FAABS 2000, Greenbelt, MD, USA, April 5--7, 2000. Revised papers ⋮ Deciding an Interval Logic with Accumulated Durations ⋮ Constraint-based deductive model checking ⋮ Formal design and analysis of a gear controller ⋮ Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k ⋮ Using hybrid automata to support human factors analysis in a critical system ⋮ A timed verification of the IEEE 1394 Leader election protocol ⋮ Avoiding Shared Clocks in Networks of Timed Automata ⋮ Model Checking Software ⋮ Model Checking Software ⋮ Computer Aided Verification ⋮ Formal Methods for Components and Objects ⋮ CONCUR 2005 – Concurrency Theory ⋮ CONCUR 2005 – Concurrency Theory ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Modeling and Analysis of Timed Systems ⋮ Formal Approaches to Software Testing ⋮ Formal Techniques for Networked and Distributed Systems - FORTE 2003 ⋮ Integrated Formal Methods ⋮ Unnamed Item ⋮ Discussion on: ``Formal specification method for systems automation ⋮ Formal verification of mobile robot protocols ⋮ Presburger liveness verification of discrete timed automata. ⋮ Model checking mobile ad hoc networks ⋮ Forward analysis of updatable timed automata ⋮ Tools and algorithms for the construction and analysis of systems. 10th international conference, TACAS 2004, held as part of the joint conferences on theory and practice of software, ETAPS 2004, Barcelona, Spain, March 29 -- April 2, 2004. Proceedings. ⋮ Comparing model checking and logical reasoning for real-time systems ⋮ Syntax and consistent equation semantics of hybrid Chi ⋮ Formal modeling and analysis of timed systems. First international workshop, FORMATS 2003, Marseille, France, September 6--7, 2003. Revised papers. ⋮ Counterexample-guided predicate abstraction of hybrid systems ⋮ Scheduling with timed automata ⋮ Updatable timed automata ⋮ On reachability and minimum cost optimal control ⋮ Timed-pNets: a communication behavioural semantic model for distributed systems ⋮ An automated system repair framework with signal temporal logic ⋮ Automatic discovery of fair paths in infinite-state transition systems ⋮ \textsc{MightyL}: a compositional translation from MITL to timed automata ⋮ Event algebra for transition systems composition application to timed automata ⋮ Automatic verification of a lip-synchronisation protocol using UPPAAL ⋮ Time to learn -- learning timed automata from tests ⋮ Translating between models of concurrency ⋮ Timed runtime monitoring for multiparty conversations ⋮ Let's be lazy, we have time -- or, lazy reachability analysis for timed automata ⋮ A compared study of two correctness proofs for the standardized algorithm of ABR conformance ⋮ A Ravenscar-compliant run-time kernel for safety-critical systems ⋮ How to verify a Safe real-time system: The application of model checking and timed automata to the production cell case study ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Approximating labelled Markov processes ⋮ The power of reachability testing for timed automata ⋮ Uniform sampling for timed automata with application to language inclusion measurement ⋮ Generalized discrete timed automata: Decidable approximations for safety verification. ⋮ Pushdown timed automata: A binary reachability characterization and safety verification. ⋮ Controller synthesis for dynamic hierarchical real-time plants using timed automata ⋮ Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol ⋮ False loop detection in the IEEE 1394 tree identify phase ⋮ Model-checking timed automata with deadlines with Uppaal ⋮ Collaborative models for autonomous systems controller synthesis ⋮ PuRSUE -- from specification of robotic environments to synthesis of controllers ⋮ Bounded determinization of timed automata with silent transitions ⋮ Superposition as a decision procedure for timed automata ⋮ Distinguishing between communicating transactions ⋮ Computing branching distances with quantitative games ⋮ Automated temporal equilibrium analysis: verification and synthesis of multi-player games ⋮ Specification and verification of declarative open interaction models. A logic-based approach ⋮ Formal approaches to software testing. Third international workshop on formal approaches to testing of software, FATES 2003, Montreal, Quebec, Canada, October 6th, 2003. Revised papers ⋮ Dynamic partitioning in linear relation analysis: application to the verification of reactive systems ⋮ Symbolic verification and analysis of discrete timed systems ⋮ Model-checking precision agriculture logistics: the case of the differential harvest ⋮ Reachability relations of timed pushdown automata ⋮ Compact data structures and state-space reduction for model-checking real-time systems ⋮ Multi-scale verification of distributed synchronisation ⋮ Checking temporal duration properties of timed automata.

This page was built for software: Uppaal