Amazon cover image
Image from Amazon.com

Formal modeling and analysis of timed systems : 12th International Conference, FORMATS 2014, Florence, Italy, September 8-10, 2014. Proceedings / Axel Legay, Marius Bozga (eds.).

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 8711. | LNCS sublibrary. SL 1, Theoretical computer science and general issues.Publisher: Cham : Springer, 2014Description: 1 online resource (x, 253 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319105123
  • 3319105124
Other title:
  • FORMATS 2014
Subject(s): Genre/Form: Additional physical formats: Printed edition:: No titleDDC classification:
  • 003/.3 23
LOC classification:
  • QA76.9.C65
Online resources:
Contents:
Intro; Preface; Organization; Table of Contents; The Modeling and Analysis of Mixed-Criticality Systems; References; Modeling Bitcoin Contracts by Timed Automata; 1 Introduction; 1.1 A Short Description of Bitcoin; 2 Modeling the Bitcoin; 2.1 The Keys, the Secret Strings, and the Signatures; 2.2 The Transactions; 2.3 The Parties; 2.4 The Adversary; 2.5 The Block Chain and the Notion of Time; 3 Modeling the Bitcoin-Based Timed Commitment Scheme from [8]; 3.1 The Results of the Verification; 3.2 The NewSCS Protocol from [8]; References
Data-Driven Statistical Learning of Temporal Logic Properties1 Introduction; 2 Problem Statement and Methodology; 2.1 Statistical Modelling of Data: Learning and Model Selection; 2.2 Learning Properties; 3 Results; 3.1 Logical Characterisation of a Biological Oscillator; 3.2 Logical Discrimination of Cardiac Arrhythmias; 4 Related Work; 5 Conclusions; References; Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices; 1 Introduction; 2 Preliminaries; 2.1 Timed Automata; 2.2 The Zone Approach; 2.3 The Difference Bound Matrices
3 Zone-Based Algorithms For Calculating BCET and WCET3.1 The Zone-Based Algorithms; 4 Implementation; 5 Case Studies; 6 Conclusion; References; Delay-Dependent Partial Order Reduction Technique for Time Petri Nets; 1 Introduction; 2 Time Petri Nets; 2.1 Definition and Semantics; 2.2 Contracted State Class Graph; 3 Partial Order Reduction Based on POSETs; 3.1 Partial Order Successors and Reduced State Class Graphs; 4 RSCG Preserving Non-equivalent Sequences of N; 4.1 Delay Lower Bound Matrix of N; 4.2 Computing a Partial Order Generator G
4.3 Does G Preserve the Non-equivalent Firing Sequences of N?5 Experimental Results; 6 Conclusion; References; On MITL and Alternating Timed Automata over Infinite Words; 1 Introduction; 2 Preliminaries; 3 The Intervals Semantics for OCATA on Infinite Words; 4 TOCATA: A Class of OCATA for MITL; 5 MITL Model-Checking and Satisfiability with TOCATA; 6 Experimental Results; References; Time Petri Nets with Dynamic Firing Dates: Semantics and Applications; 1 Introduction; 2 Time Petri Nets and Fickle Transitions; 2.1 A Semantics for Time Petri Nets Based on Firing Functions
2.2 Interesting Classes of DTPN2.3 Interpretation of the Quantized State System Model; 3 A State Class Abstraction for Dynamic TPN; 4 Two Application for Dynamic TPN; 4.1 Scheduling Preemptive Tasks; 4.2 Verification of Linear Hybrid systems; 5 Conclusion and Related Work; References; Verification and Performance Evaluation of Timed Game Strategies; 1 Introduction; 2 Timed Game; 2.1 Timed Game Automata; 2.2 A Running Example; 3 Stochastic Priced Timed Automata; 3.1 Priced Timed Automata; 3.2 Stochastic Semantics; 4 Translating Strategies to Timed Automata; 4.1 The Method
In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 12th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2014, held in Florence, Italy, in September 2014. The 17 revised full papers presented were carefully reviewed and selected from 36 submissions. The papers cover topics of foundations and semantics; comparison between different models, such as timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models; methods and tools for analyzing timed systems and resolving temporal constraints; applications in real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

International conference proceedings.

Includes author index.

Online resource; title from PDF title page (SpringerLink, viewed August 26, 2014).

This book constitutes the refereed proceedings of the 12th International Conference on Formal Modeling and Analysis of Timed Systems, FORMATS 2014, held in Florence, Italy, in September 2014. The 17 revised full papers presented were carefully reviewed and selected from 36 submissions. The papers cover topics of foundations and semantics; comparison between different models, such as timed automata, timed Petri nets, hybrid automata, timed process algebra, max-plus algebra, probabilistic models; methods and tools for analyzing timed systems and resolving temporal constraints; applications in real-time software, hardware circuits, and problems of scheduling in manufacturing and telecommunication.

Intro; Preface; Organization; Table of Contents; The Modeling and Analysis of Mixed-Criticality Systems; References; Modeling Bitcoin Contracts by Timed Automata; 1 Introduction; 1.1 A Short Description of Bitcoin; 2 Modeling the Bitcoin; 2.1 The Keys, the Secret Strings, and the Signatures; 2.2 The Transactions; 2.3 The Parties; 2.4 The Adversary; 2.5 The Block Chain and the Notion of Time; 3 Modeling the Bitcoin-Based Timed Commitment Scheme from [8]; 3.1 The Results of the Verification; 3.2 The NewSCS Protocol from [8]; References

Data-Driven Statistical Learning of Temporal Logic Properties1 Introduction; 2 Problem Statement and Methodology; 2.1 Statistical Modelling of Data: Learning and Model Selection; 2.2 Learning Properties; 3 Results; 3.1 Logical Characterisation of a Biological Oscillator; 3.2 Logical Discrimination of Cardiac Arrhythmias; 4 Related Work; 5 Conclusions; References; Finding Best and Worst Case Execution Times of Systems Using Difference-Bound Matrices; 1 Introduction; 2 Preliminaries; 2.1 Timed Automata; 2.2 The Zone Approach; 2.3 The Difference Bound Matrices

3 Zone-Based Algorithms For Calculating BCET and WCET3.1 The Zone-Based Algorithms; 4 Implementation; 5 Case Studies; 6 Conclusion; References; Delay-Dependent Partial Order Reduction Technique for Time Petri Nets; 1 Introduction; 2 Time Petri Nets; 2.1 Definition and Semantics; 2.2 Contracted State Class Graph; 3 Partial Order Reduction Based on POSETs; 3.1 Partial Order Successors and Reduced State Class Graphs; 4 RSCG Preserving Non-equivalent Sequences of N; 4.1 Delay Lower Bound Matrix of N; 4.2 Computing a Partial Order Generator G

4.3 Does G Preserve the Non-equivalent Firing Sequences of N?5 Experimental Results; 6 Conclusion; References; On MITL and Alternating Timed Automata over Infinite Words; 1 Introduction; 2 Preliminaries; 3 The Intervals Semantics for OCATA on Infinite Words; 4 TOCATA: A Class of OCATA for MITL; 5 MITL Model-Checking and Satisfiability with TOCATA; 6 Experimental Results; References; Time Petri Nets with Dynamic Firing Dates: Semantics and Applications; 1 Introduction; 2 Time Petri Nets and Fickle Transitions; 2.1 A Semantics for Time Petri Nets Based on Firing Functions

2.2 Interesting Classes of DTPN2.3 Interpretation of the Quantized State System Model; 3 A State Class Abstraction for Dynamic TPN; 4 Two Application for Dynamic TPN; 4.1 Scheduling Preemptive Tasks; 4.2 Verification of Linear Hybrid systems; 5 Conclusion and Related Work; References; Verification and Performance Evaluation of Timed Game Strategies; 1 Introduction; 2 Timed Game; 2.1 Timed Game Automata; 2.2 A Running Example; 3 Stochastic Priced Timed Automata; 3.1 Priced Timed Automata; 3.2 Stochastic Semantics; 4 Translating Strategies to Timed Automata; 4.1 The Method

English.

Powered by Koha