Person:355505: Difference between revisions

From MaRDI portal
Person:355505
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Thomas A. Henzinger to Thomas A. Henzinger: Duplicate
 
(No difference)

Latest revision as of 03:39, 9 December 2023

Available identifiers

zbMath Open henzinger.thomas-aDBLPh/ThomasAHenzingerFactGridQ886295WikidataQ88295 ScholiaQ88295MaRDI QIDQ355505

List of research outcomes

PublicationDate of PublicationType
Synthesis of hybrid automata with affine dynamics from time-series data2024-02-21Paper
Membership-based synthesis of linear hybrid automata2024-02-16Paper
Run-time optimization for learned controllers through quantitative games2024-02-16Paper
Quantitative safety and liveness2023-11-24Paper
History-deterministic timed automata are not determinizable2023-07-21Paper
A space-efficient on-the-fly algorithm for real-time model checking2023-06-28Paper
State equivalences for rectangular hybrid automata2023-06-28Paper
Synthesis of parametric hybrid automata from time series2023-06-02Paper
Reachable set over-approximation for nonlinear systems using piecewise barrier tubes2023-05-26Paper
Space-time interpolants2023-05-26Paper
Modularity for timed and hybrid systems2023-05-17Paper
Fair simulation2023-05-17Paper
https://portal.mardi4nfdi.de/entity/Q58742062023-02-07Paper
https://portal.mardi4nfdi.de/entity/Q58753812023-02-03Paper
Long-Run Average Behavior of Vector Addition Systems with States2023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50923692022-07-21Paper
A Survey of Bidding Games on Graphs (Invited Paper)2022-07-18Paper
Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States2022-07-18Paper
Flavors of sequential information flow2022-07-08Paper
How Many Bits Does it Take to Quantize Your Neural Network?2021-11-10Paper
Long lived transients in gene regulation2021-11-01Paper
https://portal.mardi4nfdi.de/entity/Q50094352021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q49865032021-04-27Paper
Bidding mechanisms in graph games2021-04-14Paper
https://portal.mardi4nfdi.de/entity/Q58564142021-03-26Paper
Refinement for structured concurrent programs2021-02-04Paper
A Theory of Register Monitors2021-01-20Paper
Counterexample-Guided Refinement of Template Polyhedra2020-08-05Paper
Computing Scores of Forwarding Schemes in Switched Networks with Probabilistic Faults2020-08-05Paper
Infinite-duration poorman-bidding games2020-06-18Paper
Bidirectional nested weighted automata2020-05-27Paper
Infinite-Duration Bidding Games2020-05-27Paper
The Cost of Exactness in Quantitative Reachability2020-02-24Paper
Infinite-duration Bidding Games2020-02-11Paper
Dynamic resource allocation games2020-01-22Paper
What good are digital clocks?2019-12-04Paper
Bidding games on Markov decision processes2019-10-22Paper
Transient memory in gene regulation2019-10-10Paper
Model Checking Gene Regulatory Networks2019-09-17Paper
Faster statistical model checking for unbounded temporal properties2019-09-17Paper
Quantitative Automata under Probabilistic Semantics2019-08-13Paper
https://portal.mardi4nfdi.de/entity/Q46338262019-05-06Paper
Array Folds Logic2019-05-03Paper
Hybrid automata with finite bisimulations2019-01-10Paper
The expressive power of clocks2019-01-10Paper
Monitoring temporal logic with clock variables2018-12-06Paper
Quantitative monitor automata2018-08-27Paper
Introduction to Model Checking2018-07-20Paper
Discrete-time control for rectangular hybrid automata2018-07-04Paper
Nested Weighted Automata2018-04-23Paper
The Target Discounted-Sum Problem2018-04-23Paper
Quantitative Automata under Probabilistic Semantics2018-04-23Paper
Nested Weighted Automata2018-03-22Paper
Nested Weighted Limit-Average Automata of Bounded Width2018-03-21Paper
Local linearizability for concurrent container-type data structures2018-03-21Paper
Linear Distances between Markov Chains2018-03-21Paper
From non-preemptive to preemptive scheduling using synchronization synthesis2018-03-01Paper
Conic abstractions for hybrid systems2017-12-01Paper
Model checking the evolution of gene regulatory networks2017-12-01Paper
https://portal.mardi4nfdi.de/entity/Q53670622017-10-12Paper
Faster statistical model checking for unbounded temporal properties2017-07-13Paper
A classification of symbolic transition systems2017-07-12Paper
Scalable Static Hybridization Methods for Analysis of Nonlinear Systems2017-05-19Paper
Model measuring for hybrid systems2017-05-16Paper
From non-preemptive to preemptive scheduling using synchronization synthesis2017-05-15Paper
Quantitative fair simulation games2017-05-12Paper
Lipschitz Robustness of Finite-state Transducers2017-04-25Paper
The Ackermann Award 20132017-02-02Paper
Approximate Determinization of Quantitative Automata2017-01-26Paper
Model measuring for discrete and hybrid systems2016-12-15Paper
PSync: a partially synchronous language for fault-tolerant distributed algorithms2016-10-24Paper
Dynamic Resource Allocation Games2016-09-29Paper
Succinct Representation of Concurrent Trace Sets2016-09-29Paper
Segment Abstraction for Worst-Case Execution Time Analysis2016-04-26Paper
Lipschitz Robustness of Timed I/O Systems2016-03-23Paper
Abstraction-driven Concolic Testing2016-03-23Paper
Randomness for free2015-12-07Paper
Alternating-time temporal logic2015-12-07Paper
Abstractions from proofs2015-11-11Paper
Edit Distance for Pushdown Automata2015-11-04Paper
Finitary winning in ω-regular games2015-09-17Paper
Quantitative languages2015-09-17Paper
Qualitative concurrent parity games2015-09-17Paper
Temporal Specifications with Accumulative Values2015-09-17Paper
Measuring and Synthesizing Systems in Probabilistic Environments2015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012492015-08-03Paper
The benefits of relaxing punctuality2015-06-19Paper
Parametric real-time reasoning2015-05-07Paper
The complexity of multi-mean-payoff and multi-energy games2015-05-04Paper
Aspect-oriented linearizability proofs2015-04-22Paper
Lazy abstraction2015-03-17Paper
A Logic-Based Framework for Verifying Consensus Algorithms2015-01-13Paper
Interface simulation distances2014-12-02Paper
Quantitative abstraction refinement2014-11-27Paper
Quantitative relaxation of concurrent data structures2014-11-27Paper
Proving non-termination2014-09-12Paper
Synthesizing robust systems2014-07-03Paper
A survey of partial-observation stochastic parity games2014-06-30Paper
Battery transition systems2014-04-10Paper
Exact and Approximate Determinization of Discounted-Sum Automata2014-03-24Paper
Aspect-Oriented Linearizability Proofs2013-08-12Paper
From Model Checking to Model Measuring2013-08-12Paper
Strategy improvement for concurrent reachability and turn-based stochastic safety games2013-07-24Paper
Model checking transactional memories2013-06-28Paper
Verification of STM on relaxed memory models2012-09-27Paper
Determinizing discounted-sum automata2012-09-18Paper
Generalized Mean-payoff and Energy Games2012-08-29Paper
Ideal Abstractions for Well-Structured Transition Systems2012-06-15Paper
Lumpability abstractions of rule-based systems2012-05-30Paper
A survey of stochastic \(\omega \)-regular games2012-05-11Paper
Timed Parity Games: Complexity and Robustness2012-04-02Paper
Simulation distances2012-03-13Paper
Dynamic Reactive Modules2011-09-02Paper
FORMALISMS FOR SPECIFYING MARKOVIAN POPULATION MODELS2011-07-14Paper
The Complexity of Request-Response Games2011-06-03Paper
QUASY: Quantitative Synthesis Tool2011-05-19Paper
Approximation of event probabilities in noisy cellular processes2011-05-03Paper
ABC: Algebraic Bound Computation for Loops2011-01-07Paper
Aligators for Arrays (Tool Paper)2010-10-12Paper
Strategy construction for parity games with imperfect information2010-10-07Paper
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results2010-10-04Paper
Expressiveness and Closure Properties for Quantitative Languages2010-09-21Paper
Quantitative Simulation Games2010-09-07Paper
Randomness for Free2010-09-03Paper
Qualitative Analysis of Partially-Observable Markov Decision Processes2010-09-03Paper
Simulation Distances2010-08-31Paper
Mean-Payoff Automaton Expressions2010-08-31Paper
The complexity of quantitative concurrent parity games2010-08-16Paper
Strategy logic2010-06-25Paper
Forward Analysis of Depth-Bounded Processes2010-04-27Paper
Computer Aided Verification2010-04-20Paper
Reduction of stochastic parity to stochastic mean-payoff games2010-04-19Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Verification: Theory and Practice2010-03-23Paper
Invariant and Type Inference for Matrices2010-01-14Paper
Programming Languages and Systems2010-01-05Paper
Formalisms for Specifying Markovian Population Models2009-11-19Paper
Probabilistic Systems with LimSup and LimInf Objectives2009-11-12Paper
Probabilistic Weighted Automata2009-10-22Paper
Alternating Weighted Automata2009-10-20Paper
Stochastic Games with Finitary Objectives2009-10-16Paper
A Survey of Stochastic Games with Limsup and Liminf Objectives2009-07-14Paper
Better Quality in Synthesis through Quantitative Objectives2009-06-30Paper
Software Transactional Memory on Relaxed Memory Models2009-06-30Paper
Sliding Window Abstraction for Infinite Markov Chains2009-06-30Paper
Algorithms for Omega-Regular Games with Imperfect Information2009-03-12Paper
Solving Games Without Determinization2009-03-12Paper
Valigator: A Verification Tool with Bound and Invariant Generation2009-01-27Paper
Timed Parity Games: Complexity and Robustness2008-12-02Paper
Environment Assumptions for Synthesis2008-11-25Paper
Strategy Construction for Parity Games with Imperfect Information2008-11-25Paper
Completeness and Nondeterminism in Model Checking Transactional Memories2008-11-25Paper
EQUIVALENCE OF LABELED MARKOV CHAINS2008-11-24Paper
Quantitative Languages2008-11-20Paper
Permissiveness in Transactional Memories2008-11-20Paper
Strategy Logic2008-09-18Paper
Controller Synthesis with Budget Constraints2008-09-02Paper
Trading Infinite Memory for Uniform Randomness in Timed Games2008-09-02Paper
Stochastic limit-average games are in EXPTIME2008-07-25Paper
Value Iteration2008-07-15Paper
Timed Alternating-Time Temporal Logic2008-07-08Paper
Bounded Asynchrony: Concurrency for Modeling Cell-Cell Interactions2008-06-17Paper
Model-Checking ω-Regular Properties of Interval Markov Chains2008-04-11Paper
Invariant Synthesis for Combined Theories2008-04-04Paper
Markov Decision Processes with Multiple Objectives2008-03-19Paper
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games2008-03-19Paper
Games, Time, and Probability: Graph Models for System Design and Analysis2008-03-07Paper
Concurrent reachability games2007-12-19Paper
Configurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis2007-11-29Paper
Minimum-Time Reachability in Timed Games2007-11-28Paper
Algorithms for Omega-Regular Games with Imperfect Information2007-11-15Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-09-28Paper
Hybrid Systems: Computation and Control2007-09-25Paper
Abstract Counterexample-Based Refinement for Powerset Domains2007-09-24Paper
Generalized Parity Games2007-09-07Paper
Antichains: A New Algorithm for Checking Universality of Finite Automata2007-09-05Paper
Strategy Improvement for Stochastic Rabin and Streett Games2007-09-04Paper
Assume-Guarantee Synthesis2007-09-03Paper
Computer Science Logic2007-06-21Paper
Tools and Algorithms for the Construction and Analysis of Systems2007-05-02Paper
Games with secure equilibria2006-12-07Paper
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science2006-11-14Paper
Formal Modeling and Analysis of Timed Systems2006-11-14Paper
Formal Modeling and Analysis of Timed Systems2006-11-14Paper
Formal Methods for Components and Objects2006-11-01Paper
Correct Hardware Design and Verification Methods2006-10-20Paper
On the universal and existential fragments of the \(\mu\)-calculus2006-04-28Paper
Automata, Languages and Programming2006-01-10Paper
Applications and Theory of Petri Nets 20042005-12-23Paper
Model checking discounted temporal properties2005-12-06Paper
https://portal.mardi4nfdi.de/entity/Q56922802005-09-28Paper
Static Analysis2005-08-24Paper
Stack size analysis for interrupt-driven programs2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48175452004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48187982004-09-24Paper
From pre-historic to post-modern symbolic model checking2004-09-09Paper
https://portal.mardi4nfdi.de/entity/Q48133952004-08-13Paper
https://portal.mardi4nfdi.de/entity/Q47371962004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47365692004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q47365802004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44737192004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44737212004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44492272004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44492382004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q44395592003-12-14Paper
https://portal.mardi4nfdi.de/entity/Q44395622003-12-14Paper
https://portal.mardi4nfdi.de/entity/Q44395642003-12-14Paper
https://portal.mardi4nfdi.de/entity/Q44263872003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44179132003-07-30Paper
https://portal.mardi4nfdi.de/entity/Q44118302003-07-10Paper
https://portal.mardi4nfdi.de/entity/Q48048852003-05-01Paper
Synchronous and Bidirectional Component Interfaces2003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q48049142003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q48049232003-05-01Paper
https://portal.mardi4nfdi.de/entity/Q47918442003-02-03Paper
https://portal.mardi4nfdi.de/entity/Q47918542003-02-03Paper
https://portal.mardi4nfdi.de/entity/Q47918552003-02-03Paper
Fair simulation2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q45366202002-11-28Paper
https://portal.mardi4nfdi.de/entity/Q45364482002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45524512002-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45524732002-09-03Paper
Axioms for real-time logics2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q42340842002-01-27Paper
https://portal.mardi4nfdi.de/entity/Q42303382002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27540832001-11-11Paper
Partial-order reduction in symbolic state-space exploration2001-09-09Paper
https://portal.mardi4nfdi.de/entity/Q27220622001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q45189012001-05-20Paper
https://portal.mardi4nfdi.de/entity/Q27037392001-05-08Paper
https://portal.mardi4nfdi.de/entity/Q45039302000-12-06Paper
https://portal.mardi4nfdi.de/entity/Q45188932000-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49533892000-09-18Paper
https://portal.mardi4nfdi.de/entity/Q45015192000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49533882000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q42700682000-06-14Paper
https://portal.mardi4nfdi.de/entity/Q42527302000-04-26Paper
https://portal.mardi4nfdi.de/entity/Q42519162000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42519192000-01-12Paper
Discrete-time control for rectangular hybrid automata2000-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42700531999-11-10Paper
Event-clock automata: a determinizable class of timed automata1999-01-12Paper
What's decidable about hybrid automata?1999-01-06Paper
Algorithmic analysis of nonlinear hybrid systems1998-06-08Paper
The benefits of relaxing punctuality1998-01-19Paper
The algorithmic analysis of hybrid systems1997-02-28Paper
Real-time system = discrete system + clock variables1997-01-01Paper
HyTech: A model checker for hybrid systems1997-01-01Paper
A really temporal logic1995-03-08Paper
Symbolic model checking for real-time systems1995-02-13Paper
Temporal proof methodologies for timed transition systems1994-10-12Paper
Real-time logics: Complexity and expressiveness1993-12-06Paper
Sooner is safer than later1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q36965511985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Thomas A. Henzinger