Wang Yi

From MaRDI portal
Person:225081

Available identifiers

zbMath Open yi.wangMaRDI QIDQ225081

List of research outcomes





PublicationDate of PublicationType
Partial order reductions for timed systems2025-01-27Paper
Deciding properties of regular real timed processes2024-04-29Paper
Characterizations of parallel real-time workloads2024-02-28Paper
Model checking, synthesis, and learning2023-05-26Paper
Time abstracted bisimulation: Implicit specifications and decidability2023-04-28Paper
Model-checking for real-time systems2022-12-09Paper
On the Analysis of Parallel Real-Time Tasks With Spin Locks2022-03-23Paper
https://portal.mardi4nfdi.de/entity/Q49972352021-06-28Paper
Characterization of simulation by probabilistic testing2021-05-20Paper
Refinement of workload models for engine controllers by state space partitioning2020-07-28Paper
Model Checking Bounded Continuous-time Extended Linear Duration Invariants2018-12-06Paper
Scheduling Analysis of Imprecise Mixed-Criticality Real-Time Tasks2018-09-20Paper
Utilization-Based Scheduling of Flexible Mixed-Criticality Real-Time Tasks2018-06-27Paper
Schedulability analysis of a graph-based task model for mixed-criticality systems2016-03-09Paper
Combinatorial abstraction refinement for feasibility analysis of static priorities2015-11-13Paper
Graph-based models for real-time workload: a survey2015-09-25Paper
Universality of R-automata with Value Copying2015-03-19Paper
An optimal resource sharing protocol for generalized multiframe tasks2014-12-03Paper
Bounding and shaping the demand of generalized mixed-criticality sporadic task systems2014-07-14Paper
Sampled semantics of timed automata2010-09-21Paper
Integrated Formal Methods2009-05-07Paper
R-Automata2008-11-25Paper
Multi-processor Schedulability Analysis of Preemptive Real-Time Tasks with Variable Execution Times2008-07-03Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Sampled Universality of Timed Automata2007-09-07Paper
Communicating Timed Automata: The More Synchronous, the More Difficult to Verify2007-09-05Paper
Task automata: Schedulability, decidability and undecidability2007-08-23Paper
Exploring optimal solution to hardware/software partitioning for synchronous model2006-10-25Paper
Schedulability analysis of fixed-priority systems using timed automata2006-04-28Paper
Lectures on Concurrency and Petri Nets2005-12-23Paper
CONCUR 2004 - Concurrency Theory2005-08-23Paper
https://portal.mardi4nfdi.de/entity/Q46587232005-03-18Paper
https://portal.mardi4nfdi.de/entity/Q46547242005-03-08Paper
https://portal.mardi4nfdi.de/entity/Q48188022004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q47383272004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44722282004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44722612004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44724512004-08-04Paper
Compact data structures and state-space reduction for model-checking real-time systems2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44263852003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44179252003-07-30Paper
Automated verification of an audio-control protocol using UPPAAL2003-02-13Paper
Formal design and analysis of a gear controller2002-09-29Paper
Axiomatising timed automata2002-08-14Paper
Testing preorders for probabilistic processes can be characterized by simulations2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q27290752001-11-06Paper
https://portal.mardi4nfdi.de/entity/Q45083042001-05-28Paper
Probabilistic extensions of process algebras.2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49396172000-02-06Paper
Uppaal in a nutshell1997-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40365651993-05-18Paper

Research outcomes over time

This page was built for person: Wang Yi