The following pages link to Taolue Chen (Q310083):
Displaying 50 items.
- A computationally grounded, weighted doxastic logic (Q310087) (← links)
- Continuous-time orbit problems are decidable in polynomial-time (Q458374) (← links)
- The packing chromatic number of the infinite square lattice is between 13 and 15 (Q528575) (← links)
- On the axiomatizability of priority. II (Q549169) (← links)
- \textsf{BDD4BNN}: a BDD-based quantitative analysis framework for binarized neural networks (Q832164) (← links)
- On finite alphabets and infinite bases (Q924717) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- Ready to preorder: the case of weak process semantics (Q975539) (← links)
- Bisimulations for fuzzy transition systems revisited (Q1648774) (← links)
- Polynomial-time algorithms for computing distances of fuzzy transition systems (Q1749476) (← links)
- On the complexity of model checking interval-valued discrete time Markov chains (Q1943636) (← links)
- Computing linear arithmetic representation of reachability relation of one-counter automata (Q2169112) (← links)
- Separation logic with linearly compositional inductive predicates and set data constraints (Q2206230) (← links)
- Satisfiability of compositional separation logic with tree predicates and data constraints (Q2405271) (← links)
- Quantitative verification of implantable cardiac pacemakers over hybrid heart models (Q2453219) (← links)
- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (Q2817951) (← links)
- (Q2844039) (← links)
- (Q2845515) (← links)
- On Stochastic Games with Multiple Objectives (Q2849916) (← links)
- A Compositional Specification Theory for Component Behaviours (Q2892725) (← links)
- Playing Stochastic Games Precisely (Q2912689) (← links)
- Model Checking Stochastic Branching Processes (Q2912726) (← links)
- Solvency Markov Decision Processes with Interest (Q2963937) (← links)
- On the complexity of computing maximum entropy for Markovian Models (Q2978546) (← links)
- Efficient CTMC Model Checking of Linear Real-Time Objectives (Q3000642) (← links)
- Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications (Q3003315) (← links)
- Time-Bounded Verification of CTMCs against Real-Time Specifications (Q3172840) (← links)
- Observing Continuous-Time MDPs by 1-Clock Timed Automata (Q3172860) (← links)
- Perturbation Analysis in Verification of Discrete-Time Markov Chains (Q3190120) (← links)
- On the Axiomatizability of Impossible Futures (Q3196348) (← links)
- (Q3366962) (← links)
- (Q3366964) (← links)
- Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems (Q3525633) (← links)
- On the Axiomatizability of Priority (Q3591402) (← links)
- On Finite Bases for Weak Semantics: Failures Versus Impossible Futures (Q3599070) (← links)
- Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata (Q3630197) (← links)
- LTL Model Checking of Time-Inhomogeneous Markov Chains (Q3648693) (← links)
- (Q4466829) (← links)
- On the total variation distance of labelled Markov chains (Q4635617) (← links)
- (Q4823944) (← links)
- (Q5111651) (← links)
- Synthesizing barrier certificates using neural networks (Q5146391) (← links)
- Specification and verification for semi-structured data (Q5291135) (← links)
- (Q5357708) (← links)
- Complete Axiomatization for Divergent-Sensitive Bisimulations in Basic Process Algebra with Prefix Iteration (Q5415608) (← links)
- On the axiomatisability of priority (Q5458057) (← links)
- (Q5491512) (← links)
- (Q5697792) (← links)
- (Q5697794) (← links)
- On Finite Alphabets and Infinite Bases III: Simulation (Q5756593) (← links)
