The following pages link to Uppaal in a nutshell (Q1856195):
Displaying 50 items.
- Uppaal (Q16871) (← links)
- Timed recursive state machines: expressiveness and complexity (Q264999) (← links)
- Formalising concurrent UML state machines using coloured Petri nets (Q315307) (← links)
- Rewriting modulo SMT and open system analysis (Q347384) (← links)
- MR4UM: a framework for adding fault tolerance to UML state diagrams (Q391245) (← links)
- Efficiently identifying deterministic real-time automata from labeled data (Q420918) (← links)
- A concurrency-preserving translation from time Petri nets to networks of timed automata (Q453542) (← links)
- Control: a perspective (Q463779) (← links)
- Integrating deployment architectures and resource consumption in timed object-oriented models (Q478391) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Runtime enforcement of timed properties revisited (Q487258) (← links)
- Parameter synthesis for hierarchical concurrent real-time systems (Q488231) (← links)
- Symbolic optimal expected time reachability computation and controller synthesis for probabilistic timed automata (Q517046) (← links)
- Compositional schedulability analysis of real-time actor-based systems (Q530212) (← links)
- Optimal deployment of eventually-serializable data services (Q545558) (← links)
- Timed modal logics for real-time systems. Specification, verification and control (Q548704) (← links)
- The efficiency of identifying timed automata and the power of clocks (Q553334) (← links)
- Aspects of availability. Enforcing timed properties to prevent denial of service (Q608233) (← links)
- Validation and verification of web services choreographies by using timed automata (Q615897) (← links)
- Deadlock and starvation free reentrant readers-writers: a case study combining model checking with theorem proving (Q617922) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Bisimulation conversion and verification procedure for goal-based control systems (Q633304) (← links)
- Towards verification of computation orchestration (Q736807) (← links)
- Checking timed Büchi automata emptiness efficiently (Q816203) (← links)
- Timed hyperproperties (Q821560) (← links)
- Explaining safety violations in real-time systems (Q832041) (← links)
- \textsf{IMITATOR} 3: synthesis of timing parameters beyond decidability (Q832203) (← links)
- Fast zone-based algorithms for reachability in pushdown timed automata (Q832208) (← links)
- Verifying distributed real-time properties of embedded systems via graph transformations and model checking (Q853626) (← links)
- On using priced timed automata to achieve optimal scheduling (Q853729) (← links)
- Performance analysis of probabilistic timed automata using digital clocks (Q853731) (← links)
- Analysis of a biphase mark protocol with Uppaal and PVS (Q855013) (← links)
- Model checking of time Petri nets using the state class timed automaton (Q859736) (← links)
- Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty (Q862989) (← links)
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- An engineering process for the verification of real-time systems (Q877159) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Models and formal verification of multiprocessor system-on-chips (Q953526) (← links)
- A process algebraic framework for specification and validation of real-time systems (Q968306) (← links)
- Refinement and verification in component-based model-driven design (Q1004291) (← links)
- M-nets: a survey (Q1006339) (← links)
- Timed verification of the generic architecture of a memory circuit using parametric timed automata (Q1028737) (← links)
- Automatic symmetry detection for Promela (Q1040774) (← links)
- The power of reachability testing for timed automata (Q1399974) (← links)
- Generalized discrete timed automata: Decidable approximations for safety verification. (Q1401259) (← links)
- Pushdown timed automata: A binary reachability characterization and safety verification. (Q1401320) (← links)
- Automatic verification of real-time systems with discrete probability distributions. (Q1603709) (← links)
- Specification of real-time and hybrid systems in rewriting logic (Q1608921) (← links)
- Bounded determinization of timed automata with silent transitions (Q1699228) (← links)
- A brief history of process algebra (Q1781995) (← links)
