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 Berlin Heidelberg

9783540216711, 9783540409038

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

ELSE: A New Symbolic State Generator for Timed Automata

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

10.1007/978-3-540-40903-8_22 ◽

2004 ◽

pp. 273-280 ◽

Cited By ~ 2

Author(s):

Sarah Zennou ◽

Manuel Yguel ◽

Peter Niebert

Keyword(s):

Timed Automata

Download Full-text

Run-Time Guarantees for Real-Time Systems

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

10.1007/978-3-540-40903-8_13 ◽

2004 ◽

pp. 166-167 ◽

Cited By ~ 1

Author(s):

Reinhard Wilhelm

Keyword(s):

Real Time ◽

Real Time Systems ◽

Run Time ◽

Time Systems

Download Full-text

PARS: A Process Algebra with Resources and Schedulers

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

10.1007/978-3-540-40903-8_11 ◽

2004 ◽

pp. 134-150 ◽

Cited By ~ 8

Author(s):

MohammadReza Mousavi ◽

Michel Reniers ◽

Twan Basten ◽

Michel Chaudron

Keyword(s):

Process Algebra

Download Full-text

Causal Time Calculus

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

10.1007/978-3-540-40903-8_21 ◽

2004 ◽

pp. 260-272 ◽

Cited By ~ 3

Author(s):

Franck Pommereau

Download Full-text

Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking

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

10.1007/978-3-540-40903-8_16 ◽

2004 ◽

pp. 189-203 ◽

Cited By ~ 4

Author(s):

Biniam Gebremichael ◽

Frits Vaandrager

Keyword(s):

Model Checking ◽

Smart Card ◽

Symbolic Model Checking ◽

Control Synthesis ◽

Symbolic Model

Download Full-text

Time-Optimal Test Cases for Real-Time Systems

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

10.1007/978-3-540-40903-8_19 ◽

2004 ◽

pp. 234-245 ◽

Cited By ~ 5

Author(s):

Anders Hessel ◽

Kim G. Larsen ◽

Brian Nielsen ◽

Paul Pettersson ◽

Arne Skou

Keyword(s):

Real Time ◽

Test Cases ◽

Real Time Systems ◽

Optimal Test ◽

Time Optimal ◽

Time Systems

Download Full-text

Timed Automata and Timed Languages Challenges and Open Problems

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

10.1007/978-3-540-40903-8_1 ◽

2004 ◽

pp. 1-1

Author(s):

Eugene Asarin

Keyword(s):

Timed Automata ◽

Open Problems

Download Full-text

Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently

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

10.1007/978-3-540-40903-8_4 ◽

2004 ◽

pp. 34-45 ◽

Cited By ~ 5

Author(s):

Jianhua Zhao ◽

Xuandong Li ◽

Tao Zheng ◽

Guoliang Zheng

Keyword(s):

Timed Automata

Download Full-text

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata

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

10.1007/978-3-540-40903-8_2 ◽

2004 ◽

pp. 2-17

Author(s):

Agata Półrola ◽

Wojciech Penczek ◽

Maciej Szreter

Keyword(s):

Timed Automata ◽

Partition Refinement

Download Full-text

A Nonarchimedian Discretization for Timed Languages

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

10.1007/978-3-540-40903-8_14 ◽

2004 ◽

pp. 168-181 ◽

Cited By ~ 3

Author(s):

Cătălin Dima

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

ELSE: A New Symbolic State Generator for Timed Automata

Run-Time Guarantees for Real-Time Systems

PARS: A Process Algebra with Resources and Schedulers

Causal Time Calculus

Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking

Time-Optimal Test Cases for Real-Time Systems

Timed Automata and Timed Languages Challenges and Open Problems

Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently

Towards Efficient Partition Refinement for Checking Reachability in Timed Automata

A Nonarchimedian Discretization for Timed Languages

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