Quantitative modelling and analysis

Authors:
Joost-Pieter Katoen;Kim Guldstrand Larsen
Affiliations:
Formal Methods and Tools, University of Twente, The Netherlands,Software Modeling and Verification Group, RWTH Aachen University, Germany;Center for Embedded Software Systems, Aalborg, Denmark
Venue:
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II
Year:
2012

Citing 4
Cited 0

Termination of Probabilistic Concurrent Program

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata For Modeling Real-Time Systems

ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Automatic verification of probabilistic concurrent finite state programs

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Schedulability of herschel-planck revisited using statistical model checking

ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: applications and case studies - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quantitative models and quantitative analysis in Computer Science are currently intensively studied, resulting in a revision of the foundation of Computer Science where classical yes/no answers are replaced by quantitative analyses. The potential application areas are huge, e.g., performance analysis, operations research or embedded systems. This field covers extended automata-based models that permit to reasons about quantities. Over the past, one has mainly distinguished between real-time and stochastic extensions of automata.