_id,title
1670,PDDL+ planning with hybrid automata: Foundations of translating must behavior
1680,On the decidability of elementary modal logics
1689,Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
1690,HYST: A source transformation and translation tool for hybrid automaton models
1692,Eliminating spurious transitions in reachability with support functions
1698,The complexity of multi-mean-payoff and multi-energy games
1729,From non-preemptive to preemptive scheduling using synchronization synthesis
1731,Randomness for free
1808,Guest editors' introduction to special issue on computational methods in systems biology
1832,Aspect-oriented linearizability proofs
1835,Model checking gene regulatory networks
1836,Segment abstraction for worst-case execution time analysis
1840,Optimal Kullback-Leibler aggregation via information bottleneck
1846,Refinement checking on parametric modal transition systems
1856,Measuring and synthesizing systems in probabilistic environments
1861,Moment-based methods for parameter inference and experiment design for stochastic biochemical reaction networks
1866,The equivalence problem for finite automata: Technical perspective
1882,Compositionality for quantitative specifications
1992,Succinct representation of concurrent trace sets
5436,Nested weighted automata