Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030001506, 9783030001513

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Safe Over- and Under-Approximation of Reachable Sets for Autonomous Dynamical Systems

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_15 ◽

2018 ◽

pp. 252-270 ◽

Cited By ~ 2

Author(s):

Meilun Li ◽

Peter N. Mosaad ◽

Martin Fränzle ◽

Zhikun She ◽

Bai Xue

Keyword(s):

Dynamical Systems ◽

Reachable Sets ◽

Autonomous Dynamical Systems

Download Full-text

Reactive Synthesis for Robotic Swarms

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_5 ◽

2018 ◽

pp. 71-87 ◽

Cited By ~ 3

Author(s):

Salar Moarref ◽

Hadas Kress-Gazit

Keyword(s):

Reactive Synthesis ◽

Robotic Swarms

Download Full-text

Non-bisimulation Based Behavioral Relations for Markov Automata

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_11 ◽

2018 ◽

pp. 179-196 ◽

Cited By ~ 1

Author(s):

Arpit Sharma

Keyword(s):

Markov Automata

Download Full-text

Online Timed Pattern Matching Using Automata

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_13 ◽

2018 ◽

pp. 215-232 ◽

Cited By ~ 5

Author(s):

Alexey Bakhirkin ◽

Thomas Ferrère ◽

Dejan Nickovic ◽

Oded Maler ◽

Eugene Asarin

Keyword(s):

Pattern Matching

Download Full-text

TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_3 ◽

2018 ◽

pp. 37-52 ◽

Cited By ~ 4

Author(s):

Étienne André ◽

Didier Lime ◽

Mathias Ramparison

Keyword(s):

Model Checking ◽

Upper Bound ◽

Timed Automata ◽

Lower Upper

Download Full-text

Trace Relations and Logical Preservation for Markov Automata

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_10 ◽

2018 ◽

pp. 162-178 ◽

Cited By ~ 4

Author(s):

Arpit Sharma

Keyword(s):

Markov Automata

Download Full-text

Tropical Abstractions of Max-Plus Linear Systems

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_16 ◽

2018 ◽

pp. 271-287 ◽

Cited By ~ 1

Author(s):

Muhammad Syifa’ul Mufid ◽

Dieky Adzkiya ◽

Alessandro Abate

Keyword(s):

Linear Systems

Download Full-text

Duality-Based Nested Controller Synthesis from STL Specifications for Stochastic Linear Systems

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_14 ◽

2018 ◽

pp. 235-251 ◽

Cited By ~ 1

Author(s):

Susmit Jha ◽

Sunny Raj ◽

Sumit Kumar Jha ◽

Natarajan Shankar

Keyword(s):

Linear Systems ◽

Controller Synthesis ◽

Stochastic Linear Systems

Download Full-text

Stochastic Temporal Logic Abstractions: Challenges and Opportunities

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_1 ◽

2018 ◽

pp. 3-16 ◽

Cited By ~ 1

Author(s):

Jyotirmoy V. Deshmukh ◽

Panagiotis Kyriakis ◽

Paul Bogdan

Keyword(s):

Temporal Logic ◽

Challenges And Opportunities

Download Full-text

Perfect Timed Communication Is Hard

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems ◽

10.1007/978-3-030-00151-3_6 ◽

2018 ◽

pp. 91-107 ◽

Cited By ~ 1

Author(s):

Parosh Aziz Abdulla ◽

Mohamed Faouzi Atig ◽

Shankara Narayanan Krishna

Download Full-text

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed SystemsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

Safe Over- and Under-Approximation of Reachable Sets for Autonomous Dynamical Systems

Reactive Synthesis for Robotic Swarms

Non-bisimulation Based Behavioral Relations for Markov Automata

Online Timed Pattern Matching Using Automata

TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants

Trace Relations and Logical Preservation for Markov Automata

Tropical Abstractions of Max-Plus Linear Systems

Duality-Based Nested Controller Synthesis from STL Specifications for Stochastic Linear Systems

Stochastic Temporal Logic Abstractions: Challenges and Opportunities

Perfect Timed Communication Is Hard

Lecture Notes in Computer Science - Formal Modeling and Analysis of Timed Systems
Latest Publications