You have Guest access.
Log In
Eugene Asarin and Patricia Bouyer
Front matter
1-17
Timed Alternating-Time Temporal Logic
18-31
Concurrent Semantics Without the Notions of State or State Transitions
32
Decidability and Expressive Power of Real Time Logics
33-51
Extended Directed Search for Probabilistic Timed Reachability
52-66
Intersection of Regular Signal-Event (Timed) Languages
67-81
Refinements and Abstractions of Signal-Event (Timed) Languages
82-97
Bridging the Gap Between Timed Automata and Bounded Time Petri Nets
98-112
Matching Scenarios with Timing Constraints
113-127
Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata
128-142
Model Checking Timed Automata with Priorities Using DBM Subtraction
143-155
Symbolic Robustness Analysis of Timed Automata
156-170
Coping with the Parallelism of BitTorrent: Conversion of PEPA to ODEs in Dealing with State Space Explosion
171-186
Temporal Logic Verification Using Simulation
187-199
Undecidable Problems About Timed Automata
200-214
On Timed Simulation Relations for Hybrid Systems and Compositionality
215-229
Integrating Discrete- and Continuous-Time Metric Temporal Logics Through Sampling
230-244
On the Computational Power of Timed Differentiable Petri Nets
245-259
Model-Checking Timed ATL for Durational Concurrent Game Structures
260-273
A Dose of Timed Logic, in Guarded Measure
274-289
From MITL to Timed Automata
290-305
Adding Invariants to Event Zone Automata
306-321
Static Analysis for State-Space Reduction of Polygonal Hybrid Systems
322-336
On the Expressiveness of MTL with Past Operators
337-351
Simulator for Real-Time Abstract State Machines
352-367
A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info