APAC: A tool for Reasoning about Abstract Probabilistic Automata

Benoît Delahaye; Kim Guldstrand Larsen; Alex Legay; Mikkel L. Pedersen; Andrzej Wasowski

doi:10.1109/QEST.2011.28

APAC: A tool for Reasoning about Abstract Probabilistic Automata

Benoît Delahaye, Kim Guldstrand Larsen, Alex Legay, Mikkel L. Pedersen, Andrzej Wasowski

Research output: Contribution to book/anthology/report/conference proceeding › Book chapter › Research › peer-review

8 Citations (Scopus)

Abstract

We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.

Original language	English
Title of host publication	Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011
Number of pages	2
Publisher	IEEE Computer Society Press
Publication date	1 Jan 2011
Pages	151-152
ISBN (Print)	978-0-7695-4491-5
DOIs	https://doi.org/10.1109/QEST.2011.28
Publication status	Published - 1 Jan 2011
Event	8th International Conference on Quantitative Evaluation of Systems - Aachen, Germany Duration: 5 Sept 2011 → 8 Sept 2011 Conference number: 8

Conference

Conference	8th International Conference on Quantitative Evaluation of Systems
Number	8
Country/Territory	Germany
City	Aachen
Period	05/09/2011 → 08/09/2011

Access to Document

10.1109/QEST.2011.28

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inbook{e66195f837954658b6a3194847d75c4f,

title = "APAC: A tool for Reasoning about Abstract Probabilistic Automata",

abstract = "We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.",

author = "Beno{\^i}t Delahaye and Larsen, {Kim Guldstrand} and Alex Legay and Pedersen, {Mikkel L.} and Andrzej Wasowski",

year = "2011",

month = jan,

day = "1",

doi = "10.1109/QEST.2011.28",

language = "English",

isbn = "978-0-7695-4491-5",

pages = "151--152",

booktitle = "Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011",

publisher = "IEEE Computer Society Press",

address = "United States",

note = "8th International Conference on Quantitative Evaluation of Systems ; Conference date: 05-09-2011 Through 08-09-2011",

}

Delahaye, B, Larsen, KG, Legay, A, Pedersen, ML & Wasowski, A 2011, APAC: A tool for Reasoning about Abstract Probabilistic Automata. in Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011. IEEE Computer Society Press, pp. 151-152, 8th International Conference on Quantitative Evaluation of Systems, Aachen, Germany, 05/09/2011. https://doi.org/10.1109/QEST.2011.28

APAC: A tool for Reasoning about Abstract Probabilistic Automata. / Delahaye, Benoît; Larsen, Kim Guldstrand; Legay, Alex et al.
Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011. IEEE Computer Society Press, 2011. p. 151-152.

Research output: Contribution to book/anthology/report/conference proceeding › Book chapter › Research › peer-review

TY - CHAP

T1 - APAC: A tool for Reasoning about Abstract Probabilistic Automata

AU - Delahaye, Benoît

AU - Larsen, Kim Guldstrand

AU - Legay, Alex

AU - Pedersen, Mikkel L.

AU - Wasowski, Andrzej

N1 - Conference code: 8

PY - 2011/1/1

Y1 - 2011/1/1

N2 - We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.

AB - We recently introduced Abstract Probabilistic Automata (APA), a new powerful abstraction formalism for probabilistic automata. Our theory is equipped with a series of aggressive abstraction techniques for state-space reduction as well as a specification theory for both logical and structural comparisons. This paper reports on the implementation of the approach in the Abstract Probabilistic Automata Checker toolset.

UR - http://www.scopus.com/inward/record.url?scp=80055051221&partnerID=8YFLogxK

U2 - 10.1109/QEST.2011.28

DO - 10.1109/QEST.2011.28

M3 - Book chapter

AN - SCOPUS:80055051221

SN - 978-0-7695-4491-5

SP - 151

EP - 152

BT - Proceedings of the 2011 8th International Conference on Quantitative Evaluation of Systems, QEST 2011

PB - IEEE Computer Society Press

T2 - 8th International Conference on Quantitative Evaluation of Systems

Y2 - 5 September 2011 through 8 September 2011

ER -

APAC: A tool for Reasoning about Abstract Probabilistic Automata

Abstract

Conference

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this