---
_id: '5439'
abstract:
- lang: eng
text: 'The target discounted-sum problem is the following: Given a rational discount
factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite
or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals
t? The problem turns out to relate to many fields of mathematics and computer
science, and its decidability question is surprisingly hard to solve. We solve
the finite version of the problem, and show the hardness of the infinite version,
linking it to various areas and open problems in mathematics and computer science:
β-expansions, discounted-sum automata, piecewise affine maps, and generalizations
of the Cantor set. We provide some partial results to the infinite version, among
which are solutions to its restriction to eventually-periodic sequences and to
the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving
some open problems on discounted-sum automata, among which are the exact-value
problem for nondeterministic automata over finite words and the universality and
inclusion problems for functional automata. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Boker U, Henzinger TA, Otop J. The Target Discounted-Sum Problem. IST
Austria; 2015. doi:10.15479/AT:IST-2015-335-v1-1
apa: Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum
problem. IST Austria. https://doi.org/10.15479/AT:IST-2015-335-v1-1
chicago: Boker, Udi, Thomas A Henzinger, and Jan Otop. The Target Discounted-Sum
Problem. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-335-v1-1.
ieee: U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem.
IST Austria, 2015.
ista: Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST
Austria, 20p.
mla: Boker, Udi, et al. The Target Discounted-Sum Problem. IST Austria, 2015,
doi:10.15479/AT:IST-2015-335-v1-1.
short: U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST
Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2023-02-23T10:08:48Z
day: '18'
ddc:
- '004'
- '512'
- '513'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2015-335-v1-1
file:
- access_level: open_access
checksum: 40405907aa012acece1bc26cf0be554d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:55Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5517'
file_name: IST-2015-335-v1+1_report.pdf
file_size: 589619
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '335'
related_material:
record:
- id: '1659'
relation: later_version
status: public
status: public
title: The target discounted-sum problem
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5549'
abstract:
- lang: eng
text: "This repository contains the experimental part of the CAV 2015 publication
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe
extended the probabilistic model checker PRISM to represent strategies of Markov
Decision Processes as Decision Trees.\r\nThe archive contains a java executable
version of the extended tool (prism_dectree.jar) together with a few examples
of the PRISM benchmark library.\r\nTo execute the program, please have a look
at the README.txt, which provides instructions and further information on the
archive.\r\nThe archive contains scripts that (if run often enough) reproduces
the data presented in the publication."
article_processing_charge: No
author:
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
citation:
ama: 'Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28'
apa: 'Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28'
chicago: 'Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes.” Institute
of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.'
ieee: 'A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes.” Institute of Science
and Technology Austria, 2015.'
ista: 'Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:28.'
mla: 'Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.'
short: A. Fellner, (2015).
contributor:
- first_name: Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
datarep_id: '28'
date_created: 2018-12-12T12:31:29Z
date_published: 2015-08-13T00:00:00Z
date_updated: 2024-02-21T13:52:07Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:ISTA:28
ec_funded: 1
file:
- access_level: open_access
checksum: b8bcb43c0893023cda66c1b69c16ac62
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:31Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5597'
file_name: IST-2015-28-v1+2_Fellner_DataRep.zip
file_size: 49557109
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
keyword:
- Markov Decision Process
- Decision Tree
- Probabilistic Verification
- Counterexample Explanation
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publisher: Institute of Science and Technology Austria
publist_id: '5564'
related_material:
record:
- id: '1603'
relation: popular_science
status: public
status: public
title: 'Experimental part of CAV 2015 publication: Counterexample Explanation by Learning
Small Strategies in Markov Decision Processes'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1498'
abstract:
- lang: eng
text: Fault-tolerant distributed algorithms play an important role in many critical/high-availability
applications. These algorithms are notoriously difficult to implement correctly,
due to asynchronous communication and the occurrence of faults, such as the network
dropping messages or computers crashing. Nonetheless there is surprisingly little
language and verification support to build distributed systems based on fault-tolerant
algorithms. In this paper, we present some of the challenges that a designer has
to overcome to implement a fault-tolerant distributed system. Then we review different
models that have been proposed to reason about distributed algorithms and sketch
how such a model can form the basis for a domain-specific programming language.
Adopting a high-level programming model can simplify the programmer's life and
make the code amenable to automated verification, while still compiling to efficiently
executable code. We conclude by summarizing the current status of an ongoing language
design and implementation project that is based on this idea.
alternative_title:
- LIPIcs
author:
- first_name: Cezara
full_name: Dragoi, Cezara
id: 2B2B5ED0-F248-11E8-B48F-1D18A9856A87
last_name: Dragoi
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: Dragoi C, Henzinger TA, Zufferey D. The need for language support for fault-tolerant
distributed systems. 2015;32:90-102. doi:10.4230/LIPIcs.SNAPL.2015.90
apa: 'Dragoi, C., Henzinger, T. A., & Zufferey, D. (2015). The need for language
support for fault-tolerant distributed systems. Presented at the SNAPL: Summit
oN Advances in Programming Languages, Asilomar, CA, United States: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90'
chicago: Dragoi, Cezara, Thomas A Henzinger, and Damien Zufferey. “The Need for
Language Support for Fault-Tolerant Distributed Systems.” Leibniz International
Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015. https://doi.org/10.4230/LIPIcs.SNAPL.2015.90.
ieee: C. Dragoi, T. A. Henzinger, and D. Zufferey, “The need for language support
for fault-tolerant distributed systems,” vol. 32. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, pp. 90–102, 2015.
ista: Dragoi C, Henzinger TA, Zufferey D. 2015. The need for language support for
fault-tolerant distributed systems. 32, 90–102.
mla: Dragoi, Cezara, et al. The Need for Language Support for Fault-Tolerant
Distributed Systems. Vol. 32, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2015, pp. 90–102, doi:10.4230/LIPIcs.SNAPL.2015.90.
short: C. Dragoi, T.A. Henzinger, D. Zufferey, 32 (2015) 90–102.
conference:
end_date: 2015-05-06
location: Asilomar, CA, United States
name: 'SNAPL: Summit oN Advances in Programming Languages'
start_date: 2015-05-03
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2020-08-11T10:09:14Z
day: '01'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.SNAPL.2015.90
ec_funded: 1
file:
- access_level: open_access
checksum: cf5e94baa89a2dc4c5de01abc676eda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:02Z
date_updated: 2020-07-14T12:44:58Z
file_id: '5050'
file_name: IST-2016-499-v1+1_9.pdf
file_size: 489362
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 32'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 90 - 102
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_identifier:
isbn:
- '978-3-939897-80-4 '
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5681'
pubrep_id: '499'
quality_controlled: '1'
scopus_import: 1
series_title: Leibniz International Proceedings in Informatics
status: public
title: The need for language support for fault-tolerant distributed systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 32
year: '2015'
...
---
_id: '1499'
abstract:
- lang: eng
text: "We consider weighted automata with both positive and negative integer weights
on edges and\r\nstudy the problem of synchronization using adaptive strategies
that may only observe whether\r\nthe current weight-level is negative or nonnegative.
We show that the synchronization problem is decidable in polynomial time for deterministic
weighted automata."
acknowledgement: "The research leading to these results has received funding from
the European Union Seventh Framework Programme (FP7/2007-2013) under grant agreement
601148 (CASSTING), EU FP7 FET project SENSATION, Sino-Danish Basic Research Center
IDAE4CPS, the European Research Council (ERC) under grant agreement 267989 (QUAREM),
the Austrian Science Fund (FWF) project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein
Award), the Czech Science Foundation under grant agreement P202/12/G061, and People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework\r\nProgramme
(FP7/2007-2013) REA Grant No 291734."
alternative_title:
- LIPIcs
author:
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Kim
full_name: Larsen, Kim
last_name: Larsen
- first_name: Simon
full_name: Laursen, Simon
last_name: Laursen
- first_name: Jiří
full_name: Srba, Jiří
last_name: Srba
citation:
ama: 'Kretinsky J, Larsen K, Laursen S, Srba J. Polynomial time decidability of
weighted synchronization under partial observability. In: Vol 42. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik; 2015:142-154. doi:10.4230/LIPIcs.CONCUR.2015.142'
apa: 'Kretinsky, J., Larsen, K., Laursen, S., & Srba, J. (2015). Polynomial
time decidability of weighted synchronization under partial observability (Vol.
42, pp. 142–154). Presented at the CONCUR: Concurrency Theory, Madrid, Spain:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142'
chicago: Kretinsky, Jan, Kim Larsen, Simon Laursen, and Jiří Srba. “Polynomial Time
Decidability of Weighted Synchronization under Partial Observability,” 42:142–54.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. https://doi.org/10.4230/LIPIcs.CONCUR.2015.142.
ieee: 'J. Kretinsky, K. Larsen, S. Laursen, and J. Srba, “Polynomial time decidability
of weighted synchronization under partial observability,” presented at the CONCUR:
Concurrency Theory, Madrid, Spain, 2015, vol. 42, pp. 142–154.'
ista: 'Kretinsky J, Larsen K, Laursen S, Srba J. 2015. Polynomial time decidability
of weighted synchronization under partial observability. CONCUR: Concurrency Theory,
LIPIcs, vol. 42, 142–154.'
mla: Kretinsky, Jan, et al. Polynomial Time Decidability of Weighted Synchronization
under Partial Observability. Vol. 42, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2015, pp. 142–54, doi:10.4230/LIPIcs.CONCUR.2015.142.
short: J. Kretinsky, K. Larsen, S. Laursen, J. Srba, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2015, pp. 142–154.
conference:
end_date: 2015-09-04
location: Madrid, Spain
name: 'CONCUR: Concurrency Theory'
start_date: 2015-09-01
date_created: 2018-12-11T11:52:22Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2021-01-12T06:51:10Z
day: '01'
ddc:
- '000'
- '003'
department:
- _id: ToHe
- _id: KrCh
doi: 10.4230/LIPIcs.CONCUR.2015.142
ec_funded: 1
file:
- access_level: open_access
checksum: 49eb5021caafaabe5356c65b9c5f8c9c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:12Z
date_updated: 2020-07-14T12:44:58Z
file_id: '4672'
file_name: IST-2016-498-v1+1_32.pdf
file_size: 623563
relation: main_file
file_date_updated: 2020-07-14T12:44:58Z
has_accepted_license: '1'
intvolume: ' 42'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 142 - 154
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5680'
pubrep_id: '498'
quality_controlled: '1'
scopus_import: 1
status: public
title: Polynomial time decidability of weighted synchronization under partial observability
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 42
year: '2015'
...
---
_id: '1501'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) which are a standard model for
probabilistic systems. We focus on qualitative properties for MDPs that can express
that desired behaviors of the system arise almost-surely (with probability 1)
or with positive probability. We introduce a new simulation relation to capture
the refinement relation of MDPs with respect to qualitative properties, and present
discrete graph algorithms with quadratic complexity to compute the simulation
relation. We present an automated technique for assume-guarantee style reasoning
for compositional analysis of two-player games by giving a counterexample guided
abstraction-refinement approach to compute our new simulation relation. We show
a tight link between two-player games and MDPs, and as a consequence the results
for games are lifted to MDPs with qualitative properties. We have implemented
our algorithms and show that the compositional analysis leads to significant improvements. '
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No. P23499- N23, FWF NFN Grant No. S11407-N23, FWF Grant S11403-N23 (RiSE),
and FWF Grant Z211-N23 (Wittgenstein Award), ERC Start Grant (279307: Graph Games),
Microsoft faculty fellows award, the ERC Advanced Grant QUAREM (Quantitative Reactive
Modeling).'
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
citation:
ama: Chatterjee K, Chmelik M, Daca P. CEGAR for compositional analysis of qualitative
properties in Markov decision processes. Formal Methods in System Design.
2015;47(2):230-264. doi:10.1007/s10703-015-0235-2
apa: Chatterjee, K., Chmelik, M., & Daca, P. (2015). CEGAR for compositional
analysis of qualitative properties in Markov decision processes. Formal Methods
in System Design. Springer. https://doi.org/10.1007/s10703-015-0235-2
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Przemyslaw Daca. “CEGAR for
Compositional Analysis of Qualitative Properties in Markov Decision Processes.”
Formal Methods in System Design. Springer, 2015. https://doi.org/10.1007/s10703-015-0235-2.
ieee: K. Chatterjee, M. Chmelik, and P. Daca, “CEGAR for compositional analysis
of qualitative properties in Markov decision processes,” Formal Methods in
System Design, vol. 47, no. 2. Springer, pp. 230–264, 2015.
ista: Chatterjee K, Chmelik M, Daca P. 2015. CEGAR for compositional analysis of
qualitative properties in Markov decision processes. Formal Methods in System
Design. 47(2), 230–264.
mla: Chatterjee, Krishnendu, et al. “CEGAR for Compositional Analysis of Qualitative
Properties in Markov Decision Processes.” Formal Methods in System Design,
vol. 47, no. 2, Springer, 2015, pp. 230–64, doi:10.1007/s10703-015-0235-2.
short: K. Chatterjee, M. Chmelik, P. Daca, Formal Methods in System Design 47 (2015)
230–264.
date_created: 2018-12-11T11:52:23Z
date_published: 2015-10-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/s10703-015-0235-2
ec_funded: 1
intvolume: ' 47'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1405.0835
month: '10'
oa: 1
oa_version: Preprint
page: 230 - 264
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Formal Methods in System Design
publication_status: published
publisher: Springer
publist_id: '5677'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: CEGAR for compositional analysis of qualitative properties in Markov decision
processes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 47
year: '2015'
...
---
_id: '1502'
abstract:
- lang: eng
text: We extend the theory of input-output conformance with operators for merge
and quotient. The former is useful when testing against multiple requirements
or views. The latter can be used to generate tests for patches of an already tested
system. Both operators can combine systems with different action alphabets, which
is usually the case when constructing complex systems and specifications from
parts, for instance different views as well as newly defined functionality of
a~previous version of the system.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989 (QUAREM), by the Austrian Science Fund (FWF)
projects S11402-N23(RiSE) and Z211-N23 (Wittgestein Award), by People Programme
(Marie Curie Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013)
under REA grant agreement 291734, and by the ARTEMIS JU under grant agreement 295373
(nSafeCer). Jan Křetínský has been partially supported by the Czech Science Foundation,
grant No. P202/12/G061. Nikola Beneš has been supported by the\r\nMEYS project
No. CZ.1.07/2.3.00/30.0009 Employment of Newly Graduated Doctors of Science for
Scientific Excellence."
alternative_title:
- 'Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering '
author:
- first_name: Nikola
full_name: Beneš, Nikola
last_name: Beneš
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Dejan
full_name: Nickovic, Dejan
last_name: Nickovic
citation:
ama: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. Complete composition
operators for IOCO-testing theory. In: ACM; 2015:101-110. doi:10.1145/2737166.2737175'
apa: 'Beneš, N., Daca, P., Henzinger, T. A., Kretinsky, J., & Nickovic, D. (2015).
Complete composition operators for IOCO-testing theory (pp. 101–110). Presented
at the CBSE: Component-Based Software Engineering , Montreal, QC, Canada: ACM.
https://doi.org/10.1145/2737166.2737175'
chicago: Beneš, Nikola, Przemyslaw Daca, Thomas A Henzinger, Jan Kretinsky, and
Dejan Nickovic. “Complete Composition Operators for IOCO-Testing Theory,” 101–10.
ACM, 2015. https://doi.org/10.1145/2737166.2737175.
ieee: 'N. Beneš, P. Daca, T. A. Henzinger, J. Kretinsky, and D. Nickovic, “Complete
composition operators for IOCO-testing theory,” presented at the CBSE: Component-Based
Software Engineering , Montreal, QC, Canada, 2015, pp. 101–110.'
ista: 'Beneš N, Daca P, Henzinger TA, Kretinsky J, Nickovic D. 2015. Complete composition
operators for IOCO-testing theory. CBSE: Component-Based Software Engineering
, Proceedings of the 18th International ACM SIGSOFT Symposium on Component-Based
Software Engineering , , 101–110.'
mla: Beneš, Nikola, et al. Complete Composition Operators for IOCO-Testing Theory.
ACM, 2015, pp. 101–10, doi:10.1145/2737166.2737175.
short: N. Beneš, P. Daca, T.A. Henzinger, J. Kretinsky, D. Nickovic, in:, ACM, 2015,
pp. 101–110.
conference:
end_date: 2015-05-08
location: Montreal, QC, Canada
name: 'CBSE: Component-Based Software Engineering '
start_date: 2015-05-04
date_created: 2018-12-11T11:52:24Z
date_published: 2015-05-01T00:00:00Z
date_updated: 2023-09-07T11:58:33Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1145/2737166.2737175
ec_funded: 1
file:
- access_level: open_access
checksum: c6ce681035c163a158751f240cb7d389
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:46Z
date_updated: 2020-07-14T12:44:59Z
file_id: '5303'
file_name: IST-2016-625-v1+1_conf-cbse-BenesDHKN15.pdf
file_size: 467561
relation: main_file
file_date_updated: 2020-07-14T12:44:59Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 101 - 110
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
isbn:
- 978-1-4503-3471-6
publication_status: published
publisher: ACM
publist_id: '5676'
pubrep_id: '625'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Complete composition operators for IOCO-testing theory
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '1538'
abstract:
- lang: eng
text: Systems biology rests on the idea that biological complexity can be better
unraveled through the interplay of modeling and experimentation. However, the
success of this approach depends critically on the informativeness of the chosen
experiments, which is usually unknown a priori. Here, we propose a systematic
scheme based on iterations of optimal experiment design, flow cytometry experiments,
and Bayesian parameter inference to guide the discovery process in the case of
stochastic biochemical reaction networks. To illustrate the benefit of our methodology,
we apply it to the characterization of an engineered light-inducible gene expression
circuit in yeast and compare the performance of the resulting model with models
identified from nonoptimal experiments. In particular, we compare the parameter
posterior distributions and the precision to which the outcome of future experiments
can be predicted. Moreover, we illustrate how the identified stochastic model
can be used to determine light induction patterns that make either the average
amount of protein or the variability in a population of cells follow a desired
profile. Our results show that optimal experiment design allows one to derive
models that are accurate enough to precisely predict and regulate the protein
expression in heterogeneous cell populations over extended periods of time.
acknowledgement: 'J.R., F.P., and J.L. acknowledge support from the European Commission
under the Network of Excellence HYCON2 (highly-complex and networked control systems)
and SystemsX.ch under the SignalX Project. J.R. acknowledges support from the People
Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme
FP7/2007-2013 under REA (Research Executive Agency) Grant 291734. M.K. acknowledges
support from Human Frontier Science Program Grant RP0061/2011 (www.hfsp.org). '
author:
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
- first_name: Francesca
full_name: Parise, Francesca
last_name: Parise
- first_name: Andreas
full_name: Milias Argeitis, Andreas
last_name: Milias Argeitis
- first_name: Mustafa
full_name: Khammash, Mustafa
last_name: Khammash
- first_name: John
full_name: Lygeros, John
last_name: Lygeros
citation:
ama: Ruess J, Parise F, Milias Argeitis A, Khammash M, Lygeros J. Iterative experiment
design guides the characterization of a light-inducible gene expression circuit.
PNAS. 2015;112(26):8148-8153. doi:10.1073/pnas.1423947112
apa: Ruess, J., Parise, F., Milias Argeitis, A., Khammash, M., & Lygeros, J.
(2015). Iterative experiment design guides the characterization of a light-inducible
gene expression circuit. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.1423947112
chicago: Ruess, Jakob, Francesca Parise, Andreas Milias Argeitis, Mustafa Khammash,
and John Lygeros. “Iterative Experiment Design Guides the Characterization of
a Light-Inducible Gene Expression Circuit.” PNAS. National Academy of Sciences,
2015. https://doi.org/10.1073/pnas.1423947112.
ieee: J. Ruess, F. Parise, A. Milias Argeitis, M. Khammash, and J. Lygeros, “Iterative
experiment design guides the characterization of a light-inducible gene expression
circuit,” PNAS, vol. 112, no. 26. National Academy of Sciences, pp. 8148–8153,
2015.
ista: Ruess J, Parise F, Milias Argeitis A, Khammash M, Lygeros J. 2015. Iterative
experiment design guides the characterization of a light-inducible gene expression
circuit. PNAS. 112(26), 8148–8153.
mla: Ruess, Jakob, et al. “Iterative Experiment Design Guides the Characterization
of a Light-Inducible Gene Expression Circuit.” PNAS, vol. 112, no. 26,
National Academy of Sciences, 2015, pp. 8148–53, doi:10.1073/pnas.1423947112.
short: J. Ruess, F. Parise, A. Milias Argeitis, M. Khammash, J. Lygeros, PNAS 112
(2015) 8148–8153.
date_created: 2018-12-11T11:52:36Z
date_published: 2015-06-30T00:00:00Z
date_updated: 2021-01-12T06:51:27Z
day: '30'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1073/pnas.1423947112
ec_funded: 1
external_id:
pmid:
- '26085136'
intvolume: ' 112'
issue: '26'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC4491780/
month: '06'
oa: 1
oa_version: Submitted Version
page: 8148 - 8153
pmid: 1
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: PNAS
publication_status: published
publisher: National Academy of Sciences
publist_id: '5633'
quality_controlled: '1'
scopus_import: 1
status: public
title: Iterative experiment design guides the characterization of a light-inducible
gene expression circuit
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2015'
...
---
_id: '1539'
abstract:
- lang: eng
text: 'Many stochastic models of biochemical reaction networks contain some chemical
species for which the number of molecules that are present in the system can only
be finite (for instance due to conservation laws), but also other species that
can be present in arbitrarily large amounts. The prime example of such networks
are models of gene expression, which typically contain a small and finite number
of possible states for the promoter but an infinite number of possible states
for the amount of mRNA and protein. One of the main approaches to analyze such
models is through the use of equations for the time evolution of moments of the
chemical species. Recently, a new approach based on conditional moments of the
species with infinite state space given all the different possible states of the
finite species has been proposed. It was argued that this approach allows one
to capture more details about the full underlying probability distribution with
a smaller number of equations. Here, I show that the result that less moments
provide more information can only stem from an unnecessarily complicated description
of the system in the classical formulation. The foundation of this argument will
be the derivation of moment equations that describe the complete probability distribution
over the finite state space but only low-order moments over the infinite state
space. I will show that the number of equations that is needed is always less
than what was previously claimed and always less than the number of conditional
moment equations up to the same order. To support these arguments, a symbolic
algorithm is provided that can be used to derive minimal systems of unconditional
moment equations for models with partially finite state space. '
article_number: '244103'
author:
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
citation:
ama: Ruess J. Minimal moment equations for stochastic models of biochemical reaction
networks with partially finite state space. Journal of Chemical Physics.
2015;143(24). doi:10.1063/1.4937937
apa: Ruess, J. (2015). Minimal moment equations for stochastic models of biochemical
reaction networks with partially finite state space. Journal of Chemical Physics.
American Institute of Physics. https://doi.org/10.1063/1.4937937
chicago: Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical
Reaction Networks with Partially Finite State Space.” Journal of Chemical Physics.
American Institute of Physics, 2015. https://doi.org/10.1063/1.4937937.
ieee: J. Ruess, “Minimal moment equations for stochastic models of biochemical reaction
networks with partially finite state space,” Journal of Chemical Physics,
vol. 143, no. 24. American Institute of Physics, 2015.
ista: Ruess J. 2015. Minimal moment equations for stochastic models of biochemical
reaction networks with partially finite state space. Journal of Chemical Physics.
143(24), 244103.
mla: Ruess, Jakob. “Minimal Moment Equations for Stochastic Models of Biochemical
Reaction Networks with Partially Finite State Space.” Journal of Chemical Physics,
vol. 143, no. 24, 244103, American Institute of Physics, 2015, doi:10.1063/1.4937937.
short: J. Ruess, Journal of Chemical Physics 143 (2015).
date_created: 2018-12-11T11:52:36Z
date_published: 2015-12-22T00:00:00Z
date_updated: 2021-01-12T06:51:28Z
day: '22'
ddc:
- '000'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1063/1.4937937
ec_funded: 1
file:
- access_level: open_access
checksum: 838657118ae286463a2b7737319f35ce
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:43Z
date_updated: 2020-07-14T12:45:01Z
file_id: '4641'
file_name: IST-2016-593-v1+1_Minimal_moment_equations.pdf
file_size: 605355
relation: main_file
file_date_updated: 2020-07-14T12:45:01Z
has_accepted_license: '1'
intvolume: ' 143'
issue: '24'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Journal of Chemical Physics
publication_status: published
publisher: American Institute of Physics
publist_id: '5632'
pubrep_id: '593'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimal moment equations for stochastic models of biochemical reaction networks
with partially finite state space
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 143
year: '2015'
...
---
_id: '1541'
abstract:
- lang: eng
text: We present XSpeed a parallel state-space exploration algorithm for continuous
systems with linear dynamics and nondeterministic inputs. The motivation of having
parallel algorithms is to exploit the computational power of multi-core processors
to speed-up performance. The parallelization is achieved on two fronts. First,
we propose a parallel implementation of the support function algorithm by sampling
functions in parallel. Second, we propose a parallel state-space exploration by
slicing the time horizon and computing the reachable states in the time slices
in parallel. The second method can be however applied only to a class of linear
systems with invertible dynamics and fixed input. A GP-GPU implementation is also
presented following a lazy evaluation strategy on support functions. The parallel
algorithms are implemented in the tool XSpeed. We evaluated the performance on
two benchmarks including an 28 dimension Helicopter model. Comparison with the
sequential counterpart shows a maximum speed-up of almost 7× on a 6 core, 12 thread
Intel Xeon CPU E5-2420 processor. Our GP-GPU implementation shows a maximum speed-up
of 12× over the sequential implementation and 53× over SpaceEx (LGG scenario),
the state of the art tool for reachability analysis of linear hybrid systems.
Experiments illustrate that our parallel algorithm with time slicing not only
speeds-up performance but also improves precision.
acknowledgement: This work was supported in part by the European Research Council
(ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants
S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).
alternative_title:
- LNCS
author:
- first_name: Rajarshi
full_name: Ray, Rajarshi
last_name: Ray
- first_name: Amit
full_name: Gurung, Amit
last_name: Gurung
- first_name: Binayak
full_name: Das, Binayak
last_name: Das
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Ray R, Gurung A, Das B, Bartocci E, Bogomolov S, Grosu R. XSpeed: Accelerating
reachability analysis on multi-core processors. 2015;9434:3-18. doi:10.1007/978-3-319-26287-1_1'
apa: 'Ray, R., Gurung, A., Das, B., Bartocci, E., Bogomolov, S., & Grosu, R.
(2015). XSpeed: Accelerating reachability analysis on multi-core processors. Presented
at the HVC: Haifa Verification Conference, Haifa, Israel: Springer. https://doi.org/10.1007/978-3-319-26287-1_1'
chicago: 'Ray, Rajarshi, Amit Gurung, Binayak Das, Ezio Bartocci, Sergiy Bogomolov,
and Radu Grosu. “XSpeed: Accelerating Reachability Analysis on Multi-Core Processors.”
Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-319-26287-1_1.'
ieee: 'R. Ray, A. Gurung, B. Das, E. Bartocci, S. Bogomolov, and R. Grosu, “XSpeed:
Accelerating reachability analysis on multi-core processors,” vol. 9434. Springer,
pp. 3–18, 2015.'
ista: 'Ray R, Gurung A, Das B, Bartocci E, Bogomolov S, Grosu R. 2015. XSpeed: Accelerating
reachability analysis on multi-core processors. 9434, 3–18.'
mla: 'Ray, Rajarshi, et al. XSpeed: Accelerating Reachability Analysis on Multi-Core
Processors. Vol. 9434, Springer, 2015, pp. 3–18, doi:10.1007/978-3-319-26287-1_1.'
short: R. Ray, A. Gurung, B. Das, E. Bartocci, S. Bogomolov, R. Grosu, 9434 (2015)
3–18.
conference:
end_date: 2015-11-19
location: Haifa, Israel
name: 'HVC: Haifa Verification Conference'
start_date: 2015-11-17
date_created: 2018-12-11T11:52:37Z
date_published: 2015-11-28T00:00:00Z
date_updated: 2020-08-11T10:09:17Z
day: '28'
department:
- _id: ToHe
doi: 10.1007/978-3-319-26287-1_1
ec_funded: 1
intvolume: ' 9434'
language:
- iso: eng
month: '11'
oa_version: None
page: 3 - 18
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
publication_status: published
publisher: Springer
publist_id: '5630'
quality_controlled: '1'
scopus_import: 1
series_title: Lecture Notes in Computer Science
status: public
title: 'XSpeed: Accelerating reachability analysis on multi-core processors'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9434
year: '2015'
...
---
_id: '1594'
abstract:
- lang: eng
text: Quantitative extensions of temporal logics have recently attracted significant
attention. In this work, we study frequency LTL (fLTL), an extension of LTL which
allows to speak about frequencies of events along an execution. Such an extension
is particularly useful for probabilistic systems that often cannot fulfil strict
qualitative guarantees on the behaviour. It has been recently shown that controller
synthesis for Markov decision processes and fLTL is decidable when all the bounds
on frequencies are 1. As a step towards a complete quantitative solution, we show
that the problem is decidable for the fragment fLTL\GU, where U does not occur
in the scope of G (but still F can). Our solution is based on a novel translation
of such quantitative formulae into equivalent deterministic automata.
acknowledgement: "This work is partly supported by the German Research Council (DFG)
as part of the Transregional Collaborative Research Center AVACS (SFB/TR 14), by
the Czech Science Foundation under grant agreement P202/12/G061, by the EU 7th Framework
Programme under grant agreement no. 295261 (MEALS) and 318490 (SENSATION), by the
CDZ project 1023 (CAP), by the CAS/SAFEA International Partnership Program for Creative
Research Teams, by the EPSRC grant EP/M023656/1, by the People Programme (Marie
Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013)
REA Grant No 291734, by the Austrian Science Fund (FWF) S11407-N23 (RiSE/SHiNE),
and by the ERC Start Grant (279307: Graph Games).\r\n"
alternative_title:
- LNCS
author:
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Jan
full_name: Krčál, Jan
last_name: Krčál
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Forejt V, Krčál J, Kretinsky J. Controller synthesis for MDPs and frequency
LTL\GU. In: Vol 9450. Springer; 2015:162-177. doi:10.1007/978-3-662-48899-7_12'
apa: 'Forejt, V., Krčál, J., & Kretinsky, J. (2015). Controller synthesis for
MDPs and frequency LTL\GU (Vol. 9450, pp. 162–177). Presented at the LPAR: Logic
for Programming, Artificial Intelligence, and Reasoning, Suva, Fiji: Springer.
https://doi.org/10.1007/978-3-662-48899-7_12'
chicago: Forejt, Vojtěch, Jan Krčál, and Jan Kretinsky. “Controller Synthesis for
MDPs and Frequency LTL\GU,” 9450:162–77. Springer, 2015. https://doi.org/10.1007/978-3-662-48899-7_12.
ieee: 'V. Forejt, J. Krčál, and J. Kretinsky, “Controller synthesis for MDPs and
frequency LTL\GU,” presented at the LPAR: Logic for Programming, Artificial Intelligence,
and Reasoning, Suva, Fiji, 2015, vol. 9450, pp. 162–177.'
ista: 'Forejt V, Krčál J, Kretinsky J. 2015. Controller synthesis for MDPs and frequency
LTL\GU. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS,
vol. 9450, 162–177.'
mla: Forejt, Vojtěch, et al. Controller Synthesis for MDPs and Frequency LTL\GU.
Vol. 9450, Springer, 2015, pp. 162–77, doi:10.1007/978-3-662-48899-7_12.
short: V. Forejt, J. Krčál, J. Kretinsky, in:, Springer, 2015, pp. 162–177.
conference:
end_date: 2015-11-28
location: Suva, Fiji
name: 'LPAR: Logic for Programming, Artificial Intelligence, and Reasoning'
start_date: 2015-11-24
date_created: 2018-12-11T11:52:55Z
date_published: 2015-11-22T00:00:00Z
date_updated: 2021-01-12T06:51:50Z
day: '22'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-662-48899-7_12
ec_funded: 1
intvolume: ' 9450'
language:
- iso: eng
month: '11'
oa_version: None
page: 162 - 177
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_status: published
publisher: Springer
publist_id: '5577'
quality_controlled: '1'
scopus_import: 1
status: public
title: Controller synthesis for MDPs and frequency LTL\GU
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9450
year: '2015'
...
---
_id: '1601'
abstract:
- lang: eng
text: We propose a flexible exchange format for ω-automata, as typically used in
formal verification, and implement support for it in a range of established tools.
Our aim is to simplify the interaction of tools, helping the research community
to build upon other people’s work. A key feature of the format is the use of very
generic acceptance conditions, specified by Boolean combinations of acceptance
primitives, rather than being limited to common cases such as Büchi, Streett,
or Rabin. Such flexibility in the choice of acceptance conditions can be exploited
in applications, for example in probabilistic model checking, and furthermore
encourages the development of acceptance-agnostic tools for automata manipulations.
The format allows acceptance conditions that are either state-based or transition-based,
and also supports alternating automata.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Tomáš
full_name: Babiak, Tomáš
last_name: Babiak
- first_name: František
full_name: Blahoudek, František
last_name: Blahoudek
- first_name: Alexandre
full_name: Duret Lutz, Alexandre
last_name: Duret Lutz
- first_name: Joachim
full_name: Klein, Joachim
last_name: Klein
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
- first_name: Daniel
full_name: Mueller, Daniel
last_name: Mueller
- first_name: David
full_name: Parker, David
last_name: Parker
- first_name: Jan
full_name: Strejček, Jan
last_name: Strejček
citation:
ama: 'Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format.
In: Vol 9206. Springer; 2015:479-486. doi:10.1007/978-3-319-21690-4_31'
apa: 'Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller,
D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486).
Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States:
Springer. https://doi.org/10.1007/978-3-319-21690-4_31'
chicago: Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein,
Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata
Format,” 9206:479–86. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_31.
ieee: 'T. Babiak et al., “The Hanoi omega-automata format,” presented at
the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015,
vol. 9206, pp. 479–486.'
ista: 'Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker
D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification,
LNCS, vol. 9206, 479–486.'
mla: Babiak, Tomáš, et al. The Hanoi Omega-Automata Format. Vol. 9206, Springer,
2015, pp. 479–86, doi:10.1007/978-3-319-21690-4_31.
short: T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller,
D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:52:57Z
date_published: 2015-07-16T00:00:00Z
date_updated: 2021-01-12T06:51:54Z
day: '16'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1007/978-3-319-21690-4_31
ec_funded: 1
file:
- access_level: open_access
checksum: 5885236fa88a439baba9ac6f3e801e93
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:38:12Z
date_updated: 2020-07-14T12:45:04Z
file_id: '7850'
file_name: 2015_CAV_Babiak.pdf
file_size: 1651779
relation: main_file
file_date_updated: 2020-07-14T12:45:04Z
has_accepted_license: '1'
intvolume: ' 9206'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 479 - 486
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5566'
quality_controlled: '1'
scopus_import: 1
status: public
title: The Hanoi omega-automata format
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9206
year: '2015'
...
---
_id: '1603'
abstract:
- lang: eng
text: "For deterministic systems, a counterexample to a property can simply be an
error trace, whereas counterexamples in probabilistic systems are necessarily
more complex. For instance, a set of erroneous traces with a sufficient cumulative
probability mass can be used. Since these are too large objects to understand
and manipulate, compact representations such as subchains have been considered.
In the case of probabilistic systems with non-determinism, the situation is even
more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism)
is a straightforward choice, we take a different approach. Instead, we focus on
the strategy itself, and extract the most important decisions it makes, and present
its succinct representation.\r\nThe key tools we employ to achieve this are (1)
introducing a concept of importance of a state w.r.t. the strategy, and (2) learning
using decision trees. There are three main consequent advantages of our approach.
Firstly, it exploits the quantitative information on states, stressing the more
important decisions. Secondly, it leads to a greater variability and degree of
freedom in representing the strategies. Thirdly, the representation uses a self-explanatory
data structure. In summary, our approach produces more succinct and more explainable
strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental
results show that we can extract several rules describing the strategy even for
very large systems that do not fit in memory, and based on the rules explain the
erroneous behaviour."
acknowledgement: This research was funded in part by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award),
European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989
(QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme
(Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013)
REA Grant No 291734.
alternative_title:
- LNCS
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
- first_name: Jan
full_name: Kretinsky, Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
orcid: 0000-0002-8122-2881
citation:
ama: 'Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample
explanation by learning small strategies in Markov decision processes. In: Vol
9206. Springer; 2015:158-177. doi:10.1007/978-3-319-21690-4_10'
apa: 'Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., & Kretinsky, J.
(2015). Counterexample explanation by learning small strategies in Markov decision
processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification,
San Francisco, CA, United States: Springer. https://doi.org/10.1007/978-3-319-21690-4_10'
chicago: Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner,
and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in
Markov Decision Processes,” 9206:158–77. Springer, 2015. https://doi.org/10.1007/978-3-319-21690-4_10.
ieee: 'T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample
explanation by learning small strategies in Markov decision processes,” presented
at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015,
vol. 9206, pp. 158–177.'
ista: 'Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample
explanation by learning small strategies in Markov decision processes. CAV: Computer
Aided Verification, LNCS, vol. 9206, 158–177.'
mla: Brázdil, Tomáš, et al. Counterexample Explanation by Learning Small Strategies
in Markov Decision Processes. Vol. 9206, Springer, 2015, pp. 158–77, doi:10.1007/978-3-319-21690-4_10.
short: T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer,
2015, pp. 158–177.
conference:
end_date: 2015-07-24
location: San Francisco, CA, United States
name: 'CAV: Computer Aided Verification'
start_date: 2015-07-18
date_created: 2018-12-11T11:52:58Z
date_published: 2015-07-16T00:00:00Z
date_updated: 2024-02-21T13:52:07Z
day: '16'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-21690-4_10
ec_funded: 1
intvolume: ' 9206'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1502.02834
month: '07'
oa: 1
oa_version: Preprint
page: 158 - 177
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_identifier:
eisbn:
- 978-3-319-21690-4
publication_status: published
publisher: Springer
publist_id: '5564'
quality_controlled: '1'
related_material:
record:
- id: '5549'
relation: research_paper
status: public
scopus_import: 1
status: public
title: Counterexample explanation by learning small strategies in Markov decision
processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9206
year: '2015'
...
---
_id: '1605'
abstract:
- lang: eng
text: Multiaffine hybrid automata (MHA) represent a powerful formalism to model
complex dynamical systems. This formalism is particularly suited for the representation
of biological systems which often exhibit highly non-linear behavior. In this
paper, we consider the problem of parameter identification for MHA. We present
an abstraction of MHA based on linear hybrid automata, which can be analyzed by
the SpaceEx model checker. This abstraction enables a precise handling of time-dependent
properties. We demonstrate the potential of our approach on a model of a genetic
regulatory network and a myocyte model.
acknowledgement: This work was partly supported by the European Research Council (ERC)
under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23,
S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), and by
the German Research Foundation (DFG) as part of the Transregional Collaborative
Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR
14 AVACS, http://www.avacs.org/).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Grégory
full_name: Batt, Grégory
last_name: Batt
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Radu
full_name: Grosu, Radu
last_name: Grosu
citation:
ama: 'Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. Abstraction-based
parameter synthesis for multiaffine systems. In: Vol 9434. Springer; 2015:19-35.
doi:10.1007/978-3-319-26287-1_2'
apa: 'Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., & Grosu,
R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol.
9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa,
Israel: Springer. https://doi.org/10.1007/978-3-319-26287-1_2'
chicago: Bogomolov, Sergiy, Christian Schilling, Ezio Bartocci, Grégory Batt, Hui
Kong, and Radu Grosu. “Abstraction-Based Parameter Synthesis for Multiaffine Systems,”
9434:19–35. Springer, 2015. https://doi.org/10.1007/978-3-319-26287-1_2.
ieee: 'S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, and R. Grosu,
“Abstraction-based parameter synthesis for multiaffine systems,” presented at
the HVC: Haifa Verification Conference, Haifa, Israel, 2015, vol. 9434, pp. 19–35.'
ista: 'Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. 2015. Abstraction-based
parameter synthesis for multiaffine systems. HVC: Haifa Verification Conference,
LNCS, vol. 9434, 19–35.'
mla: Bogomolov, Sergiy, et al. Abstraction-Based Parameter Synthesis for Multiaffine
Systems. Vol. 9434, Springer, 2015, pp. 19–35, doi:10.1007/978-3-319-26287-1_2.
short: S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, R. Grosu, in:,
Springer, 2015, pp. 19–35.
conference:
end_date: 2015-11-19
location: Haifa, Israel
name: 'HVC: Haifa Verification Conference'
start_date: 2015-11-17
date_created: 2018-12-11T11:52:59Z
date_published: 2015-11-28T00:00:00Z
date_updated: 2021-01-12T06:51:56Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-26287-1_2
ec_funded: 1
file:
- access_level: open_access
checksum: 3aab260f3f34641d622030ba22645b3e
content_type: application/pdf
creator: dernst
date_created: 2020-05-15T08:43:19Z
date_updated: 2020-07-14T12:45:05Z
file_id: '7851'
file_name: 2015_LNCS_Bogomolov.pdf
file_size: 1053207
relation: main_file
file_date_updated: 2020-07-14T12:45:05Z
has_accepted_license: '1'
intvolume: ' 9434'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 19 - 35
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: Springer
publist_id: '5561'
quality_controlled: '1'
scopus_import: 1
status: public
title: Abstraction-based parameter synthesis for multiaffine systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9434
year: '2015'
...
---
_id: '1606'
abstract:
- lang: eng
text: 'In this paper, we present the first steps toward a runtime verification framework
for monitoring hybrid and cyber-physical systems (CPS) development tools based
on randomized differential testing. The development tools include hybrid systems
reachability analysis tools, model-based development environments like Simulink/Stateflow
(SLSF), etc. First, hybrid automaton models are randomly generated. Next, these
hybrid automaton models are translated to a number of different tools (currently,
SpaceEx, dReach, Flow*, HyCreate, and the MathWorks’ Simulink/Stateflow) using
the HyST source transformation and translation tool. Then, the hybrid automaton
models are executed in the different tools and their outputs are parsed. The final
step is the differential comparison: the outputs of the different tools are compared.
If the results do not agree (in the sense that an analysis or verification result
from one tool does not match that of another tool, ignoring timeouts, etc.), a
candidate bug is flagged and the model is saved for future analysis by the user.
The process then repeats and the monitoring continues until the user terminates
the process. We present preliminary results that have been useful in identifying
a few bugs in the analysis methods of different development tools, and in an earlier
version of HyST.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luan
full_name: Nguyen, Luan
last_name: Nguyen
- first_name: Christian
full_name: Schilling, Christian
last_name: Schilling
- first_name: Sergiy
full_name: Bogomolov, Sergiy
id: 369D9A44-F248-11E8-B48F-1D18A9856A87
last_name: Bogomolov
orcid: 0000-0002-0686-0365
- first_name: Taylor
full_name: Johnson, Taylor
last_name: Johnson
citation:
ama: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. Runtime verification for hybrid
analysis tools. In: 6th International Conference. Vol 9333. Springer Nature;
2015:281-286. doi:10.1007/978-3-319-23820-3_19'
apa: 'Nguyen, L., Schilling, C., Bogomolov, S., & Johnson, T. (2015). Runtime
verification for hybrid analysis tools. In 6th International Conference
(Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature. https://doi.org/10.1007/978-3-319-23820-3_19'
chicago: Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson.
“Runtime Verification for Hybrid Analysis Tools.” In 6th International Conference,
9333:281–86. Springer Nature, 2015. https://doi.org/10.1007/978-3-319-23820-3_19.
ieee: L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, “Runtime verification
for hybrid analysis tools,” in 6th International Conference, Vienna, Austria,
2015, vol. 9333, pp. 281–286.
ista: 'Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Runtime verification
for hybrid analysis tools. 6th International Conference. RV: Runtime Verification,
LNCS, vol. 9333, 281–286.'
mla: Nguyen, Luan, et al. “Runtime Verification for Hybrid Analysis Tools.” 6th
International Conference, vol. 9333, Springer Nature, 2015, pp. 281–86, doi:10.1007/978-3-319-23820-3_19.
short: L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, in:, 6th International
Conference, Springer Nature, 2015, pp. 281–286.
conference:
end_date: 2015-09-25
location: Vienna, Austria
name: 'RV: Runtime Verification'
start_date: 2015-09-22
date_created: 2018-12-11T11:52:59Z
date_published: 2015-11-15T00:00:00Z
date_updated: 2022-02-01T14:52:59Z
day: '15'
department:
- _id: ToHe
doi: 10.1007/978-3-319-23820-3_19
ec_funded: 1
intvolume: ' 9333'
language:
- iso: eng
month: '11'
oa_version: None
page: 281 - 286
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 6th International Conference
publication_identifier:
isbn:
- 978-3-319-23819-7
publication_status: published
publisher: Springer Nature
publist_id: '5562'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Runtime verification for hybrid analysis tools
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9333
year: '2015'
...
---
_id: '1610'
abstract:
- lang: eng
text: The edit distance between two words w1, w2 is the minimal number of word operations
(letter insertions, deletions, and substitutions) necessary to transform w1 to
w2. The edit distance generalizes to languages L1,L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses. The problem of computing edit
distance to pushdown automata is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. In: 42nd International Colloquium. Vol 9135. Springer Nature;
2015:121-133. doi:10.1007/978-3-662-47666-6_10'
apa: 'Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. In 42nd International Colloquium (Vol.
9135, pp. 121–133). Kyoto, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-47666-6_10'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” In 42nd International Colloquium,
9135:121–33. Springer Nature, 2015. https://doi.org/10.1007/978-3-662-47666-6_10.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” in 42nd International Colloquium, Kyoto, Japan,
2015, vol. 9135, no. Part II, pp. 121–133.
ista: 'Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata. 42nd International Colloquium. ICALP: Automata, Languages and
Programming, LNCS, vol. 9135, 121–133.'
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” 42nd
International Colloquium, vol. 9135, no. Part II, Springer Nature, 2015, pp.
121–33, doi:10.1007/978-3-662-47666-6_10.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, in:, 42nd International
Colloquium, Springer Nature, 2015, pp. 121–133.
conference:
end_date: 2015-07-10
location: Kyoto, Japan
name: 'ICALP: Automata, Languages and Programming'
start_date: 2015-07-06
date_created: 2018-12-11T11:53:01Z
date_published: 2015-07-01T00:00:00Z
date_updated: 2023-02-23T12:26:24Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-47666-6_10
ec_funded: 1
external_id:
arxiv:
- '1504.08259'
intvolume: ' 9135'
issue: Part II
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.08259
month: '07'
oa: 1
oa_version: None
page: 121 - 133
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: 42nd International Colloquium
publication_identifier:
isbn:
- 978-3-662-47665-9
publication_status: published
publisher: Springer Nature
publist_id: '5556'
pubrep_id: '321'
quality_controlled: '1'
related_material:
record:
- id: '465'
relation: later_version
status: public
- id: '5438'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Edit distance for pushdown automata
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9135
year: '2015'
...
---
_id: '1702'
abstract:
- lang: eng
text: In this paper we present INTERHORN, a solver for recursion-free Horn clauses.
The main application domain of INTERHORN lies in solving interpolation problems
arising in software verification. We show how a range of interpolation problems,
including path, transition, nested, state/transition and well-founded interpolation
can be handled directly by INTERHORN. By detailing these interpolation problems
and their Horn clause representations, we hope to encourage the emergence of a
common back-end interpolation interface useful for diverse verification tools.
alternative_title:
- EPTCS
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Corneliu
full_name: Popeea, Corneliu
last_name: Popeea
- first_name: Andrey
full_name: Rybalchenko, Andrey
last_name: Rybalchenko
citation:
ama: 'Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion
free-horn clauses. In: Electronic Proceedings in Theoretical Computer Science,
EPTCS. Vol 169. Open Publishing; 2014:31-38. doi:10.4204/EPTCS.169.5'
apa: 'Gupta, A., Popeea, C., & Rybalchenko, A. (2014). Generalised interpolation
by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical
Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing.
https://doi.org/10.4204/EPTCS.169.5'
chicago: Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised
Interpolation by Solving Recursion Free-Horn Clauses.” In Electronic Proceedings
in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing, 2014.
https://doi.org/10.4204/EPTCS.169.5.
ieee: A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving
recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer
Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.
ista: 'Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving
recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science,
EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.'
mla: Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn
Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS,
vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5.
short: A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical
Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.
conference:
end_date: 2014-07-17
location: Vienna, Austria
name: 'HCVS: Horn Clauses for Verification and Synthesis'
start_date: 2014-07-17
date_created: 2018-12-11T11:53:33Z
date_published: 2014-12-02T00:00:00Z
date_updated: 2021-01-12T06:52:38Z
day: '02'
department:
- _id: ToHe
doi: 10.4204/EPTCS.169.5
intvolume: ' 169'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.7378v2
month: '12'
oa: 1
oa_version: Submitted Version
page: 31 - 38
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing
publist_id: '5435'
quality_controlled: '1'
status: public
title: Generalised interpolation by solving recursion free-horn clauses
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 169
year: '2014'
...
---
_id: '1733'
abstract:
- lang: eng
text: The classical (boolean) notion of refinement for behavioral interfaces of
system components is the alternating refinement preorder. In this paper, we define
a distance for interfaces, called interface simulation distance. It makes the
alternating refinement preorder quantitative by, intuitively, tolerating errors
(while counting them) in the alternating simulation game. We show that the interface
simulation distance satisfies the triangle inequality, that the distance between
two interfaces does not increase under parallel composition with a third interface,
that the distance between two interfaces can be bounded from above and below by
distances between abstractions of the two interfaces, and how to synthesize an
interface from incompatible requirements. We illustrate the framework, and the
properties of the distances under composition of interfaces, with two case studies.
author:
- first_name: Pavol
full_name: Cerny, Pavol
last_name: Cerny
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Arjun
full_name: Radhakrishna, Arjun
id: 3B51CAC4-F248-11E8-B48F-1D18A9856A87
last_name: Radhakrishna
citation:
ama: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances.
Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019
apa: Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface
simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019
chicago: Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna.
“Interface Simulation Distances.” Theoretical Computer Science. Elsevier,
2014. https://doi.org/10.1016/j.tcs.2014.08.019.
ieee: P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation
distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp.
348–363, 2014.
ista: Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation
distances. Theoretical Computer Science. 560(3), 348–363.
mla: Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer
Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.
short: P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer
Science 560 (2014) 348–363.
date_created: 2018-12-11T11:53:43Z
date_published: 2014-12-04T00:00:00Z
date_updated: 2023-02-23T11:04:00Z
day: '04'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1016/j.tcs.2014.08.019
ec_funded: 1
intvolume: ' 560'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1210.2450
month: '12'
oa: 1
oa_version: Submitted Version
page: 348 - 363
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '5392'
quality_controlled: '1'
related_material:
record:
- id: '2916'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Interface simulation distances
type: journal_article
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 560
year: '2014'
...
---
_id: '1869'
abstract:
- lang: eng
text: Boolean controllers for systems with complex datapaths are often very difficult
to implement correctly, in particular when concurrency is involved. Yet, in many
instances it is easy to formally specify correctness. For example, the specification
for the controller of a pipelined processor only has to state that the pipelined
processor gives the same results as a non-pipelined reference design. This makes
such controllers a good target for automated synthesis. However, an efficient
abstraction for the complex datapath elements is needed, as a bit-precise description
is often infeasible. We present Suraq, the first controller synthesis tool which
uses uninterpreted functions for the abstraction. Quantified firstorder formulas
(with specific quantifier structure) serve as the specification language from
which Suraq synthesizes Boolean controllers. Suraq transforms the specification
into an unsatisfiable SMT formula, and uses Craig interpolation to compute its
results. Using Suraq, we were able to synthesize a controller (consisting of two
Boolean signals) for a five-stage pipelined DLX processor in roughly one hour
and 15 minutes.
acknowledgement: The work presented in this paper was supported in part by the European
Research Council (ERC) under grant agreement QUAINT (I774-N23)
alternative_title:
- LNCS
author:
- first_name: Georg
full_name: Hofferek, Georg
last_name: Hofferek
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
citation:
ama: 'Hofferek G, Gupta A. Suraq - a controller synthesis tool using uninterpreted
functions. In: Yahav E, ed. HVC 2014. Vol 8855. Springer; 2014:68-74. doi:10.1007/978-3-319-13338-6_6'
apa: 'Hofferek, G., & Gupta, A. (2014). Suraq - a controller synthesis tool
using uninterpreted functions. In E. Yahav (Ed.), HVC 2014 (Vol. 8855,
pp. 68–74). Haifa, Israel: Springer. https://doi.org/10.1007/978-3-319-13338-6_6'
chicago: Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool
Using Uninterpreted Functions.” In HVC 2014, edited by Eran Yahav, 8855:68–74.
Springer, 2014. https://doi.org/10.1007/978-3-319-13338-6_6.
ieee: G. Hofferek and A. Gupta, “Suraq - a controller synthesis tool using uninterpreted
functions,” in HVC 2014, Haifa, Israel, 2014, vol. 8855, pp. 68–74.
ista: 'Hofferek G, Gupta A. 2014. Suraq - a controller synthesis tool using uninterpreted
functions. HVC 2014. HVC: Haifa Verification Conference, LNCS, vol. 8855, 68–74.'
mla: Hofferek, Georg, and Ashutosh Gupta. “Suraq - a Controller Synthesis Tool Using
Uninterpreted Functions.” HVC 2014, edited by Eran Yahav, vol. 8855, Springer,
2014, pp. 68–74, doi:10.1007/978-3-319-13338-6_6.
short: G. Hofferek, A. Gupta, in:, E. Yahav (Ed.), HVC 2014, Springer, 2014, pp.
68–74.
conference:
end_date: 2014-11-20
location: Haifa, Israel
name: 'HVC: Haifa Verification Conference'
start_date: 2014-11-18
date_created: 2018-12-11T11:54:27Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:44Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-319-13338-6_6
ec_funded: 1
editor:
- first_name: Eran
full_name: Yahav, Eran
last_name: Yahav
intvolume: ' 8855'
language:
- iso: eng
month: '01'
oa_version: None
page: 68 - 74
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: HVC 2014
publication_status: published
publisher: Springer
publist_id: '5228'
quality_controlled: '1'
status: public
title: Suraq - a controller synthesis tool using uninterpreted functions
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8855
year: '2014'
...
---
_id: '1870'
abstract:
- lang: eng
text: We investigate the problem of checking if a finite-state transducer is robust
to uncertainty in its input. Our notion of robustness is based on the analytic
notion of Lipschitz continuity - a transducer is K-(Lipschitz) robust if the perturbation
in its output is at most K times the perturbation in its input. We quantify input
and output perturbation using similarity functions. We show that K-robustness
is undecidable even for deterministic transducers. We identify a class of functional
transducers, which admits a polynomial time automata-theoretic decision procedure
for K-robustness. This class includes Mealy machines and functional letter-to-letter
transducers. We also study K-robustness of nondeterministic transducers. Since
a nondeterministic transducer generates a set of output words for each input word,
we quantify output perturbation using setsimilarity functions. We show that K-robustness
of nondeterministic transducers is undecidable, even for letter-to-letter transducers.
We identify a class of set-similarity functions which admit decidable K-robustness
of letter-to-letter transducers.
alternative_title:
- LIPIcs
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
citation:
ama: 'Henzinger TA, Otop J, Samanta R. Lipschitz robustness of finite-state transducers.
In: Leibniz International Proceedings in Informatics, LIPIcs. Vol 29. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2014:431-443. doi:10.4230/LIPIcs.FSTTCS.2014.431'
apa: 'Henzinger, T. A., Otop, J., & Samanta, R. (2014). Lipschitz robustness
of finite-state transducers. In Leibniz International Proceedings in Informatics,
LIPIcs (Vol. 29, pp. 431–443). Delhi, India: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431'
chicago: Henzinger, Thomas A, Jan Otop, and Roopsha Samanta. “Lipschitz Robustness
of Finite-State Transducers.” In Leibniz International Proceedings in Informatics,
LIPIcs, 29:431–43. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014.
https://doi.org/10.4230/LIPIcs.FSTTCS.2014.431.
ieee: T. A. Henzinger, J. Otop, and R. Samanta, “Lipschitz robustness of finite-state
transducers,” in Leibniz International Proceedings in Informatics, LIPIcs,
Delhi, India, 2014, vol. 29, pp. 431–443.
ista: 'Henzinger TA, Otop J, Samanta R. 2014. Lipschitz robustness of finite-state
transducers. Leibniz International Proceedings in Informatics, LIPIcs. FSTTCS:
Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol.
29, 431–443.'
mla: Henzinger, Thomas A., et al. “Lipschitz Robustness of Finite-State Transducers.”
Leibniz International Proceedings in Informatics, LIPIcs, vol. 29, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2014, pp. 431–43, doi:10.4230/LIPIcs.FSTTCS.2014.431.
short: T.A. Henzinger, J. Otop, R. Samanta, in:, Leibniz International Proceedings
in Informatics, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014,
pp. 431–443.
conference:
end_date: 2014-12-17
location: Delhi, India
name: 'FSTTCS: Foundations of Software Technology and Theoretical Computer Science'
start_date: 2014-12-15
date_created: 2018-12-11T11:54:27Z
date_published: 2014-12-01T00:00:00Z
date_updated: 2021-01-12T06:53:45Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.FSTTCS.2014.431
file:
- access_level: open_access
checksum: 7b1aff1710a8bffb7080ec07f62d9a17
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:11Z
date_updated: 2020-07-14T12:45:19Z
file_id: '4734'
file_name: IST-2017-804-v1+1_37.pdf
file_size: 562151
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 29'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 431 - 443
publication: Leibniz International Proceedings in Informatics, LIPIcs
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '5227'
pubrep_id: '804'
quality_controlled: '1'
status: public
title: Lipschitz robustness of finite-state transducers
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2014'
...
---
_id: '1872'
abstract:
- lang: eng
text: Extensionality axioms are common when reasoning about data collections, such
as arrays and functions in program analysis, or sets in mathematics. An extensionality
axiom asserts that two collections are equal if they consist of the same elements
at the same indices. Using extensionality is often required to show that two collections
are equal. A typical example is the set theory theorem (∀x)(∀y)x∪y = y ∪x. Interestingly,
while humans have no problem with proving such set identities using extensionality,
they are very hard for superposition theorem provers because of the calculi they
use. In this paper we show how addition of a new inference rule, called extensionality
resolution, allows first-order theorem provers to easily solve problems no modern
first-order theorem prover can solve. We illustrate this by running the VAMPIRE
theorem prover with extensionality resolution on a number of set theory and array
problems. Extensionality resolution helps VAMPIRE to solve problems from the TPTP
library of first-order problems that were never solved before by any prover.
acknowledgement: This research was supported in part by the Austrian National Research
Network RiSE (S11410-N23).
alternative_title:
- LNCS
author:
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Laura
full_name: Kovács, Laura
last_name: Kovács
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Andrei
full_name: Voronkov, Andrei
last_name: Voronkov
citation:
ama: 'Gupta A, Kovács L, Kragl B, Voronkov A. Extensional crisis and proving identity.
In: Cassez F, Raskin J-F, eds. ATVA 2014. Vol 8837. Springer; 2014:185-200.
doi:10.1007/978-3-319-11936-6_14'
apa: 'Gupta, A., Kovács, L., Kragl, B., & Voronkov, A. (2014). Extensional crisis
and proving identity. In F. Cassez & J.-F. Raskin (Eds.), ATVA 2014
(Vol. 8837, pp. 185–200). Sydney, Australia: Springer. https://doi.org/10.1007/978-3-319-11936-6_14'
chicago: Gupta, Ashutosh, Laura Kovács, Bernhard Kragl, and Andrei Voronkov. “Extensional
Crisis and Proving Identity.” In ATVA 2014, edited by Franck Cassez and
Jean-François Raskin, 8837:185–200. Springer, 2014. https://doi.org/10.1007/978-3-319-11936-6_14.
ieee: A. Gupta, L. Kovács, B. Kragl, and A. Voronkov, “Extensional crisis and proving
identity,” in ATVA 2014, Sydney, Australia, 2014, vol. 8837, pp. 185–200.
ista: 'Gupta A, Kovács L, Kragl B, Voronkov A. 2014. Extensional crisis and proving
identity. ATVA 2014. ATVA: Automated Technology for Verification and Analysis,
LNCS, vol. 8837, 185–200.'
mla: Gupta, Ashutosh, et al. “Extensional Crisis and Proving Identity.” ATVA
2014, edited by Franck Cassez and Jean-François Raskin, vol. 8837, Springer,
2014, pp. 185–200, doi:10.1007/978-3-319-11936-6_14.
short: A. Gupta, L. Kovács, B. Kragl, A. Voronkov, in:, F. Cassez, J.-F. Raskin
(Eds.), ATVA 2014, Springer, 2014, pp. 185–200.
conference:
end_date: 2014-11-07
location: Sydney, Australia
name: 'ATVA: Automated Technology for Verification and Analysis'
start_date: 2014-11-03
date_created: 2018-12-11T11:54:28Z
date_published: 2014-01-01T00:00:00Z
date_updated: 2021-01-12T06:53:45Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-11936-6_14
ec_funded: 1
editor:
- first_name: Franck
full_name: Cassez, Franck
last_name: Cassez
- first_name: Jean-François
full_name: Raskin, Jean-François
last_name: Raskin
file:
- access_level: open_access
checksum: af4bd3fc1f4c93075e4dc5cbf625fe7b
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:15Z
date_updated: 2020-07-14T12:45:19Z
file_id: '4801'
file_name: IST-2016-641-v1+1_atva2014.pdf
file_size: 244294
relation: main_file
file_date_updated: 2020-07-14T12:45:19Z
has_accepted_license: '1'
intvolume: ' 8837'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 185 - 200
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication: ATVA 2014
publication_status: published
publisher: Springer
publist_id: '5226'
pubrep_id: '641'
quality_controlled: '1'
scopus_import: 1
status: public
title: Extensional crisis and proving identity
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 8837
year: '2014'
...