---
_id: '465'
abstract:
- lang: eng
text: 'The edit distance between two words w 1 , w 2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w 1 to w 2 . The edit distance generalizes to languages L 1 , L 2 , where the
edit distance from L 1 to L 2 is the minimal number k such that for every word
from L 1 there exists a word in L 2 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 a pushdown automaton 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 the following problems: (1) deciding
whether, for a given threshold k , the edit distance from a pushdown automaton
to a finite automaton is at most k , and (2) deciding whether the edit distance
from a pushdown automaton to a finite automaton is finite. '
article_processing_charge: No
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
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit distance for pushdown
automata. Logical Methods in Computer Science. 2017;13(3). doi:10.23638/LMCS-13(3:23)2017
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2017).
Edit distance for pushdown automata. Logical Methods in Computer Science.
International Federation for Computational Logic. https://doi.org/10.23638/LMCS-13(3:23)2017
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. “Edit Distance for Pushdown Automata.” Logical Methods in Computer Science.
International Federation for Computational Logic, 2017. https://doi.org/10.23638/LMCS-13(3:23)2017.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, “Edit distance
for pushdown automata,” Logical Methods in Computer Science, vol. 13, no.
3. International Federation for Computational Logic, 2017.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2017. Edit distance for
pushdown automata. Logical Methods in Computer Science. 13(3).
mla: Chatterjee, Krishnendu, et al. “Edit Distance for Pushdown Automata.” Logical
Methods in Computer Science, vol. 13, no. 3, International Federation for
Computational Logic, 2017, doi:10.23638/LMCS-13(3:23)2017.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Logical Methods
in Computer Science 13 (2017).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:37Z
date_published: 2017-09-13T00:00:00Z
date_updated: 2026-07-06T13:27:53Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.23638/LMCS-13(3:23)2017
ec_funded: 1
external_id:
isi:
- '000419163000005'
file:
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:37Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5090'
file_name: IST-2015-321-v1+1_main.pdf
file_size: 279071
relation: main_file
- access_level: open_access
checksum: 08041379ba408d40664f449eb5907a8f
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:38Z
date_updated: 2020-07-14T12:46:33Z
file_id: '5091'
file_name: IST-2018-955-v1+1_2017_Chatterjee_Edit_distance.pdf
file_size: 279071
relation: main_file
file_date_updated: 2020-07-14T12:46:33Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
publication: Logical Methods in Computer Science
publication_identifier:
issn:
- 1860-5974
publication_status: published
publisher: International Federation for Computational Logic
publist_id: '7356'
pubrep_id: '955'
quality_controlled: '1'
related_material:
record:
- id: '5438'
relation: earlier_version
status: public
- id: '1610'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Edit distance for pushdown automata
tmp:
image: /image/cc_by_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 13
year: '2017'
...
---
_id: '467'
abstract:
- lang: eng
text: Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata or in any other known
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata, which makes it possible to express important
quantitative properties such as average response time. In nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in runtime verification. We establish an almost-complete
decidability picture for the basic decision problems about nested weighted automata
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties.
article_number: '31'
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested weighted automata. ACM Transactions
on Computational Logic. 2017;18(4). doi:10.1145/3152769
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2017). Nested weighted automata.
ACM Transactions on Computational Logic. ACM. https://doi.org/10.1145/3152769
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Automata.” ACM Transactions on Computational Logic. ACM, 2017. https://doi.org/10.1145/3152769.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted automata,” ACM
Transactions on Computational Logic, vol. 18, no. 4. ACM, 2017.
ista: Chatterjee K, Henzinger TA, Otop J. 2017. Nested weighted automata. ACM Transactions
on Computational Logic. 18(4), 31.
mla: Chatterjee, Krishnendu, et al. “Nested Weighted Automata.” ACM Transactions
on Computational Logic, vol. 18, no. 4, 31, ACM, 2017, doi:10.1145/3152769.
short: K. Chatterjee, T.A. Henzinger, J. Otop, ACM Transactions on Computational
Logic 18 (2017).
corr_author: '1'
das_tickbox: '1'
date_created: 2018-12-11T11:46:38Z
date_published: 2017-12-01T00:00:00Z
date_updated: 2026-07-07T14:01:10Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/3152769
ec_funded: 1
external_id:
arxiv:
- '1606.03598'
isi:
- '000419237100006'
intvolume: ' 18'
isi: 1
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.03598
month: '12'
oa: 1
oa_version: Preprint
project:
- _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: Formal methods for the design and analysis of complex systems
- _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: ACM Transactions on Computational Logic
publication_identifier:
issn:
- 1529-3785
publication_status: published
publisher: ACM
publist_id: '7354'
quality_controlled: '1'
related_material:
record:
- id: '5415'
relation: earlier_version
status: public
- id: '5436'
relation: earlier_version
status: public
- id: '1656'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Nested weighted automata
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 18
year: '2017'
...
---
_id: '1090'
abstract:
- lang: eng
text: ' While weighted automata provide a natural framework to express quantitative
properties, many basic properties like average response time cannot be expressed
with weighted automata. Nested weighted automata extend weighted automata and
consist of a master automaton and a set of slave automata that are invoked by
the master automaton. Nested weighted automata are strictly more expressive than
weighted automata (e.g., average response time can be expressed with nested weighted
automata), but the basic decision questions have higher complexity (e.g., for
deterministic automata, the emptiness question for nested weighted automata is
PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME).
We consider a natural subclass of nested weighted automata where at any point
at most a bounded number k of slave automata can be active. We focus on automata
whose master value function is the limit average. We show that these nested weighted
automata with bounded width are strictly more expressive than weighted automata
(e.g., average response time with no overlapping requests can be expressed with
bound k=1, but not with non-nested weighted automata). We show that the complexity
of the basic decision problems (i.e., emptiness and universality) for the subclass
with k constant matches the complexity for weighted automata. Moreover, when k
is part of the input given in unary we establish PSPACE-completeness.'
acknowledgement: "This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23\r\n(RiSE/SHiNE) and Z211-N23 (Wittgenstein Award),
ERC Start grant (279307: Graph Games), Vienna\r\nScience and Technology Fund (WWTF)
through project ICT15-003 and by the National Science Centre\r\n(NCN), Poland under
grant 2014/15/D/ST6/04543."
alternative_title:
- LIPIcs
article_number: '24'
article_processing_charge: No
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Nested weighted limit-average automata
of bounded width. In: Vol 58. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2016. doi:10.4230/LIPIcs.MFCS.2016.24'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Nested weighted limit-average
automata of bounded width (Vol. 58). Presented at the MFCS: Mathematical Foundations
of Computer Science, Krakow; Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.MFCS.2016.24'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Nested Weighted
Limit-Average Automata of Bounded Width,” Vol. 58. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016. https://doi.org/10.4230/LIPIcs.MFCS.2016.24.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Nested weighted limit-average
automata of bounded width,” presented at the MFCS: Mathematical Foundations of
Computer Science, Krakow; Poland, 2016, vol. 58.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Nested weighted limit-average automata
of bounded width. MFCS: Mathematical Foundations of Computer Science, LIPIcs,
vol. 58, 24.'
mla: Chatterjee, Krishnendu, et al. Nested Weighted Limit-Average Automata of
Bounded Width. Vol. 58, 24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016, doi:10.4230/LIPIcs.MFCS.2016.24.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Krakow; Poland
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2016-08-22
date_created: 2018-12-11T11:50:05Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-07-10T11:50:02Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.MFCS.2016.24
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:31Z
date_updated: 2018-12-12T10:17:31Z
file_id: '5286'
file_name: IST-2017-795-v1+1_LIPIcs-MFCS-2016-24.pdf
file_size: 564560
relation: main_file
file_date_updated: 2018-12-12T10:17:31Z
has_accepted_license: '1'
intvolume: ' 58'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _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: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6286'
pubrep_id: '795'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Nested weighted limit-average automata of bounded width
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: 58
year: '2016'
...
---
_id: '1093'
abstract:
- lang: eng
text: 'We introduce a general class of distances (metrics) between Markov chains,
which are based on linear behaviour. This class encompasses distances given topologically
(such as the total variation distance or trace distance) as well as by temporal
logics or automata. We investigate which of the distances can be approximated
by observing the systems, i.e. by black-box testing or simulation, and we provide
both negative and positive results. '
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under grant agreement 267989\r\n(QUAREM), the Austrian Science Fund (FWF)
under grants project S11402-N23 (RiSE and SHiNE)\r\nand Z211-N23 (Wittgenstein Award),
by the Czech Science Foundation Grant No. P202/12/G061, and\r\nby the SNSF Advanced
Postdoc. Mobility Fellowship – grant number P300P2_161067."
alternative_title:
- LIPIcs
article_number: '20'
author:
- 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: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. Linear distances between Markov
chains. In: Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.20'
apa: 'Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Linear
distances between Markov chains (Vol. 59). Presented at the CONCUR: Concurrency
Theory, Quebec City; Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2016.20'
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Linear Distances between Markov Chains,” Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.20.
ieee: 'P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Linear distances
between Markov chains,” presented at the CONCUR: Concurrency Theory, Quebec City;
Canada, 2016, vol. 59.'
ista: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Linear distances between
Markov chains. CONCUR: Concurrency Theory, LIPIcs, vol. 59, 20.'
mla: Daca, Przemyslaw, et al. Linear Distances between Markov Chains. Vol.
59, 20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.20.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Schloss Dagstuhl -
Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Quebec City; Canada
name: 'CONCUR: Concurrency Theory'
start_date: 2016-08-23
date_created: 2018-12-11T11:50:06Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
- _id: KrCh
- _id: CaGu
doi: 10.4230/LIPIcs.CONCUR.2016.20
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:39Z
date_updated: 2018-12-12T10:11:39Z
file_id: '4895'
file_name: IST-2017-794-v1+1_LIPIcs-CONCUR-2016-20.pdf
file_size: 501827
relation: main_file
file_date_updated: 2018-12-12T10:11:39Z
has_accepted_license: '1'
intvolume: ' 59'
language:
- iso: eng
month: '08'
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: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6283'
pubrep_id: '794'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Linear distances between Markov chains
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2016'
...
---
_id: '1095'
abstract:
- lang: eng
text: ' The semantics of concurrent data structures is usually given by a sequential
specification and a consistency condition. Linearizability is the most popular
consistency condition due to its simplicity and general applicability. Nevertheless,
for applications that do not require all guarantees offered by linearizability,
recent research has focused on improving performance and scalability of concurrent
data structures by relaxing their semantics. In this paper, we present local linearizability,
a relaxed consistency condition that is applicable to container-type concurrent
data structures like pools, queues, and stacks. While linearizability requires
that the effect of each operation is observed by all threads at the same time,
local linearizability only requires that for each thread T, the effects of its
local insertion operations and the effects of those removal operations that remove
values inserted by T are observed by all threads at the same time. We investigate
theoretical and practical properties of local linearizability and its relationship
to many existing consistency conditions. We present a generic implementation method
for locally linearizable data structures that uses existing linearizable data
structures as building blocks. Our implementations show performance and scalability
improvements over the original building blocks and outperform the fastest existing
container-type implementations. '
acknowledgement: "This work has been supported by the National Research Network RiSE
on Rigorous Systems Engineering\r\n(Austrian Science Fund (FWF): S11402-N23, S11403-N23,
S11404-N23, S11411-N23), a Google\r\nPhD Fellowship, an Erwin Schrödinger Fellowship
(Austrian Science Fund (FWF): J3696-N26), EPSRC\r\ngrants EP/H005633/1 and EP/K008528/1,
the Vienna Science and Technology Fund (WWTF) trough\r\ngrant PROSEED, the European
Research Council (ERC) under grant 267989 (QUAREM) and by the\r\nAustrian Science
Fund (FWF) under grant Z211-N23 (Wittgenstein Award)."
alternative_title:
- LIPIcs
article_number: '6'
author:
- first_name: Andreas
full_name: Haas, Andreas
last_name: Haas
- 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: Andreas
full_name: Holzer, Andreas
last_name: Holzer
- first_name: Christoph
full_name: Kirsch, Christoph
last_name: Kirsch
- first_name: Michael
full_name: Lippautz, Michael
last_name: Lippautz
- first_name: Hannes
full_name: Payer, Hannes
last_name: Payer
- first_name: Ali
full_name: Sezgin, Ali
id: 4C7638DA-F248-11E8-B48F-1D18A9856A87
last_name: Sezgin
- first_name: Ana
full_name: Sokolova, Ana
last_name: Sokolova
- first_name: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Haas A, Henzinger TA, Holzer A, et al. Local linearizability for concurrent
container-type data structures. In: Leibniz International Proceedings in Informatics.
Vol 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPIcs.CONCUR.2016.6'
apa: 'Haas, A., Henzinger, T. A., Holzer, A., Kirsch, C., Lippautz, M., Payer, H.,
… Veith, H. (2016). Local linearizability for concurrent container-type data structures.
In Leibniz International Proceedings in Informatics (Vol. 59). Quebec City;
Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2016.6'
chicago: Haas, Andreas, Thomas A Henzinger, Andreas Holzer, Christoph Kirsch, Michael
Lippautz, Hannes Payer, Ali Sezgin, Ana Sokolova, and Helmut Veith. “Local Linearizability
for Concurrent Container-Type Data Structures.” In Leibniz International Proceedings
in Informatics, Vol. 59. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2016. https://doi.org/10.4230/LIPIcs.CONCUR.2016.6.
ieee: A. Haas et al., “Local linearizability for concurrent container-type
data structures,” in Leibniz International Proceedings in Informatics,
Quebec City; Canada, 2016, vol. 59.
ista: 'Haas A, Henzinger TA, Holzer A, Kirsch C, Lippautz M, Payer H, Sezgin A,
Sokolova A, Veith H. 2016. Local linearizability for concurrent container-type
data structures. Leibniz International Proceedings in Informatics. CONCUR: Concurrency
Theory, LIPIcs, vol. 59, 6.'
mla: Haas, Andreas, et al. “Local Linearizability for Concurrent Container-Type
Data Structures.” Leibniz International Proceedings in Informatics, vol.
59, 6, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPIcs.CONCUR.2016.6.
short: A. Haas, T.A. Henzinger, A. Holzer, C. Kirsch, M. Lippautz, H. Payer, A.
Sezgin, A. Sokolova, H. Veith, in:, Leibniz International Proceedings in Informatics,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.
conference:
end_date: 2016-08-26
location: Quebec City; Canada
name: 'CONCUR: Concurrency Theory'
start_date: 2016-08-23
date_created: 2018-12-11T11:50:07Z
date_published: 2016-08-01T00:00:00Z
date_updated: 2025-04-15T06:25:58Z
day: '01'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2016.6
ec_funded: 1
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:10Z
date_updated: 2018-12-12T10:10:10Z
file_id: '4795'
file_name: IST-2017-793-v1+1_LIPIcs-CONCUR-2016-6.pdf
file_size: 589747
relation: main_file
file_date_updated: 2018-12-12T10:10:10Z
has_accepted_license: '1'
intvolume: ' 59'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _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: Formal methods for the design and analysis of complex systems
publication: Leibniz International Proceedings in Informatics
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '6280'
pubrep_id: '793'
quality_controlled: '1'
scopus_import: 1
status: public
title: Local linearizability for concurrent container-type data structures
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: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 59
year: '2016'
...
---
_id: '1103'
abstract:
- lang: eng
text: We propose two parallel state-space-exploration algorithms for hybrid automaton
(HA), with the goal of enhancing performance on multi-core shared-memory systems.
The first uses the parallel, breadth-first-search algorithm (PBFS) of the SPIN
model checker, when traversing the discrete modes of the HA, and enhances it with
a parallel exploration of the continuous states within each mode. We show that
this simple-minded extension of PBFS does not provide the desired load balancing
in many HA benchmarks. The second algorithm is a task-parallel BFS algorithm (TP-BFS),
which uses a cheap precomputation of the cost associated with the post operations
(both continuous and discrete) in order to improve load balancing. We illustrate
the TP-BFS and the cost precomputation of the post operators on a support-function-based
algorithm for state-space exploration. The performance comparison of the two algorithms
shows that, in general, TP-BFS provides a better utilization/load-balancing of
the CPU. Both algorithms are implemented in the model checker XSpeed. Our experiments
show a maximum speed-up of more than 2000 χ on a navigation benchmark, with respect
to SpaceEx LGG scenario. In order to make the comparison fair, we employed an
equal number of post operations in both tools. To the best of our knowledge, this
paper represents the first attempt to provide parallel, reachability-analysis
algorithms for HA.
acknowledgement: This work was supported in part by DST-SERB, GoI under Project No.
YSS/2014/000623 and 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).
article_number: '7797741'
article_processing_charge: No
arxiv: 1
author:
- first_name: Amit
full_name: Gurung, Amit
last_name: Gurung
- first_name: Arup
full_name: Deka, Arup
last_name: Deka
- 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
- first_name: Rajarshi
full_name: Ray, Rajarshi
last_name: Ray
citation:
ama: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. Parallel reachability
analysis for hybrid systems. In: IEEE; 2016. doi:10.1109/MEMCOD.2016.7797741'
apa: 'Gurung, A., Deka, A., Bartocci, E., Bogomolov, S., Grosu, R., & Ray, R.
(2016). Parallel reachability analysis for hybrid systems. Presented at the MEMOCODE:
Conference on Formal Methods and Models for System Design, Kanpur, India : IEEE.
https://doi.org/10.1109/MEMCOD.2016.7797741'
chicago: Gurung, Amit, Arup Deka, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, and
Rajarshi Ray. “Parallel Reachability Analysis for Hybrid Systems.” IEEE, 2016.
https://doi.org/10.1109/MEMCOD.2016.7797741.
ieee: 'A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, and R. Ray, “Parallel
reachability analysis for hybrid systems,” presented at the MEMOCODE: Conference
on Formal Methods and Models for System Design, Kanpur, India , 2016.'
ista: 'Gurung A, Deka A, Bartocci E, Bogomolov S, Grosu R, Ray R. 2016. Parallel
reachability analysis for hybrid systems. MEMOCODE: Conference on Formal Methods
and Models for System Design, 7797741.'
mla: Gurung, Amit, et al. Parallel Reachability Analysis for Hybrid Systems.
7797741, IEEE, 2016, doi:10.1109/MEMCOD.2016.7797741.
short: A. Gurung, A. Deka, E. Bartocci, S. Bogomolov, R. Grosu, R. Ray, in:, IEEE,
2016.
conference:
end_date: 2016-11-20
location: 'Kanpur, India '
name: 'MEMOCODE: Conference on Formal Methods and Models for System Design'
start_date: 2016-11-18
date_created: 2018-12-11T11:50:09Z
date_published: 2016-12-27T00:00:00Z
date_updated: 2025-06-04T11:52:29Z
day: '27'
department:
- _id: ToHe
doi: 10.1109/MEMCOD.2016.7797741
ec_funded: 1
external_id:
arxiv:
- '1606.05473'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1606.05473
month: '12'
oa: 1
oa_version: Preprint
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: Formal methods for the design and analysis of complex systems
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '6272'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parallel reachability analysis for hybrid systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
OA_place: publisher
_id: '1130'
abstract:
- lang: eng
text: "In this thesis we present a computer-aided programming approach to concurrency.
Our approach helps the programmer by automatically fixing concurrency-related
bugs, i.e. bugs that occur when the program is executed using an aggressive preemptive
scheduler, but not when using a non-preemptive (cooperative) scheduler. Bugs are
program behaviours that are incorrect w.r.t. a specification. We consider both
user-provided explicit specifications in the form of assertion\r\nstatements in
the code as well as an implicit specification. The implicit specification is inferred
from the non-preemptive behaviour. Let us consider sequences of calls that the
program makes to an external interface. The implicit specification requires that
any such sequence produced under a preemptive scheduler should be included in
the set of sequences produced under a non-preemptive scheduler. We consider several
semantics-preserving fixes that go beyond atomic sections typically explored in
the synchronisation synthesis literature. Our synthesis is able to place locks,
barriers and wait-signal statements and last, but not least reorder independent
statements. The latter may be useful if a thread is released to early, e.g., before
some initialisation is completed. We guarantee that our synthesis does not introduce
deadlocks and that the synchronisation inserted is optimal w.r.t. a given objective
function. We dub our solution trace-based synchronisation synthesis and it is
loosely based on counterexample-guided inductive synthesis (CEGIS). The synthesis
works by discovering a trace that is incorrect w.r.t. the specification and identifying
ordering constraints crucial to trigger the specification violation. Synchronisation
may be placed immediately (greedy approach) or delayed until all incorrect traces
are found (non-greedy approach). For the non-greedy approach we construct a set
of global constraints over synchronisation placements. Each model of the global
constraints set corresponds to a correctness-ensuring synchronisation placement.
The placement that is optimal w.r.t. the given objective function is chosen as
the synchronisation solution. We evaluate our approach on a number of realistic
(albeit simplified) Linux device-driver\r\nbenchmarks. The benchmarks are versions
of the drivers with known concurrency-related bugs. For the experiments with an
explicit specification we added assertions that would detect the bugs in the experiments.
Device drivers lend themselves to implicit specification, where the device and
the operating system are the external interfaces. Our experiments demonstrate
that our synthesis method is precise and efficient. We implemented objective functions
for coarse-grained and fine-grained locking and observed that different synchronisation
placements are produced for our experiments, favouring e.g. a minimal number of
synchronisation operations or maximum concurrency."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Thorsten
full_name: Tarrach, Thorsten
id: 3D6E8F2C-F248-11E8-B48F-1D18A9856A87
last_name: Tarrach
orcid: 0000-0003-4409-8487
citation:
ama: Tarrach T. Automatic synthesis of synchronisation primitives for concurrent
programs. 2016. doi:10.15479/at:ista:1130
apa: Tarrach, T. (2016). Automatic synthesis of synchronisation primitives for
concurrent programs. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:1130
chicago: Tarrach, Thorsten. “Automatic Synthesis of Synchronisation Primitives for
Concurrent Programs.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/at:ista:1130.
ieee: T. Tarrach, “Automatic synthesis of synchronisation primitives for concurrent
programs,” Institute of Science and Technology Austria, 2016.
ista: Tarrach T. 2016. Automatic synthesis of synchronisation primitives for concurrent
programs. Institute of Science and Technology Austria.
mla: Tarrach, Thorsten. Automatic Synthesis of Synchronisation Primitives for
Concurrent Programs. Institute of Science and Technology Austria, 2016, doi:10.15479/at:ista:1130.
short: T. Tarrach, Automatic Synthesis of Synchronisation Primitives for Concurrent
Programs, Institute of Science and Technology Austria, 2016.
corr_author: '1'
date_created: 2018-12-11T11:50:19Z
date_published: 2016-07-07T00:00:00Z
date_updated: 2026-04-09T10:54:01Z
day: '07'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
- _id: GradSch
doi: 10.15479/at:ista:1130
ec_funded: 1
file:
- access_level: open_access
checksum: 319a506831650327e85376db41fc1094
content_type: application/pdf
creator: dernst
date_created: 2021-02-22T11:39:32Z
date_updated: 2021-02-22T11:39:32Z
file_id: '9179'
file_name: 2016_Tarrach_Thesis.pdf
file_size: 1523935
relation: main_file
success: 1
- access_level: closed
checksum: 39efcd789f0ad859ff15652cb7afc412
content_type: application/pdf
creator: cchlebak
date_created: 2021-11-16T14:14:38Z
date_updated: 2021-11-17T13:46:55Z
file_id: '10296'
file_name: 2016_Tarrach_Thesispdfa.pdf
file_size: 1306068
relation: main_file
file_date_updated: 2021-11-17T13:46:55Z
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://thorstent.github.io/theses/phd_thorsten_tarrach.pdf
month: '07'
oa: 1
oa_version: Published Version
page: '151'
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: Formal methods for the design and analysis of complex systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publist_id: '6230'
related_material:
record:
- id: '2218'
relation: part_of_dissertation
status: public
- id: '2445'
relation: part_of_dissertation
status: public
- id: '1729'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
title: Automatic synthesis of synchronisation primitives for concurrent programs
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2016'
...
---
_id: '1134'
abstract:
- lang: eng
text: 'Hybrid systems have both continuous and discrete dynamics and are useful
for modeling a variety of control systems, from air traffic control protocols
to robotic maneuvers and beyond. Recently, numerous powerful and scalable tools
for analyzing hybrid systems have emerged. Several of these tools implement automated
formal methods for mathematically proving a system meets a specification. This
tutorial session will present three recent hybrid systems tools: C2E2, HyST, and
TuLiP. C2E2 is a simulated-based verification tool for hybrid systems, and uses
validated numerical solvers and bloating of simulation traces to verify systems
meet specifications. HyST is a hybrid systems model transformation and translation
tool, and uses a canonical intermediate representation to support most of the
recent verification tools, as well as automated sound abstractions that simplify
verification of a given hybrid system. TuLiP is a controller synthesis tool for
hybrid systems, where given a temporal logic specification to be satisfied for
a system (plant) model, TuLiP will find a controller that meets a given specification.
© 2016 IEEE.'
article_number: '7587948'
author:
- first_name: Parasara
full_name: Duggirala, Parasara
last_name: Duggirala
- first_name: Chuchu
full_name: Fan, Chuchu
last_name: Fan
- first_name: Matthew
full_name: Potok, Matthew
last_name: Potok
- first_name: Bolun
full_name: Qi, Bolun
last_name: Qi
- first_name: Sayan
full_name: Mitra, Sayan
last_name: Mitra
- first_name: Mahesh
full_name: Viswanathan, Mahesh
last_name: Viswanathan
- first_name: Stanley
full_name: Bak, Stanley
last_name: Bak
- 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
- first_name: Luan
full_name: Nguyen, Luan
last_name: Nguyen
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
- first_name: Andrew
full_name: Sogokon, Andrew
last_name: Sogokon
- first_name: Hoang
full_name: Tran, Hoang
last_name: Tran
- first_name: Weiming
full_name: Xiang, Weiming
last_name: Xiang
citation:
ama: 'Duggirala P, Fan C, Potok M, et al. Tutorial: Software tools for hybrid systems
verification transformation and synthesis C2E2 HyST and TuLiP. In: 2016 IEEE
Conference on Control Applications. IEEE; 2016. doi:10.1109/CCA.2016.7587948'
apa: 'Duggirala, P., Fan, C., Potok, M., Qi, B., Mitra, S., Viswanathan, M., … Xiang,
W. (2016). Tutorial: Software tools for hybrid systems verification transformation
and synthesis C2E2 HyST and TuLiP. In 2016 IEEE Conference on Control Applications.
Buenos Aires, Argentina : IEEE. https://doi.org/10.1109/CCA.2016.7587948'
chicago: 'Duggirala, Parasara, Chuchu Fan, Matthew Potok, Bolun Qi, Sayan Mitra,
Mahesh Viswanathan, Stanley Bak, et al. “Tutorial: Software Tools for Hybrid Systems
Verification Transformation and Synthesis C2E2 HyST and TuLiP.” In 2016 IEEE
Conference on Control Applications. IEEE, 2016. https://doi.org/10.1109/CCA.2016.7587948.'
ieee: 'P. Duggirala et al., “Tutorial: Software tools for hybrid systems
verification transformation and synthesis C2E2 HyST and TuLiP,” in 2016 IEEE
Conference on Control Applications, Buenos Aires, Argentina , 2016.'
ista: 'Duggirala P, Fan C, Potok M, Qi B, Mitra S, Viswanathan M, Bak S, Bogomolov
S, Johnson T, Nguyen L, Schilling C, Sogokon A, Tran H, Xiang W. 2016. Tutorial:
Software tools for hybrid systems verification transformation and synthesis C2E2
HyST and TuLiP. 2016 IEEE Conference on Control Applications. CCA: Control Applications
, 7587948.'
mla: 'Duggirala, Parasara, et al. “Tutorial: Software Tools for Hybrid Systems Verification
Transformation and Synthesis C2E2 HyST and TuLiP.” 2016 IEEE Conference on
Control Applications, 7587948, IEEE, 2016, doi:10.1109/CCA.2016.7587948.'
short: P. Duggirala, C. Fan, M. Potok, B. Qi, S. Mitra, M. Viswanathan, S. Bak,
S. Bogomolov, T. Johnson, L. Nguyen, C. Schilling, A. Sogokon, H. Tran, W. Xiang,
in:, 2016 IEEE Conference on Control Applications, IEEE, 2016.
conference:
end_date: 2016-09-22
location: 'Buenos Aires, Argentina '
name: 'CCA: Control Applications '
start_date: 2016-09-19
date_created: 2018-12-11T11:50:20Z
date_published: 2016-10-10T00:00:00Z
date_updated: 2021-01-12T06:48:32Z
day: '10'
department:
- _id: ToHe
doi: 10.1109/CCA.2016.7587948
language:
- iso: eng
month: '10'
oa_version: None
publication: 2016 IEEE Conference on Control Applications
publication_status: published
publisher: IEEE
publist_id: '6224'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'Tutorial: Software tools for hybrid systems verification transformation and
synthesis C2E2 HyST and TuLiP'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1135'
abstract:
- lang: eng
text: 'Time-triggered (TT) switched networks are a deterministic communication infrastructure
used by real-time distributed embedded systems. These networks rely on the notion
of globally discretized time (i.e. time slots) and a static TT schedule that prescribes
which message is sent through which link at every time slot, such that all messages
reach their destination before a global timeout. These schedules are generated
offline, assuming a static network with fault-free links, and entrusting all error-handling
functions to the end user. Assuming the network is static is an over-optimistic
view, and indeed links tend to fail in practice. We study synthesis of TT schedules
on a network in which links fail over time and we assume the switches run a very
simple error-recovery protocol once they detect a crashed link. We address the
problem of finding a pk; qresistant schedule; namely, one that, assuming the switches
run a fixed error-recovery protocol, guarantees that the number of messages that
arrive at their destination by the timeout is at least no matter what sequence
of at most k links fail. Thus, we maintain the simplicity of the switches while
giving a guarantee on the number of messages that meet the timeout. We show how
a pk; q-resistant schedule can be obtained using a CEGAR-like approach: find a
schedule, decide whether it is pk; q-resistant, and if it is not, use the witnessing
fault sequence to generate a constraint that is added to the program. The newly
added constraint disallows the schedule to be regenerated in a future iteration
while also eliminating several other schedules that are not pk; q-resistant. We
illustrate the applicability of our approach using an SMT-based implementation.
© 2016 ACM.'
article_number: '26'
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Shibashis
full_name: Guha, Shibashis
last_name: Guha
- first_name: Guillermo
full_name: Rodríguez Navas, Guillermo
last_name: Rodríguez Navas
citation:
ama: 'Avni G, Guha S, Rodríguez Navas G. Synthesizing time triggered schedules for
switched networks with faulty links. In: Proceedings of the 13th International
Conference on Embedded Software . ACM; 2016. doi:10.1145/2968478.2968499'
apa: 'Avni, G., Guha, S., & Rodríguez Navas, G. (2016). Synthesizing time triggered
schedules for switched networks with faulty links. In Proceedings of the 13th
International Conference on Embedded Software . Pittsburgh, PA, USA: ACM.
https://doi.org/10.1145/2968478.2968499'
chicago: Avni, Guy, Shibashis Guha, and Guillermo Rodríguez Navas. “Synthesizing
Time Triggered Schedules for Switched Networks with Faulty Links.” In Proceedings
of the 13th International Conference on Embedded Software . ACM, 2016. https://doi.org/10.1145/2968478.2968499.
ieee: G. Avni, S. Guha, and G. Rodríguez Navas, “Synthesizing time triggered schedules
for switched networks with faulty links,” in Proceedings of the 13th International
Conference on Embedded Software , Pittsburgh, PA, USA, 2016.
ista: 'Avni G, Guha S, Rodríguez Navas G. 2016. Synthesizing time triggered schedules
for switched networks with faulty links. Proceedings of the 13th International
Conference on Embedded Software . EMSOFT: Embedded Software , 26.'
mla: Avni, Guy, et al. “Synthesizing Time Triggered Schedules for Switched Networks
with Faulty Links.” Proceedings of the 13th International Conference on Embedded
Software , 26, ACM, 2016, doi:10.1145/2968478.2968499.
short: G. Avni, S. Guha, G. Rodríguez Navas, in:, Proceedings of the 13th International
Conference on Embedded Software , ACM, 2016.
conference:
end_date: 2016-10-07
location: Pittsburgh, PA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2016-10-01
date_created: 2018-12-11T11:50:20Z
date_published: 2016-10-01T00:00:00Z
date_updated: 2025-09-22T14:14:05Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/2968478.2968499
ec_funded: 1
external_id:
isi:
- '000414220100026'
file:
- access_level: open_access
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:09:31Z
date_updated: 2018-12-12T10:09:31Z
file_id: '4755'
file_name: IST-2016-644-v1+1_emsoft-no-format.pdf
file_size: 279240
relation: main_file
file_date_updated: 2018-12-12T10:09:31Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted 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: Formal methods for the design and analysis of complex systems
publication: 'Proceedings of the 13th International Conference on Embedded Software '
publication_status: published
publisher: ACM
publist_id: '6223'
pubrep_id: '644'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesizing time triggered schedules for switched networks with faulty links
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '1138'
abstract:
- lang: eng
text: Automata with monitor counters, where the transitions do not depend on counter
values, and nested weighted automata are two expressive automata-theoretic frameworks
for quantitative properties. For a well-studied and wide class of quantitative
functions, we establish that automata with monitor counters and nested weighted
automata are equivalent. We study for the first time such quantitative automata
under probabilistic semantics. We show that several problems that are undecidable
for the classical questions of emptiness and universality become decidable under
the probabilistic semantics. We present a complete picture of decidability for
such automata, and even an almost-complete picture of computational complexity,
for the probabilistic questions we consider. © 2016 ACM.
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 (Wittgenstein Award), FWF Grant No P23499-
N23, FWF NFN Grant No S114
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Quantitative automata under probabilistic
semantics. In: Proceedings of the 31st Annual ACM/IEEE Symposium. IEEE;
2016:76-85. doi:10.1145/2933575.2933588'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative automata
under probabilistic semantics. In Proceedings of the 31st Annual ACM/IEEE Symposium
(pp. 76–85). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2933588'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative
Automata under Probabilistic Semantics.” In Proceedings of the 31st Annual
ACM/IEEE Symposium, 76–85. IEEE, 2016. https://doi.org/10.1145/2933575.2933588.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative automata under
probabilistic semantics,” in Proceedings of the 31st Annual ACM/IEEE Symposium,
New York, NY, USA, 2016, pp. 76–85.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative automata under probabilistic
semantics. Proceedings of the 31st Annual ACM/IEEE Symposium. LICS: Logic in Computer
Science, 76–85.'
mla: Chatterjee, Krishnendu, et al. “Quantitative Automata under Probabilistic Semantics.”
Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85,
doi:10.1145/2933575.2933588.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual
ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.
conference:
end_date: 2016-07-08
location: New York, NY, USA
name: 'LICS: Logic in Computer Science'
start_date: 2016-07-05
date_created: 2018-12-11T11:50:21Z
date_published: 2016-07-05T00:00:00Z
date_updated: 2025-09-22T14:12:47Z
day: '05'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1145/2933575.2933588
ec_funded: 1
external_id:
arxiv:
- '1604.06764'
isi:
- '000387609200008'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06764
month: '07'
oa: 1
oa_version: Preprint
page: 76 - 85
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: Formal methods for the design and analysis of complex systems
- _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: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Proceedings of the 31st Annual ACM/IEEE Symposium
publication_status: published
publisher: IEEE
publist_id: '6220'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative automata under probabilistic semantics
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2016'
...
---
_id: '1148'
abstract:
- lang: eng
text: Continuous-time Markov chain (CTMC) models have become a central tool for
understanding the dynamics of complex reaction networks and the importance of
stochasticity in the underlying biochemical processes. When such models are employed
to answer questions in applications, in order to ensure that the model provides
a sufficiently accurate representation of the real system, it is of vital importance
that the model parameters are inferred from real measured data. This, however,
is often a formidable task and all of the existing methods fail in one case or
the other, usually because the underlying CTMC model is high-dimensional and computationally
difficult to analyze. The parameter inference methods that tend to scale best
in the dimension of the CTMC are based on so-called moment closure approximations.
However, there exists a large number of different moment closure approximations
and it is typically hard to say a priori which of the approximations is the most
suitable for the inference procedure. Here, we propose a moment-based parameter
inference method that automatically chooses the most appropriate moment closure
method. Accordingly, contrary to existing methods, the user is not required to
be experienced in moment closure techniques. In addition to that, our method adaptively
changes the approximation during the parameter inference to ensure that always
the best approximation is used, even in cases where different approximations are
best in different regions of the parameter space. © 2016 Elsevier Ireland Ltd
acknowledgement: This work is based on the CMSB 2015 paper “Adaptive moment closure
for parameter inference of biochemical reaction networks” (Bogomolov et al., 2015).
The work was partly supported by the German Research Foundation (DFG) as part of
the Transregional Collaborative Research Center “Automatic Verification and Analysis
of Complex Systems” (SFB/TR 14 AVACS1), by the European Research Council (ERC) under
grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23
(RiSE) and Z211-N23 (Wittgenstein Award). J.R. acknowledges support from the People
Programme (Marie Curie Actions) of the European Union's Seventh Framework Programme
(FP7/2007-2013) under REA grant agreement no. 291734.
article_processing_charge: No
author:
- 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: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Andreas
full_name: Podelski, Andreas
last_name: Podelski
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
citation:
ama: Schilling C, Bogomolov S, Henzinger TA, Podelski A, Ruess J. Adaptive moment
closure for parameter inference of biochemical reaction networks. Biosystems.
2016;149:15-25. doi:10.1016/j.biosystems.2016.07.005
apa: Schilling, C., Bogomolov, S., Henzinger, T. A., Podelski, A., & Ruess,
J. (2016). Adaptive moment closure for parameter inference of biochemical reaction
networks. Biosystems. Elsevier. https://doi.org/10.1016/j.biosystems.2016.07.005
chicago: Schilling, Christian, Sergiy Bogomolov, Thomas A Henzinger, Andreas Podelski,
and Jakob Ruess. “Adaptive Moment Closure for Parameter Inference of Biochemical
Reaction Networks.” Biosystems. Elsevier, 2016. https://doi.org/10.1016/j.biosystems.2016.07.005.
ieee: C. Schilling, S. Bogomolov, T. A. Henzinger, A. Podelski, and J. Ruess, “Adaptive
moment closure for parameter inference of biochemical reaction networks,” Biosystems,
vol. 149. Elsevier, pp. 15–25, 2016.
ista: Schilling C, Bogomolov S, Henzinger TA, Podelski A, Ruess J. 2016. Adaptive
moment closure for parameter inference of biochemical reaction networks. Biosystems.
149, 15–25.
mla: Schilling, Christian, et al. “Adaptive Moment Closure for Parameter Inference
of Biochemical Reaction Networks.” Biosystems, vol. 149, Elsevier, 2016,
pp. 15–25, doi:10.1016/j.biosystems.2016.07.005.
short: C. Schilling, S. Bogomolov, T.A. Henzinger, A. Podelski, J. Ruess, Biosystems
149 (2016) 15–25.
date_created: 2018-12-11T11:50:24Z
date_published: 2016-11-01T00:00:00Z
date_updated: 2025-09-23T07:44:57Z
day: '01'
department:
- _id: ToHe
- _id: GaTk
doi: 10.1016/j.biosystems.2016.07.005
ec_funded: 1
external_id:
isi:
- '000390743600003'
intvolume: ' 149'
isi: 1
language:
- iso: eng
month: '11'
oa_version: None
page: 15 - 25
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: Formal methods for the design and analysis of complex systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Biosystems
publication_status: published
publisher: Elsevier
publist_id: '6210'
quality_controlled: '1'
related_material:
record:
- id: '1658'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Adaptive moment closure for parameter inference of biochemical reaction networks
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 149
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '1166'
abstract:
- lang: eng
text: POMDPs are standard models for probabilistic planning problems, where an agent
interacts with an uncertain environment. We study the problem of almost-sure reachability,
where given a set of target states, the question is to decide whether there is
a policy to ensure that the target set is reached with probability 1 (almost-surely).
While in general the problem is EXPTIMEcomplete, in many practical cases policies
with a small amount of memory suffice. Moreover, the existing solution to the
problem is explicit, which first requires to construct explicitly an exponential
reduction to a belief-support MDP. In this work, we first study the existence
of observation-stationary strategies, which is NP-complete, and then small-memory
strategies. We present a symbolic algorithm by an efficient encoding to SAT and
using a SAT solver for the problem. We report experimental results demonstrating
the scalability of our symbolic (SAT-based) approach. © 2016, Association for
the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
acknowledgement: 'The research was partly supported by Austrian Science Fund (FWF)
Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307:
Graph Games), and Microsoft faculty fellows award.'
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: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Jessica
full_name: Davies, Jessica
id: 378E0060-F248-11E8-B48F-1D18A9856A87
last_name: Davies
citation:
ama: 'Chatterjee K, Chmelik M, Davies J. A symbolic SAT based algorithm for almost
sure reachability with small strategies in POMDPs. In: Proceedings of the Thirtieth
AAAI Conference on Artificial Intelligence. Vol 2016. AAAI Press; 2016:3225-3232.
doi:10.1609/aaai.v30i1.10422'
apa: 'Chatterjee, K., Chmelik, M., & Davies, J. (2016). A symbolic SAT based
algorithm for almost sure reachability with small strategies in POMDPs. In Proceedings
of the Thirtieth AAAI Conference on Artificial Intelligence (Vol. 2016, pp.
3225–3232). Phoenix, AZ, United States: AAAI Press. https://doi.org/10.1609/aaai.v30i1.10422'
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. “A Symbolic
SAT Based Algorithm for Almost Sure Reachability with Small Strategies in POMDPs.”
In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence,
2016:3225–32. AAAI Press, 2016. https://doi.org/10.1609/aaai.v30i1.10422.
ieee: K. Chatterjee, M. Chmelik, and J. Davies, “A symbolic SAT based algorithm
for almost sure reachability with small strategies in POMDPs,” in Proceedings
of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, AZ,
United States, 2016, vol. 2016, pp. 3225–3232.
ista: 'Chatterjee K, Chmelik M, Davies J. 2016. A symbolic SAT based algorithm for
almost sure reachability with small strategies in POMDPs. Proceedings of the Thirtieth
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 2016, 3225–3232.'
mla: Chatterjee, Krishnendu, et al. “A Symbolic SAT Based Algorithm for Almost Sure
Reachability with Small Strategies in POMDPs.” Proceedings of the Thirtieth
AAAI Conference on Artificial Intelligence, vol. 2016, AAAI Press, 2016, pp.
3225–32, doi:10.1609/aaai.v30i1.10422.
short: K. Chatterjee, M. Chmelik, J. Davies, in:, Proceedings of the Thirtieth AAAI
Conference on Artificial Intelligence, AAAI Press, 2016, pp. 3225–3232.
conference:
end_date: 2016-02-17
location: Phoenix, AZ, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2016-02-12
corr_author: '1'
date_created: 2018-12-11T11:50:30Z
date_published: 2016-12-02T00:00:00Z
date_updated: 2025-06-25T11:52:14Z
day: '02'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1609/aaai.v30i1.10422
ec_funded: 1
external_id:
arxiv:
- '1511.08456'
intvolume: ' 2016'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.1511.08456
month: '12'
oa: 1
oa_version: Preprint
page: 3225 - 3232
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'
publication: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence
publication_status: published
publisher: AAAI Press
publist_id: '6191'
quality_controlled: '1'
related_material:
link:
- relation: table_of_contents
url: https://dl.acm.org/citation.cfm?id=3016355
record:
- id: '5443'
relation: earlier_version
status: public
status: public
title: A symbolic SAT based algorithm for almost sure reachability with small strategies
in POMDPs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2016
year: '2016'
...
---
_id: '1205'
abstract:
- lang: eng
text: In this paper, we present a formal model-driven engineering approach to establishing
a safety-assured implementation of Multifunction vehicle bus controller (MVBC)
based on the generic reference models and requirements described in the International
Electrotechnical Commission (IEC) standard IEC-61375. First, the generic models
described in IEC-61375 are translated into a network of timed automata, and some
safety requirements tested in IEC-61375 are formalized as timed computation tree
logic (TCTL) formulas. With the help of Uppaal, we check and debug whether the
timed automata satisfy the formulas or not. Within this step, several logic inconsistencies
in the original standard are detected and corrected. Then, we apply the tool Times
to generate C code from the verified model, which was later synthesized into a
real MVBC chip. Finally, the runtime verification tool RMOR is applied to verify
some safety requirements at the implementation level. We set up a real platform
with worldwide mostly used MVBC D113, and verify the correctness and the scalability
of the synthesized MVBC chip more comprehensively. The errors in the standard
has been confirmed and the resulted MVBC has been deployed in real train communication
network.
acknowledgement: "This research is sponsored in part by NSFC Program (No. 91218302,
No. 61527812), National Science and Technology Major Project (No. 2016ZX01038101),
Tsinghua University Initiative Scientific Research Program (20131089331), MIIT IT
funds (Research and application of TCN key technologies) of China, and the National
Key Technology R&D Program (No. 2015BAG14B01-02), Austrian Science Fund (FWF) under
grants S11402-N23 (RiSE/SHiNE) and Z211-N23.\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Houbing
full_name: Song, Houbing
last_name: Song
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ming
full_name: Gu, Ming
last_name: Gu
- first_name: Jiaguang
full_name: Sun, Jiaguang
last_name: Sun
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: 'Jiang Y, Liu H, Song H, et al. Safety assured formal model driven design of
the multifunction vehicle bus controller. In: Vol 9995. Springer; 2016:757-763.
doi:10.1007/978-3-319-48989-6_47'
apa: 'Jiang, Y., Liu, H., Song, H., Kong, H., Gu, M., Sun, J., & Sha, L. (2016).
Safety assured formal model driven design of the multifunction vehicle bus controller
(Vol. 9995, pp. 757–763). Presented at the FM: Formal Methods, Limassol, Cyprus:
Springer. https://doi.org/10.1007/978-3-319-48989-6_47'
chicago: Jiang, Yu, Han Liu, Houbing Song, Hui Kong, Ming Gu, Jiaguang Sun, and
Lui Sha. “Safety Assured Formal Model Driven Design of the Multifunction Vehicle
Bus Controller,” 9995:757–63. Springer, 2016. https://doi.org/10.1007/978-3-319-48989-6_47.
ieee: 'Y. Jiang et al., “Safety assured formal model driven design of the
multifunction vehicle bus controller,” presented at the FM: Formal Methods, Limassol,
Cyprus, 2016, vol. 9995, pp. 757–763.'
ista: 'Jiang Y, Liu H, Song H, Kong H, Gu M, Sun J, Sha L. 2016. Safety assured
formal model driven design of the multifunction vehicle bus controller. FM: Formal
Methods, LNCS, vol. 9995, 757–763.'
mla: Jiang, Yu, et al. Safety Assured Formal Model Driven Design of the Multifunction
Vehicle Bus Controller. Vol. 9995, Springer, 2016, pp. 757–63, doi:10.1007/978-3-319-48989-6_47.
short: Y. Jiang, H. Liu, H. Song, H. Kong, M. Gu, J. Sun, L. Sha, in:, Springer,
2016, pp. 757–763.
conference:
end_date: 2016-11-11
location: Limassol, Cyprus
name: 'FM: Formal Methods'
start_date: 2016-11-09
date_created: 2018-12-11T11:50:42Z
date_published: 2016-11-08T00:00:00Z
date_updated: 2025-09-22T09:39:55Z
day: '08'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.1007/978-3-319-48989-6_47
external_id:
isi:
- '000389793300047'
file:
- access_level: open_access
checksum: fea0b3fae9a2a42e8bfec59840e30d8c
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:08:13Z
date_updated: 2020-07-14T12:44:39Z
file_id: '4673'
file_name: IST-2017-783-v1+1_FM-Safety-Assured-Development-of-MVBC.pdf
file_size: 281501
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 9995'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Submitted Version
page: 757 - 763
project:
- _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: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Springer
publist_id: '6144'
pubrep_id: '783'
quality_controlled: '1'
related_material:
record:
- id: '434'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Safety assured formal model driven design of the multifunction vehicle bus
controller
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9995
year: '2016'
...
---
_id: '1227'
abstract:
- lang: eng
text: Many biological systems can be modeled as multiaffine hybrid systems. Due
to the nonlinearity of multiaffine systems, it is difficult to verify their properties
of interest directly. A common strategy to tackle this problem is to construct
and analyze a discrete overapproximation of the original system. However, the
conservativeness of a discrete abstraction significantly determines the level
of confidence we can have in the properties of the original system. In this paper,
in order to reduce the conservativeness of a discrete abstraction, we propose
a new method based on a sufficient and necessary decision condition for computing
discrete transitions between states in the abstract system. We assume the state
space partition of a multiaffine system to be based on a set of multivariate polynomials.
Hence, a rectangular partition defined in terms of polynomials of the form (xi
− c) is just a simple case of multivariate polynomial partition, and the new decision
condition applies naturally. We analyze and demonstrate the improvement of our
method over the existing methods using some examples.
acknowledgement: This research was supported in part 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
article_processing_charge: No
author:
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- 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
- 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: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Christian
full_name: Schilling, Christian
id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
last_name: Schilling
orcid: 0000-0003-3658-1065
citation:
ama: 'Kong H, Bartocci E, Bogomolov S, et al. Discrete abstraction of multiaffine
systems. In: Vol 9957. Springer; 2016:128-144. doi:10.1007/978-3-319-47151-8_9'
apa: 'Kong, H., Bartocci, E., Bogomolov, S., Grosu, R., Henzinger, T. A., Jiang,
Y., & Schilling, C. (2016). Discrete abstraction of multiaffine systems (Vol.
9957, pp. 128–144). Presented at the HSB: Hybrid Systems Biology, Grenoble, France:
Springer. https://doi.org/10.1007/978-3-319-47151-8_9'
chicago: Kong, Hui, Ezio Bartocci, Sergiy Bogomolov, Radu Grosu, Thomas A Henzinger,
Yu Jiang, and Christian Schilling. “Discrete Abstraction of Multiaffine Systems,”
9957:128–44. Springer, 2016. https://doi.org/10.1007/978-3-319-47151-8_9.
ieee: 'H. Kong et al., “Discrete abstraction of multiaffine systems,” presented
at the HSB: Hybrid Systems Biology, Grenoble, France, 2016, vol. 9957, pp. 128–144.'
ista: 'Kong H, Bartocci E, Bogomolov S, Grosu R, Henzinger TA, Jiang Y, Schilling
C. 2016. Discrete abstraction of multiaffine systems. HSB: Hybrid Systems Biology,
LNCS, vol. 9957, 128–144.'
mla: Kong, Hui, et al. Discrete Abstraction of Multiaffine Systems. Vol.
9957, Springer, 2016, pp. 128–44, doi:10.1007/978-3-319-47151-8_9.
short: H. Kong, E. Bartocci, S. Bogomolov, R. Grosu, T.A. Henzinger, Y. Jiang, C.
Schilling, in:, Springer, 2016, pp. 128–144.
conference:
end_date: 2016-10-21
location: Grenoble, France
name: 'HSB: Hybrid Systems Biology'
start_date: 2016-10-20
date_created: 2018-12-11T11:50:49Z
date_published: 2016-09-25T00:00:00Z
date_updated: 2025-09-22T09:24:50Z
day: '25'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1007/978-3-319-47151-8_9
external_id:
isi:
- '000389928100009'
file:
- access_level: open_access
checksum: 994e164b558c47bacf8dc066dd27c8fc
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:49Z
date_updated: 2020-07-14T12:44:39Z
file_id: '4840'
file_name: IST-2017-781-v1+1_main.pdf
file_size: 683955
relation: main_file
file_date_updated: 2020-07-14T12:44:39Z
has_accepted_license: '1'
intvolume: ' 9957'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Submitted Version
page: 128 - 144
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: Formal methods for the design and analysis of complex systems
- _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: '6107'
pubrep_id: '781'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discrete abstraction of multiaffine systems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9957
year: '2016'
...
---
_id: '1230'
abstract:
- lang: eng
text: Concolic testing is a promising method for generating test suites for large
programs. However, it suffers from the path-explosion problem and often fails
to find tests that cover difficult-to-reach parts of programs. In contrast, model
checkers based on counterexample-guided abstraction refinement explore programs
exhaustively, while failing to scale on large programs with precision. In this
paper, we present a novel method that iteratively combines concolic testing and
model checking to find a test suite for a given coverage criterion. If concolic
testing fails to cover some test goals, then the model checker refines its program
abstraction to prove more paths infeasible, which reduces the search space for
concolic testing. We have implemented our method on top of the concolictesting
tool Crest and the model checker CpaChecker. We evaluated our tool on a collection
of programs and a category of SvComp benchmarks. In our experiments, we observed
an improvement in branch coverage compared to Crest from 48% to 63% in the best
case, and from 66% to 71% on average.
acknowledgement: "We thank Andrey Kupriyanov for feedback on the manuscript,\r\nand
Michael Tautschnig for help with preparing the experiments. This research 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 (RiSE) and Z211-N23 (Wittgenstein
Award)."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Przemyslaw
full_name: Daca, Przemyslaw
id: 49351290-F248-11E8-B48F-1D18A9856A87
last_name: Daca
- first_name: Ashutosh
full_name: Gupta, Ashutosh
id: 335E5684-F248-11E8-B48F-1D18A9856A87
last_name: Gupta
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Daca P, Gupta A, Henzinger TA. Abstraction-driven concolic testing. In: Vol
9583. Springer; 2016:328-347. doi:10.1007/978-3-662-49122-5_16'
apa: 'Daca, P., Gupta, A., & Henzinger, T. A. (2016). Abstraction-driven concolic
testing (Vol. 9583, pp. 328–347). Presented at the VMCAI: Verification, Model
Checking and Abstract Interpretation, St. Petersburg, FL, USA: Springer. https://doi.org/10.1007/978-3-662-49122-5_16'
chicago: Daca, Przemyslaw, Ashutosh Gupta, and Thomas A Henzinger. “Abstraction-Driven
Concolic Testing,” 9583:328–47. Springer, 2016. https://doi.org/10.1007/978-3-662-49122-5_16.
ieee: 'P. Daca, A. Gupta, and T. A. Henzinger, “Abstraction-driven concolic testing,”
presented at the VMCAI: Verification, Model Checking and Abstract Interpretation,
St. Petersburg, FL, USA, 2016, vol. 9583, pp. 328–347.'
ista: 'Daca P, Gupta A, Henzinger TA. 2016. Abstraction-driven concolic testing.
VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 9583,
328–347.'
mla: Daca, Przemyslaw, et al. Abstraction-Driven Concolic Testing. Vol. 9583,
Springer, 2016, pp. 328–47, doi:10.1007/978-3-662-49122-5_16.
short: P. Daca, A. Gupta, T.A. Henzinger, in:, Springer, 2016, pp. 328–347.
conference:
end_date: 2016-01-19
location: St. Petersburg, FL, USA
name: 'VMCAI: Verification, Model Checking and Abstract Interpretation'
start_date: 2016-01-17
date_created: 2018-12-11T11:50:50Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
department:
- _id: ToHe
doi: 10.1007/978-3-662-49122-5_16
ec_funded: 1
external_id:
arxiv:
- '1511.02615'
isi:
- '000375148800016'
intvolume: ' 9583'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1511.02615
month: '01'
oa: 1
oa_version: Preprint
page: 328 - 347
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: Formal methods for the design and analysis of complex systems
- _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: '6104'
quality_controlled: '1'
related_material:
record:
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Abstraction-driven concolic testing
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9583
year: '2016'
...
---
_id: '1234'
abstract:
- lang: eng
text: We present a new algorithm for the statistical model checking of Markov chains
with respect to unbounded temporal properties, including full linear temporal
logic. The main idea is that we monitor each simulation run on the fly, in order
to detect quickly if a bottom strongly connected component is entered with high
probability, in which case the simulation run can be terminated early. As a result,
our simulation runs are often much shorter than required by termination bounds
that are computed a priori for a desired level of confidence on a large state
space. In comparison to previous algorithms for statistical model checking our
method is not only faster in many cases but also requires less information about
the system, namely, only the minimum transition probability that occurs in the
Markov chain. In addition, our method can be generalised to unbounded quantitative
properties such as mean-payoff bounds.
acknowledgement: "This research was funded in part by the European Research Council
(ERC) under\r\ngrant agreement 267989 (QUAREM), the Austrian Science Fund
\ (FWF) under\r\ngrants project S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award),
the Peo-\r\nple Programme (Marie Curie Actions) of the European Union’s Seventh
Framework\r\nProgramme (FP7/2007-2013) REA Grant No 291734, the SNSF Advanced Postdoc.\r\nMobility
Fellowship – grant number P300P2\r\n161067, and the Czech Science Foun-\r\ndation
under grant agreement P202/12/G061."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- 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: Tatjana
full_name: Petrov, Tatjana
id: 3D5811FC-F248-11E8-B48F-1D18A9856A87
last_name: Petrov
orcid: 0000-0002-9041-0905
citation:
ama: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. Faster statistical model checking
for unbounded temporal properties. In: Vol 9636. Springer; 2016:112-129. doi:10.1007/978-3-662-49674-9_7'
apa: 'Daca, P., Henzinger, T. A., Kretinsky, J., & Petrov, T. (2016). Faster
statistical model checking for unbounded temporal properties (Vol. 9636, pp. 112–129).
Presented at the TACAS: Tools and Algorithms for the Construction and Analysis
of Systems, Eindhoven, The Netherlands: Springer. https://doi.org/10.1007/978-3-662-49674-9_7'
chicago: Daca, Przemyslaw, Thomas A Henzinger, Jan Kretinsky, and Tatjana Petrov.
“Faster Statistical Model Checking for Unbounded Temporal Properties,” 9636:112–29.
Springer, 2016. https://doi.org/10.1007/978-3-662-49674-9_7.
ieee: 'P. Daca, T. A. Henzinger, J. Kretinsky, and T. Petrov, “Faster statistical
model checking for unbounded temporal properties,” presented at the TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, Eindhoven, The Netherlands,
2016, vol. 9636, pp. 112–129.'
ista: 'Daca P, Henzinger TA, Kretinsky J, Petrov T. 2016. Faster statistical model
checking for unbounded temporal properties. TACAS: Tools and Algorithms for the
Construction and Analysis of Systems, LNCS, vol. 9636, 112–129.'
mla: Daca, Przemyslaw, et al. Faster Statistical Model Checking for Unbounded
Temporal Properties. Vol. 9636, Springer, 2016, pp. 112–29, doi:10.1007/978-3-662-49674-9_7.
short: P. Daca, T.A. Henzinger, J. Kretinsky, T. Petrov, in:, Springer, 2016, pp.
112–129.
conference:
end_date: 2016-04-08
location: Eindhoven, The Netherlands
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2016-04-02
date_created: 2018-12-11T11:50:51Z
date_published: 2016-01-01T00:00:00Z
date_updated: 2026-04-15T10:02:12Z
day: '01'
department:
- _id: ToHe
- _id: CaGu
doi: 10.1007/978-3-662-49674-9_7
ec_funded: 1
external_id:
arxiv:
- '1504.05739'
isi:
- '000406428000007'
intvolume: ' 9636'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1504.05739
month: '01'
oa: 1
oa_version: Preprint
page: 112 - 129
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: Formal methods for the design and analysis of complex systems
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication_status: published
publisher: Springer
publist_id: '6099'
quality_controlled: '1'
related_material:
record:
- id: '471'
relation: later_version
status: public
- id: '1155'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Faster statistical model checking for unbounded temporal properties
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9636
year: '2016'
...
---
_id: '1256'
abstract:
- lang: eng
text: Simulink is widely used for model driven development (MDD) of industrial software
systems. Typically, the Simulink based development is initiated from Stateflow
modeling, followed by simulation, validation and code generation mapped to physical
execution platforms. However, recent industrial trends have raised the demands
of rigorous verification on safety-critical applications, which is unfortunately
challenging for Simulink. In this paper, we present an approach to bridge the
Stateflow based model driven development and a well- defined rigorous verification.
First, we develop a self- contained toolkit to translate Stateflow model into
timed automata, where major advanced modeling features in Stateflow are supported.
Taking advantage of the strong verification capability of Uppaal, we can not only
find bugs in Stateflow models which are missed by Simulink Design Verifier, but
also check more important temporal properties. Next, we customize a runtime verifier
for the generated nonintrusive VHDL and C code of Stateflow model for monitoring.
The major strength of the customization is the flexibility to collect and analyze
runtime properties with a pure software monitor, which opens more opportunities
for engineers to achieve high reliability of the target system compared with the
traditional act that only relies on Simulink Polyspace. We incorporate these two
parts into original Stateflow based MDD seamlessly. In this way, safety-critical
properties are both verified at the model level, and at the consistent system
implementation level with physical execution environment in consideration. We
apply our approach on a train controller design, and the verified implementation
is tested and deployed on a real hardware platform.
acknowledgement: This work is supported in part by NSF CNS 13-30077, NSF CNS 13-29886,
NSF CNS 15-45002, NSFC 61303014, NSFC 61202010, and NSFC 91218302.
article_number: '7461337'
author:
- first_name: Yu
full_name: Jiang, Yu
last_name: Jiang
- first_name: Yixiao
full_name: Yang, Yixiao
last_name: Yang
- first_name: Han
full_name: Liu, Han
last_name: Liu
- first_name: Hui
full_name: Kong, Hui
id: 3BDE25AA-F248-11E8-B48F-1D18A9856A87
last_name: Kong
orcid: 0000-0002-3066-6941
- first_name: Ming
full_name: Gu, Ming
last_name: Gu
- first_name: Jiaguang
full_name: Sun, Jiaguang
last_name: Sun
- first_name: Lui
full_name: Sha, Lui
last_name: Sha
citation:
ama: 'Jiang Y, Yang Y, Liu H, et al. From stateflow simulation to verified implementation:
A verification approach and a real-time train controller design. In: IEEE; 2016.
doi:10.1109/RTAS.2016.7461337'
apa: 'Jiang, Y., Yang, Y., Liu, H., Kong, H., Gu, M., Sun, J., & Sha, L. (2016).
From stateflow simulation to verified implementation: A verification approach
and a real-time train controller design. Presented at the RTAS: Real-time and
Embedded Technology and Applications Symposium, Vienna, Austria: IEEE. https://doi.org/10.1109/RTAS.2016.7461337'
chicago: 'Jiang, Yu, Yixiao Yang, Han Liu, Hui Kong, Ming Gu, Jiaguang Sun, and
Lui Sha. “From Stateflow Simulation to Verified Implementation: A Verification
Approach and a Real-Time Train Controller Design.” IEEE, 2016. https://doi.org/10.1109/RTAS.2016.7461337.'
ieee: 'Y. Jiang et al., “From stateflow simulation to verified implementation:
A verification approach and a real-time train controller design,” presented at
the RTAS: Real-time and Embedded Technology and Applications Symposium, Vienna,
Austria, 2016.'
ista: 'Jiang Y, Yang Y, Liu H, Kong H, Gu M, Sun J, Sha L. 2016. From stateflow
simulation to verified implementation: A verification approach and a real-time
train controller design. RTAS: Real-time and Embedded Technology and Applications
Symposium, 7461337.'
mla: 'Jiang, Yu, et al. From Stateflow Simulation to Verified Implementation:
A Verification Approach and a Real-Time Train Controller Design. 7461337,
IEEE, 2016, doi:10.1109/RTAS.2016.7461337.'
short: Y. Jiang, Y. Yang, H. Liu, H. Kong, M. Gu, J. Sun, L. Sha, in:, IEEE, 2016.
conference:
end_date: 2016-04-14
location: Vienna, Austria
name: 'RTAS: Real-time and Embedded Technology and Applications Symposium'
start_date: 2016-04-11
date_created: 2018-12-11T11:50:58Z
date_published: 2016-04-27T00:00:00Z
date_updated: 2021-01-12T06:49:26Z
day: '27'
ddc:
- '005'
department:
- _id: ToHe
doi: 10.1109/RTAS.2016.7461337
file:
- access_level: open_access
checksum: 42f0462911cc9957f2356b12fb33b4b6
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:12:31Z
date_updated: 2020-07-14T12:44:41Z
file_id: '4949'
file_name: IST-2017-780-v1+1_RTAS-42-Camera-Ready.pdf
file_size: 1293599
relation: main_file
file_date_updated: 2020-07-14T12:44:41Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
publication_status: published
publisher: IEEE
publist_id: '6069'
pubrep_id: '780'
quality_controlled: '1'
scopus_import: 1
status: public
title: 'From stateflow simulation to verified implementation: A verification approach
and a real-time train controller design'
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '1335'
abstract:
- lang: eng
text: In this paper we review various automata-theoretic formalisms for expressing
quantitative properties. We start with finite-state Boolean automata that express
the traditional regular properties. We then consider weighted ω-automata that
can measure the average density of events, which finite-state Boolean automata
cannot. However, even weighted ω-automata cannot express basic performance properties
like average response time. We finally consider two formalisms of weighted ω-automata
with monitors, where the monitors are either (a) counters or (b) weighted automata
themselves. We present a translation result to establish that these two formalisms
are equivalent. Weighted ω-automata with monitors generalize weighted ω-automata,
and can express average response time property. They present a natural, robust,
and expressive framework for quantitative specifications, with important decidable
properties.
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Quantitative monitor automata. In: Vol
9837. Springer; 2016:23-38. doi:10.1007/978-3-662-53413-7_2'
apa: 'Chatterjee, K., Henzinger, T. A., & Otop, J. (2016). Quantitative monitor
automata (Vol. 9837, pp. 23–38). Presented at the SAS: Static Analysis Symposium,
Edinburgh, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53413-7_2'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Quantitative
Monitor Automata,” 9837:23–38. Springer, 2016. https://doi.org/10.1007/978-3-662-53413-7_2.
ieee: 'K. Chatterjee, T. A. Henzinger, and J. Otop, “Quantitative monitor automata,”
presented at the SAS: Static Analysis Symposium, Edinburgh, United Kingdom, 2016,
vol. 9837, pp. 23–38.'
ista: 'Chatterjee K, Henzinger TA, Otop J. 2016. Quantitative monitor automata.
SAS: Static Analysis Symposium, LNCS, vol. 9837, 23–38.'
mla: Chatterjee, Krishnendu, et al. Quantitative Monitor Automata. Vol. 9837,
Springer, 2016, pp. 23–38, doi:10.1007/978-3-662-53413-7_2.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.
conference:
end_date: 2016-09-10
location: Edinburgh, United Kingdom
name: 'SAS: Static Analysis Symposium'
start_date: 2016-09-08
corr_author: '1'
date_created: 2018-12-11T11:51:26Z
date_published: 2016-08-31T00:00:00Z
date_updated: 2025-09-22T08:19:49Z
day: '31'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-662-53413-7_2
ec_funded: 1
external_id:
arxiv:
- '1604.06764'
isi:
- '000388924600002'
intvolume: ' 9837'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1604.06764
month: '08'
oa: 1
oa_version: Preprint
page: 23 - 38
project:
- _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: Formal methods for the design and analysis of complex systems
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication_status: published
publisher: Springer
publist_id: '5932'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantitative monitor automata
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9837
year: '2016'
...
---
_id: '1341'
abstract:
- lang: eng
text: In resource allocation games, selfish players share resources that are needed
in order to fulfill their objectives. The cost of using a resource depends on
the load on it. In the traditional setting, the players make their choices concurrently
and in one-shot. That is, a strategy for a player is a subset of the resources.
We introduce and study dynamic resource allocation games. In this setting, the
game proceeds in phases. In each phase each player chooses one resource. A scheduler
dictates the order in which the players proceed in a phase, possibly scheduling
several players to proceed concurrently. The game ends when each player has collected
a set of resources that fulfills his objective. The cost for each player then
depends on this set as well as on the load on the resources in it – we consider
both congestion and cost-sharing games. We argue that the dynamic setting is the
suitable setting for many applications in practice. We study the stability of
dynamic resource allocation games, where the appropriate notion of stability is
that of subgame perfect equilibrium, study the inefficiency incurred due to selfish
behavior, and also study problems that are particular to the dynamic setting,
like constraints on the order in which resources can be chosen or the problem
of finding a scheduler that achieves stability.
acknowledgement: This research was supported in part by the European Research Council
(ERC) under grants 267989 (QUAREM) and 278410 (QUALITY), and by the Austrian Science
Fund (FWF) under grants S11402-N23 (RiSE) and Z211-N23 (Wittgenstein Award).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Henzinger TA, Kupferman O. Dynamic resource allocation games. In:
Vol 9928. Springer; 2016:153-166. doi:10.1007/978-3-662-53354-3_13'
apa: 'Avni, G., Henzinger, T. A., & Kupferman, O. (2016). Dynamic resource allocation
games (Vol. 9928, pp. 153–166). Presented at the SAGT: Symposium on Algorithmic
Game Theory, Liverpool, United Kingdom: Springer. https://doi.org/10.1007/978-3-662-53354-3_13'
chicago: Avni, Guy, Thomas A Henzinger, and Orna Kupferman. “Dynamic Resource Allocation
Games,” 9928:153–66. Springer, 2016. https://doi.org/10.1007/978-3-662-53354-3_13.
ieee: 'G. Avni, T. A. Henzinger, and O. Kupferman, “Dynamic resource allocation
games,” presented at the SAGT: Symposium on Algorithmic Game Theory, Liverpool,
United Kingdom, 2016, vol. 9928, pp. 153–166.'
ista: 'Avni G, Henzinger TA, Kupferman O. 2016. Dynamic resource allocation games.
SAGT: Symposium on Algorithmic Game Theory, LNCS, vol. 9928, 153–166.'
mla: Avni, Guy, et al. Dynamic Resource Allocation Games. Vol. 9928, Springer,
2016, pp. 153–66, doi:10.1007/978-3-662-53354-3_13.
short: G. Avni, T.A. Henzinger, O. Kupferman, in:, Springer, 2016, pp. 153–166.
conference:
end_date: 2016-09-21
location: Liverpool, United Kingdom
name: 'SAGT: Symposium on Algorithmic Game Theory'
start_date: 2016-09-19
corr_author: '1'
date_created: 2018-12-11T11:51:28Z
date_published: 2016-09-01T00:00:00Z
date_updated: 2026-04-16T09:35:14Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-662-53354-3_13
ec_funded: 1
external_id:
isi:
- '000389020400013'
file:
- access_level: open_access
checksum: 0825eefd4e22774f6f62cb7d7389b05a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:14:22Z
date_updated: 2020-07-14T12:44:45Z
file_id: '5073'
file_name: IST-2016-645-v1+1_sagt-cr.pdf
file_size: 243458
relation: main_file
file_date_updated: 2020-07-14T12:44:45Z
has_accepted_license: '1'
intvolume: ' 9928'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Preprint
page: 153 - 166
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: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Springer
publist_id: '5926'
pubrep_id: '645'
quality_controlled: '1'
related_material:
record:
- id: '6761'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Dynamic resource allocation games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9928
year: '2016'
...
---
_id: '1390'
abstract:
- lang: eng
text: "The goal of automatic program repair is to identify a set of syntactic changes
that can turn a program that is incorrect with respect\r\nto a given specification
into a correct one. Existing program repair techniques typically aim to find any
program that meets the given specification. Such “best-effort” strategies can
end up generating a program that is quite different from the original one. Novel
techniques have been proposed to compute syntactically minimal program fixes,
but the smallest syntactic fix to a program can still significantly alter the
original program’s behaviour. We propose a new approach to program repair based
on program distances, which can quantify changes not only to the program syntax
but also to the program semantics. We call this the quantitative program repair
problem where the “optimal” repair is derived using multiple distances. We implement
a solution to the quantitative repair\r\nproblem in a prototype tool called Qlose\r\n(Quantitatively
close), using the program synthesizer Sketch. We evaluate the effectiveness of
different distances in obtaining desirable repairs by evaluating\r\nQlose on programs
taken from educational tools such as CodeHunt and edX."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Loris
full_name: D'Antoni, Loris
last_name: D'Antoni
- first_name: Roopsha
full_name: Samanta, Roopsha
id: 3D2AAC08-F248-11E8-B48F-1D18A9856A87
last_name: Samanta
- first_name: Rishabh
full_name: Singh, Rishabh
last_name: Singh
citation:
ama: 'D’Antoni L, Samanta R, Singh R. QLOSE: Program repair with quantitative objectives.
In: Vol 9780. Springer; 2016:383-401. doi:10.1007/978-3-319-41540-6_21'
apa: 'D’Antoni, L., Samanta, R., & Singh, R. (2016). QLOSE: Program repair with
quantitative objectives (Vol. 9780, pp. 383–401). Presented at the CAV: Computer
Aided Verification, Toronto, Canada: Springer. https://doi.org/10.1007/978-3-319-41540-6_21'
chicago: 'D’Antoni, Loris, Roopsha Samanta, and Rishabh Singh. “QLOSE: Program Repair
with Quantitative Objectives,” 9780:383–401. Springer, 2016. https://doi.org/10.1007/978-3-319-41540-6_21.'
ieee: 'L. D’Antoni, R. Samanta, and R. Singh, “QLOSE: Program repair with quantitative
objectives,” presented at the CAV: Computer Aided Verification, Toronto, Canada,
2016, vol. 9780, pp. 383–401.'
ista: 'D’Antoni L, Samanta R, Singh R. 2016. QLOSE: Program repair with quantitative
objectives. CAV: Computer Aided Verification, LNCS, vol. 9780, 383–401.'
mla: 'D’Antoni, Loris, et al. QLOSE: Program Repair with Quantitative Objectives.
Vol. 9780, Springer, 2016, pp. 383–401, doi:10.1007/978-3-319-41540-6_21.'
short: L. D’Antoni, R. Samanta, R. Singh, in:, Springer, 2016, pp. 383–401.
conference:
end_date: 2016-07-23
location: Toronto, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2016-07-17
corr_author: '1'
date_created: 2018-12-11T11:51:45Z
date_published: 2016-07-13T00:00:00Z
date_updated: 2025-09-22T07:30:07Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-319-41540-6_21
ec_funded: 1
external_id:
isi:
- '000387731400021'
intvolume: ' 9780'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 383 - 401
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: Formal methods for the design and analysis of complex systems
publication_status: published
publisher: Springer
publist_id: '5819'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'QLOSE: Program repair with quantitative objectives'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 9780
year: '2016'
...