NDLI: Fortuna: Model Checking Priced Probabilistic Timed Automata

Content Provider	IEEE Xplore Digital Library
Author	Berendsen, J. Jansen, D.N. Vaandrager, F.
Copyright Year	2010
Abstract	Fortuna is the first tool for model checking priced probabilistic timed automata (PPTAs). PPTAs are an important model that can handle the combination of real-time, probabilistic and cost features. Only model checkers that incorporate all these features can address the key design trade-offs that arise in many practical applications such as: the Zeroconf, Bluetooth, IEEE802.11 and Firewire protocols, protocols for sensor networks, and scheduling problems with failures. PPTAs are an extension of probabilistic timed automata (PTAs), by having cost-rates and discrete cost increments on states. Fortuna is able to compute the maximal probability by which a class of states can be reached under a certain cost-bound (and time bound.) Although the problem is undecidable in general, there exists a semi-algorithm that produces a non-decreasing sequence of maximal probabilities. This paper enhances that algorithm. We compared the performance of Fortuna with existing approaches for PTAs. Surprisingly, although PPTAs are more general, our techniques exhibit superior performance.
Starting Page	273
Ending Page	281
File Size	321605
Page Count	9
File Format	PDF
ISBN	9781424480821
DOI	10.1109/QEST.2010.41
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-09-15
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	priced timed automata Automata probabilistic reachability Markov processes Probabilistic logic probabilistic timed automata Timing symbolic algorithms Optimization Cost accounting Clocks
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Timed Branching Processes

Development of probabilistic timed CEGAR

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics

Counterexample generation and representation in model checking for probabilistic timed automata

Model Checking Rectangular Hybrid Systems with Timed Computation Tree Logic

Bounded Model Checking of an MITL Fragment for Timed Automata

Relating average and discounted costs for quantitative analysis of timed systems

Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata

Counterexample Generation for Probabilistic Timed Automata Model Checking

Fortuna: Model Checking Priced Probabilistic Timed Automata

Similar Documents

Timed Branching Processes

Development of probabilistic timed CEGAR

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics

Counterexample generation and representation in model checking for probabilistic timed automata

Model Checking Rectangular Hybrid Systems with Timed Computation Tree Logic

Bounded Model Checking of an MITL Fragment for Timed Automata

Relating average and discounted costs for quantitative analysis of timed systems

Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata

Counterexample Generation for Probabilistic Timed Automata Model Checking

Fortuna: Model Checking Priced Probabilistic Timed Automata