Pages that link to "Item:Q5494310"
From MaRDI portal
The following pages link to Formal Methods for the Design of Real-Time Systems (Q5494310):
Displaying 50 items.
- Uppaal (Q16871) (← links)
- Modelling and verification of weighted spiking neural systems (Q264538) (← links)
- Verification of graph grammars using a logical approach (Q436370) (← links)
- Model checking time-dependent system specifications using time stream Petri nets and \texttt{UPPAAL} (Q440685) (← links)
- Improving active Mealy machine learning for protocol conformance testing (Q479471) (← links)
- A formal approach to the WCRT analysis of multicore systems with memory contention under phase-structured task sets (Q488240) (← links)
- Structural transformations for data-enriched real-time systems (Q493518) (← links)
- Finding minimum and maximum termination time of timed automata models with cyclic behaviour (Q507600) (← links)
- Scenario-based verification of real-time systems using UPPAAL (Q633291) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Extended beam search for non-exhaustive state space analysis (Q652163) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Analysing neurobiological models using communicating automata (Q736844) (← links)
- A situation-based multi-agent architecture for handling misunderstandings in interactions (Q747513) (← links)
- Analysis of a clock synchronization protocol for wireless sensor networks (Q764293) (← links)
- An integer static analysis for better extrapolation in Uppaal (Q832038) (← links)
- Modular design of real-time systems using hierarchical communicating real-time state machines (Q853606) (← links)
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude (Q862853) (← links)
- Distributed simulation of modular time Petri nets: An approach and a case study exploiting temporal uncertainty (Q862989) (← links)
- Axiomatisation and decidability of multi-dimensional Duration Calculus (Q868026) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Accelerating worst case execution time analysis of timed automata models with cyclic behaviour (Q903501) (← links)
- Models and formal verification of multiprocessor system-on-chips (Q953526) (← links)
- Detecting synchronisation of biological oscillators by model checking (Q969176) (← links)
- Investigating the usability of real-time scheduling theory with the Cheddar project (Q1033676) (← links)
- Event algebra for transition systems composition application to timed automata (Q1656550) (← links)
- Distinguishing between communicating transactions (Q1706141) (← links)
- An abstract model for proving safety of autonomous urban traffic (Q1786569) (← links)
- Model-checking timed automata with deadlines with Uppaal (Q1941900) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Ensuring liveness properties of distributed systems: open problems (Q2011206) (← links)
- A process calculus BigrTiMo of mobile systems and its formal semantics (Q2026376) (← links)
- Dynamics of reputation in mobile agents systems and weighted timed automata (Q2064524) (← links)
- \textsc{LTL} falsification in infinite-state systems (Q2105460) (← links)
- A lazy query scheme for reachability analysis in Petri nets (Q2117184) (← links)
- Automatic discovery of fair paths in infinite-state transition systems (Q2147176) (← links)
- Verifying autonomous systems (Q2165494) (← links)
- PuRSUE -- from specification of robotic environments to synthesis of controllers (Q2198133) (← links)
- Proving the existence of fair paths in infinite-state systems (Q2234061) (← links)
- A compositional modelling and analysis framework for stochastic hybrid systems (Q2248073) (← links)
- Efficient controller synthesis for a fragment of \(\mathrm{MTL}_{0,\infty}\) (Q2249659) (← links)
- Input urgent semantics for asynchronous timed session types (Q2329441) (← links)
- A flattening algorithm for hierarchical timed automata (Q2332032) (← links)
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs (Q2348797) (← links)
- Computational techniques for reachability analysis of Max-Plus-Linear systems (Q2409446) (← links)
- TCTL-preserving translations from timed-arc Petri nets to networks of timed automata (Q2453531) (← links)
- Cost enforcement in the real-time specification for Java (Q2460195) (← links)
- Remove irrelevant atomic formulas for timed automaton model checking (Q2508377) (← links)
- Towards a formal semantics for UML/MARTE state machines based on hierarchical timed automata (Q2637308) (← links)
- Proving Safety of Traffic Manoeuvres on Country Roads (Q2842637) (← links)
