1 option
Formal Modeling and Analysis of Timed Systems : First International Workshop, FORMATS 2003, Marseille, France, September 6-7, 2003, Revised Papers / edited by Kim G. Larsen, Peter Niebert.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2791.
- Lecture Notes in Computer Science, 0302-9743 ; 2791
- Language:
- English
- Subjects (All):
- Applied mathematics.
- Engineering mathematics.
- Computer logic.
- Software engineering.
- Programming languages (Electronic computers).
- Computers, Special purpose.
- Applications of Mathematics.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Special Purpose and Application-Based Systems.
- Local Subjects:
- Applications of Mathematics.
- Logics and Meanings of Programs.
- Software Engineering.
- Programming Languages, Compilers, Interpreters.
- Special Purpose and Application-Based Systems.
- Physical Description:
- 1 online resource (VIII, 281 pages).
- Edition:
- First edition 2004.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
- System Details:
- text file PDF
- Summary:
- This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Formal Modeling and Analysis of Timed Systems, FORMATS 2003, held in Marseille, France in September 2003. The 19 revised full papers presented together with an invited paper and the abstracts of two invited talks were carefully selected from 36 submissions during two rounds of reviewing and improvement. All current aspects of formal method for modeling and analyzing timed systems are addressed; among the timed systems dealt with are timed automata, timed Petri nets, max-plus algebras, real-time systems, discrete time systems, timed languages, and real-time operating systems.
- Contents:
- Timed Automata and Timed Languages Challenges and Open Problems
- Towards Efficient Partition Refinement for Checking Reachability in Timed Automata
- Checking ACTL * Properties of Discrete Timed Automata via Bounded Model Checking
- Removing Irrelevant Atomic Formulas for Checking Timed Automata Efficiently
- Adding Symmetry Reduction to Uppaal
- TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems
- Optimization of Timed Automata Models Using Mixed-Integer Programming
- Discrete-Time Rewards Model-Checked
- Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
- An Interval-Based Algebra for Restricted Event Detection
- PARS: A Process Algebra with Resources and Schedulers
- Formal Semantics of Hybrid Chi
- Run-Time Guarantees for Real-Time Systems
- A Nonarchimedian Discretization for Timed Languages
- Folk Theorems on the Determinization and Minimization of Timed Automata
- Control Synthesis for a Smart Card Personalization System Using Symbolic Model Checking
- On Timing Analysis of Combinational Circuits
- Analysis of Real Time Operating System Based Applications
- Time-Optimal Test Cases for Real-Time Systems
- Using Zone Graph Method for Computing the State Space of a Time Petri Net
- Causal Time Calculus
- ELSE: A New Symbolic State Generator for Timed Automata.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-40903-8
- 9783540409038
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.