---
_id: '3342'
abstract:
- lang: eng
text: 'We consider Markov decision processes (MDPs) with ω-regular specifications
given as parity objectives. We consider the problem of computing the set of almost-sure
winning states from where the objective can be ensured with probability 1. The
algorithms for the computation of the almost-sure winning set for parity objectives
iteratively use the solutions for the almost-sure winning set for Büchi objectives
(a special case of parity objectives). Our contributions are as follows: First,
we present the first subquadratic symbolic algorithm to compute the almost-sure
winning set for MDPs with Büchi objectives; our algorithm takes O(nm) symbolic
steps as compared to the previous known algorithm that takes O(n 2) symbolic steps,
where n is the number of states and m is the number of edges of the MDP. In practice
MDPs often have constant out-degree, and then our symbolic algorithm takes O(nn) symbolic
steps, as compared to the previous known O(n 2) symbolic steps algorithm. Second,
we present a new algorithm, namely win-lose algorithm, with the following two
properties: (a) the algorithm iteratively computes subsets of the almost-sure
winning set and its complement, as compared to all previous algorithms that discover
the almost-sure winning set upon termination; and (b) requires O(nK) symbolic
steps, where K is the maximal number of edges of strongly connected components
(scc’s) of the MDP. The win-lose algorithm requires symbolic computation of scc’s.
Third, we improve the algorithm for symbolic scc computation; the previous known
algorithm takes linear symbolic steps, and our new algorithm improves the constants
associated with the linear number of steps. In the worst case the previous known
algorithm takes 5·n symbolic steps, whereas our new algorithm takes 4 ·n symbolic
steps.'
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Manas
full_name: Joglekar, Manas
last_name: Joglekar
- first_name: Shah
full_name: Nisarg, Shah
last_name: Nisarg
citation:
ama: 'Chatterjee K, Henzinger M, Joglekar M, Nisarg S. Symbolic algorithms for qualitative
analysis of Markov decision processes with Büchi objectives. In: Gopalakrishnan
G, Qadeer S, eds. Vol 6806. Springer; 2011:260-276. doi:10.1007/978-3-642-22110-1_21'
apa: 'Chatterjee, K., Henzinger, M., Joglekar, M., & Nisarg, S. (2011). Symbolic
algorithms for qualitative analysis of Markov decision processes with Büchi objectives.
In G. Gopalakrishnan & S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented
at the CAV: Computer Aided Verification, Snowbird, USA: Springer. https://doi.org/10.1007/978-3-642-22110-1_21'
chicago: Chatterjee, Krishnendu, Monika Henzinger, Manas Joglekar, and Shah Nisarg.
“Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with
Büchi Objectives.” edited by Ganesh Gopalakrishnan and Shaz Qadeer, 6806:260–76.
Springer, 2011. https://doi.org/10.1007/978-3-642-22110-1_21.
ieee: 'K. Chatterjee, M. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms
for qualitative analysis of Markov decision processes with Büchi objectives,”
presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806,
pp. 260–276.'
ista: 'Chatterjee K, Henzinger M, Joglekar M, Nisarg S. 2011. Symbolic algorithms
for qualitative analysis of Markov decision processes with Büchi objectives. CAV:
Computer Aided Verification, LNCS, vol. 6806, 260–276.'
mla: Chatterjee, Krishnendu, et al. Symbolic Algorithms for Qualitative Analysis
of Markov Decision Processes with Büchi Objectives. Edited by Ganesh Gopalakrishnan
and Shaz Qadeer, vol. 6806, Springer, 2011, pp. 260–76, doi:10.1007/978-3-642-22110-1_21.
short: K. Chatterjee, M. Henzinger, M. Joglekar, S. Nisarg, in:, G. Gopalakrishnan,
S. Qadeer (Eds.), Springer, 2011, pp. 260–276.
conference:
end_date: 2011-07-20
location: Snowbird, USA
name: 'CAV: Computer Aided Verification'
start_date: 2011-07-14
date_created: 2018-12-11T12:02:47Z
date_published: 2011-08-11T00:00:00Z
date_updated: 2025-09-29T13:50:32Z
day: '11'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22110-1_21
editor:
- first_name: Ganesh
full_name: Gopalakrishnan, Ganesh
last_name: Gopalakrishnan
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
external_id:
arxiv:
- '1104.3348'
fulldoi: https://doi.org/10.1007/978-3-642-22110-1_21
intvolume: ' 6806'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3348
month: '08'
oa: 1
oa_version: Preprint
page: 260 - 276
project:
- _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: '3282'
quality_controlled: '1'
related_material:
record:
- id: '2831'
relation: later_version
status: public
scopus_import: '1'
status: public
title: Symbolic algorithms for qualitative analysis of Markov decision processes with
Büchi objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6806
year: '2011'
...
---
_id: '3343'
abstract:
- lang: eng
text: 'We present faster and dynamic algorithms for the following problems arising
in probabilistic verification: Computation of the maximal end-component (mec)
decomposition of Markov decision processes (MDPs), and of the almost sure winning
set for reachability and parity objectives in MDPs. We achieve the following running
time for static algorithms in MDPs with graphs of n vertices and m edges: (1)
O(m · min{ √m, n2/3 }) for the mec decomposition, improving the longstanding O(m·n)
bound; (2) O(m·n2/3) for reachability objectives, improving the previous O(m ·
√m) bound for m > n4/3; and (3) O(m · min{ √m, n2/3 } · log(d)) for parity
objectives with d priorities, improving the previous O(m · √m · d) bound. We also
give incremental and decremental algorithms in linear time for mec decomposition
and reachability objectives and O(m · log d) time for parity ob jectives.'
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: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Chatterjee K, Henzinger M. Faster and dynamic algorithms for maximal end-component
decomposition and related graph problems in probabilistic verification. In: SIAM;
2011:1318-1336. doi:10.1137/1.9781611973082.101'
apa: 'Chatterjee, K., & Henzinger, M. (2011). Faster and dynamic algorithms
for maximal end-component decomposition and related graph problems in probabilistic
verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms,
San Francisco, SA, United States: SIAM. https://doi.org/10.1137/1.9781611973082.101'
chicago: Chatterjee, Krishnendu, and Monika Henzinger. “Faster and Dynamic Algorithms
for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic
Verification,” 1318–36. SIAM, 2011. https://doi.org/10.1137/1.9781611973082.101.
ieee: 'K. Chatterjee and M. Henzinger, “Faster and dynamic algorithms for maximal
end-component decomposition and related graph problems in probabilistic verification,”
presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United
States, 2011, pp. 1318–1336.'
ista: 'Chatterjee K, Henzinger M. 2011. Faster and dynamic algorithms for maximal
end-component decomposition and related graph problems in probabilistic verification.
SODA: Symposium on Discrete Algorithms, 1318–1336.'
mla: Chatterjee, Krishnendu, and Monika Henzinger. Faster and Dynamic Algorithms
for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic
Verification. SIAM, 2011, pp. 1318–36, doi:10.1137/1.9781611973082.101.
short: K. Chatterjee, M. Henzinger, in:, SIAM, 2011, pp. 1318–1336.
conference:
end_date: 2011-01-25
location: San Francisco, SA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2011-01-23
date_created: 2018-12-11T12:02:47Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2024-11-06T12:28:50Z
day: '01'
department:
- _id: KrCh
doi: 10.1137/1.9781611973082.101
fulldoi: https://doi.org/10.1137/1.9781611973082.101
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprints.cs.univie.ac.at/21/
month: '01'
oa: 1
oa_version: Submitted Version
page: 1318 - 1336
publication_status: published
publisher: SIAM
publist_id: '3278'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster and dynamic algorithms for maximal end-component decomposition and related
graph problems in probabilistic verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
OA_type: closed access
_id: '3344'
abstract:
- lang: eng
text: 'Games played on graphs provide the mathematical framework to analyze several
important problems in computer science as well as mathematics, such as the synthesis
problem of Church, model checking of open reactive systems and many others. On
the basis of mode of interaction of the players these games can be classified
as follows: (a) turn-based (players make moves in turns); and (b) concurrent (players
make moves simultaneously). On the basis of the information available to the players
these games can be classified as follows: (a) perfect-information (players have
perfect view of the game); and (b) partial-information (players have partial view
of the game). In this talk we will consider all these classes of games with reachability
objectives, where the goal of one player is to reach a set of target vertices
of the graph, and the goal of the opponent player is to prevent the player from
reaching the target. We will survey the results for various classes of games,
and the results range from linear time decision algorithms to EXPTIME-complete
problems to undecidable problems.'
alternative_title:
- LNCS
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
citation:
ama: 'Chatterjee K. Graph games with reachability objectives. In: 5th International
Workshop on Reachability Problems. Vol 6945. Springer; 2011:1-1. doi:10.1007/978-3-642-24288-5_1'
apa: 'Chatterjee, K. (2011). Graph games with reachability objectives. In 5th
International Workshop on Reachability Problems (Vol. 6945, pp. 1–1). Genoa,
Italy: Springer. https://doi.org/10.1007/978-3-642-24288-5_1'
chicago: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” In
5th International Workshop on Reachability Problems, 6945:1–1. Springer,
2011. https://doi.org/10.1007/978-3-642-24288-5_1.
ieee: K. Chatterjee, “Graph games with reachability objectives,” in 5th International
Workshop on Reachability Problems, Genoa, Italy, 2011, vol. 6945, pp. 1–1.
ista: 'Chatterjee K. 2011. Graph games with reachability objectives. 5th International
Workshop on Reachability Problems. RP: Reachability Problems, LNCS, vol. 6945,
1–1.'
mla: Chatterjee, Krishnendu. “Graph Games with Reachability Objectives.” 5th
International Workshop on Reachability Problems, vol. 6945, Springer, 2011,
pp. 1–1, doi:10.1007/978-3-642-24288-5_1.
short: K. Chatterjee, in:, 5th International Workshop on Reachability Problems,
Springer, 2011, pp. 1–1.
conference:
end_date: 2011-09-30
location: Genoa, Italy
name: 'RP: Reachability Problems'
start_date: 2011-09-28
corr_author: '1'
date_created: 2018-12-11T12:02:47Z
date_published: 2011-10-15T00:00:00Z
date_updated: 2025-05-20T06:00:59Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-24288-5_1
fulldoi: https://doi.org/10.1007/978-3-642-24288-5_1
intvolume: ' 6945'
language:
- iso: eng
month: '10'
oa_version: None
page: 1 - 1
publication: 5th International Workshop on Reachability Problems
publication_identifier:
eisbn:
- '9783642242885'
eissn:
- 1611-3349
publication_status: published
publisher: Springer
publist_id: '3277'
quality_controlled: '1'
status: public
title: Graph games with reachability objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6945
year: '2011'
...
---
_id: '3345'
abstract:
- lang: eng
text: We consider Markov Decision Processes (MDPs) with mean-payoff parity and energy
parity objectives. In system design, the parity objective is used to encode ω-regular
specifications, and the mean-payoff and energy objectives can be used to model
quantitative resource constraints. The energy condition re- quires that the resource
level never drops below 0, and the mean-payoff condi- tion requires that the limit-average
value of the resource consumption is within a threshold. While these two (energy
and mean-payoff) classical conditions are equivalent for two-player games, we
show that they differ for MDPs. We show that the problem of deciding whether a
state is almost-sure winning (i.e., winning with probability 1) in energy parity
MDPs is in NP ∩ coNP, while for mean- payoff parity MDPs, the problem is solvable
in polynomial time, improving a recent PSPACE bound.
alternative_title:
- LNCS
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
citation:
ama: 'Chatterjee K, Doyen L. Energy and mean-payoff parity Markov Decision Processes.
In: Vol 6907. Springer; 2011:206-218. doi:10.1007/978-3-642-22993-0_21'
apa: 'Chatterjee, K., & Doyen, L. (2011). Energy and mean-payoff parity Markov
Decision Processes (Vol. 6907, pp. 206–218). Presented at the MFCS: Mathematical
Foundations of Computer Science, Warsaw, Poland: Springer. https://doi.org/10.1007/978-3-642-22993-0_21'
chicago: Chatterjee, Krishnendu, and Laurent Doyen. “Energy and Mean-Payoff Parity
Markov Decision Processes,” 6907:206–18. Springer, 2011. https://doi.org/10.1007/978-3-642-22993-0_21.
ieee: 'K. Chatterjee and L. Doyen, “Energy and mean-payoff parity Markov Decision
Processes,” presented at the MFCS: Mathematical Foundations of Computer Science,
Warsaw, Poland, 2011, vol. 6907, pp. 206–218.'
ista: 'Chatterjee K, Doyen L. 2011. Energy and mean-payoff parity Markov Decision
Processes. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6907,
206–218.'
mla: Chatterjee, Krishnendu, and Laurent Doyen. Energy and Mean-Payoff Parity
Markov Decision Processes. Vol. 6907, Springer, 2011, pp. 206–18, doi:10.1007/978-3-642-22993-0_21.
short: K. Chatterjee, L. Doyen, in:, Springer, 2011, pp. 206–218.
conference:
end_date: 2011-08-26
location: Warsaw, Poland
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:48Z
date_published: 2011-09-28T00:00:00Z
date_updated: 2023-02-23T12:23:59Z
day: '28'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22993-0_21
external_id:
arxiv:
- '1104.2909'
fulldoi: https://doi.org/10.1007/978-3-642-22993-0_21
intvolume: ' 6907'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.2909
month: '09'
oa: 1
oa_version: Preprint
page: 206 - 218
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3276'
quality_controlled: '1'
related_material:
record:
- id: '5387'
relation: earlier_version
status: public
scopus_import: 1
status: public
title: Energy and mean-payoff parity Markov Decision Processes
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6907
year: '2011'
...
---
_id: '3346'
abstract:
- lang: eng
text: We study Markov decision processes (MDPs) with multiple limit-average (or
mean-payoff) functions. We consider two different objectives, namely, expectation
and satisfaction objectives. Given an MDP with k reward functions, in the expectation
objective the goal is to maximize the expected limit-average value, and in the
satisfaction objective the goal is to maximize the probability of runs such that
the limit-average value stays above a given vector. We show that under the expectation
objective, in contrast to the single-objective case, both randomization and memory
are necessary for strategies, and that finite-memory randomized strategies are
sufficient. Under the satisfaction objective, in contrast to the single-objective
case, infinite memory is necessary for strategies, and that randomized memoryless
strategies are sufficient for epsilon-approximation, for all epsilon>;0. We
further prove that the decision problems for both expectation and satisfaction
objectives can be solved in polynomial time and the trade-off curve (Pareto curve)
can be epsilon-approximated in time polynomial in the size of the MDP and 1/epsilon,
and exponential in the number of reward functions, for all epsilon>;0. Our
results also reveal flaws in previous work for MDPs with multiple mean-payoff
functions under the expectation objective, correct the flaws and obtain improved
results.
article_number: '5970225'
article_processing_charge: No
arxiv: 1
author:
- first_name: Tomáš
full_name: Brázdil, Tomáš
last_name: Brázdil
- first_name: Václav
full_name: Brožek, Václav
last_name: Brožek
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Vojtěch
full_name: Forejt, Vojtěch
last_name: Forejt
- first_name: Antonín
full_name: Kučera, Antonín
last_name: Kučera
citation:
ama: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. Two views on multiple
mean payoff objectives in Markov Decision Processes. In: IEEE; 2011. doi:10.1109/LICS.2011.10'
apa: 'Brázdil, T., Brožek, V., Chatterjee, K., Forejt, V., & Kučera, A. (2011).
Two views on multiple mean payoff objectives in Markov Decision Processes. Presented
at the LICS: Logic in Computer Science, Toronto, Canada: IEEE. https://doi.org/10.1109/LICS.2011.10'
chicago: Brázdil, Tomáš, Václav Brožek, Krishnendu Chatterjee, Vojtěch Forejt, and
Antonín Kučera. “Two Views on Multiple Mean Payoff Objectives in Markov Decision
Processes.” IEEE, 2011. https://doi.org/10.1109/LICS.2011.10.
ieee: 'T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, and A. Kučera, “Two views
on multiple mean payoff objectives in Markov Decision Processes,” presented at
the LICS: Logic in Computer Science, Toronto, Canada, 2011.'
ista: 'Brázdil T, Brožek V, Chatterjee K, Forejt V, Kučera A. 2011. Two views on
multiple mean payoff objectives in Markov Decision Processes. LICS: Logic in Computer
Science, 5970225.'
mla: Brázdil, Tomáš, et al. Two Views on Multiple Mean Payoff Objectives in Markov
Decision Processes. 5970225, IEEE, 2011, doi:10.1109/LICS.2011.10.
short: T. Brázdil, V. Brožek, K. Chatterjee, V. Forejt, A. Kučera, in:, IEEE, 2011.
conference:
end_date: 2011-06-24
location: Toronto, Canada
name: 'LICS: Logic in Computer Science'
start_date: 2011-06-21
date_created: 2018-12-11T12:02:48Z
date_published: 2011-06-21T00:00:00Z
date_updated: 2025-09-30T09:07:47Z
day: '21'
department:
- _id: KrCh
doi: 10.1109/LICS.2011.10
ec_funded: 1
external_id:
arxiv:
- '1104.3489'
isi:
- '000297350400006'
fulldoi: https://doi.org/10.1109/LICS.2011.10
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3489
month: '06'
oa: 1
oa_version: Submitted Version
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3275'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Two views on multiple mean payoff objectives in Markov Decision Processes
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '3347'
abstract:
- lang: eng
text: 'The class of omega-regular languages provides a robust specification language
in verification. Every omega-regular condition can be decomposed into a safety
part and a liveness part. The liveness part ensures that something good happens
"eventually". Finitary liveness was proposed by Alur and Henzinger as
a stronger formulation of liveness. It requires that there exists an unknown,
fixed bound b such that something good happens within b transitions. In this work
we consider automata with finitary acceptance conditions defined by finitary Buchi,
parity and Streett languages. We study languages expressible by such automata:
we give their topological complexity and present a regular-expression characterization.
We compare the expressive power of finitary automata and give optimal algorithms
for classical decisions questions. We show that the finitary languages are Sigma
2-complete; we present a complete picture of the expressive power of various classes
of automata with finitary and infinitary acceptance conditions; we show that the
languages defined by finitary parity automata exactly characterize the star-free
fragment of omega B-regular languages; and we show that emptiness is NLOGSPACE-complete
and universality as well as language inclusion are PSPACE-complete for finitary
parity and Streett automata.'
alternative_title:
- LNCS
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: Nathanaël
full_name: Fijalkow, Nathanaël
id: A1B5DD72-E997-11E9-8398-E808B6C6ADC0
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. Finitary languages. In: Vol 6638. Springer; 2011:216-226.
doi:10.1007/978-3-642-21254-3_16'
apa: 'Chatterjee, K., & Fijalkow, N. (2011). Finitary languages (Vol. 6638,
pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications,
Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_16'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “Finitary Languages,” 6638:216–26.
Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_16.
ieee: 'K. Chatterjee and N. Fijalkow, “Finitary languages,” presented at the LATA:
Language and Automata Theory and Applications, Tarragona, Spain, 2011, vol. 6638,
pp. 216–226.'
ista: 'Chatterjee K, Fijalkow N. 2011. Finitary languages. LATA: Language and Automata
Theory and Applications, LNCS, vol. 6638, 216–226.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. Finitary Languages.
Vol. 6638, Springer, 2011, pp. 216–26, doi:10.1007/978-3-642-21254-3_16.
short: K. Chatterjee, N. Fijalkow, in:, Springer, 2011, pp. 216–226.
conference:
end_date: 2011-05-31
location: Tarragona, Spain
name: 'LATA: Language and Automata Theory and Applications'
start_date: 2011-05-26
corr_author: '1'
date_created: 2018-12-11T12:02:48Z
date_published: 2011-06-16T00:00:00Z
date_updated: 2024-10-09T20:54:28Z
day: '16'
department:
- _id: KrCh
doi: 10.1007/978-3-642-21254-3_16
external_id:
arxiv:
- '1101.1727'
fulldoi: https://doi.org/10.1007/978-3-642-21254-3_16
intvolume: ' 6638'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1101.1727
month: '06'
oa: 1
oa_version: Preprint
page: 216 - 226
project:
- _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: '3274'
quality_controlled: '1'
scopus_import: 1
status: public
title: Finitary languages
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6638
year: '2011'
...
---
_id: '3348'
abstract:
- lang: eng
text: We study synthesis of controllers for real-time systems, where the objective
is to stay in a given safe set. The problem is solved by obtaining winning strategies
in the setting of concurrent two-player timed automaton games with safety objectives.
To prevent a player from winning by blocking time, we restrict each player to
strategies that ensure that the player cannot be responsible for causing a zeno
run. We construct winning strategies for the controller which require access only
to (1) the system clocks (thus, controllers which require their own internal infinitely
precise clocks are not necessary), and (2) a linear (in the number of clocks)
number of memory bits. Precisely, we show that for safety objectives, a memory
of size (3 · |C|+lg(|C|+1)) bits suffices for winning controller strategies, where
C is the set of clocks of the timed automaton game, significantly improving the
previous known exponential bound. We also settle the open question of whether
winning region controller strategies require memory for safety objectives by showing
with an example the necessity of memory for region strategies to win for safety
objectives.
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: Vinayak
full_name: Prabhu, Vinayak
last_name: Prabhu
citation:
ama: 'Chatterjee K, Prabhu V. Synthesis of memory efficient real time controllers
for safety objectives. In: Springer; 2011:221-230. doi:10.1145/1967701.1967734'
apa: 'Chatterjee, K., & Prabhu, V. (2011). Synthesis of memory efficient real
time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid
Systems - Computation and Control, Chicago, USA: Springer. https://doi.org/10.1145/1967701.1967734'
chicago: Chatterjee, Krishnendu, and Vinayak Prabhu. “Synthesis of Memory Efficient
Real Time Controllers for Safety Objectives,” 221–30. Springer, 2011. https://doi.org/10.1145/1967701.1967734.
ieee: 'K. Chatterjee and V. Prabhu, “Synthesis of memory efficient real time controllers
for safety objectives,” presented at the HSCC: Hybrid Systems - Computation and
Control, Chicago, USA, 2011, pp. 221–230.'
ista: 'Chatterjee K, Prabhu V. 2011. Synthesis of memory efficient real time controllers
for safety objectives. HSCC: Hybrid Systems - Computation and Control, 221–230.'
mla: Chatterjee, Krishnendu, and Vinayak Prabhu. Synthesis of Memory Efficient
Real Time Controllers for Safety Objectives. Springer, 2011, pp. 221–30, doi:10.1145/1967701.1967734.
short: K. Chatterjee, V. Prabhu, in:, Springer, 2011, pp. 221–230.
conference:
end_date: 2011-04-14
location: Chicago, USA
name: 'HSCC: Hybrid Systems - Computation and Control'
start_date: 2011-04-12
corr_author: '1'
date_created: 2018-12-11T12:02:49Z
date_published: 2011-01-31T00:00:00Z
date_updated: 2025-06-11T08:11:56Z
day: '31'
department:
- _id: KrCh
doi: 10.1145/1967701.1967734
external_id:
arxiv:
- '1101.5842'
fulldoi: https://doi.org/10.1145/1967701.1967734
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1101.5842
month: '01'
oa: 1
oa_version: Submitted Version
page: 221 - 230
project:
- _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: '3273'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis of memory efficient real time controllers for safety objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3349'
abstract:
- lang: eng
text: 'Games on graphs provide a natural model for reactive non-terminating systems.
In such games, the interaction of two players on an arena results in an infinite
path that describes a run of the system. Different settings are used to model
various open systems in computer science, as for instance turn-based or concurrent
moves, and deterministic or stochastic transitions. In this paper, we are interested
in turn-based games, and specifically in deterministic parity games and stochastic
reachability games (also known as simple stochastic games). We present a simple,
direct and efficient reduction from deterministic parity games to simple stochastic
games: it yields an arena whose size is linear up to a logarithmic factor in size
of the original arena.'
alternative_title:
- EPTCS
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: Nathanaël
full_name: Fijalkow, Nathanaël
last_name: Fijalkow
citation:
ama: 'Chatterjee K, Fijalkow N. A reduction from parity games to simple stochastic
games. In: Vol 54. EPTCS; 2011:74-86. doi:10.4204/EPTCS.54.6'
apa: 'Chatterjee, K., & Fijalkow, N. (2011). A reduction from parity games to
simple stochastic games (Vol. 54, pp. 74–86). Presented at the GandALF: Games,
Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. https://doi.org/10.4204/EPTCS.54.6'
chicago: Chatterjee, Krishnendu, and Nathanaël Fijalkow. “A Reduction from Parity
Games to Simple Stochastic Games,” 54:74–86. EPTCS, 2011. https://doi.org/10.4204/EPTCS.54.6.
ieee: 'K. Chatterjee and N. Fijalkow, “A reduction from parity games to simple stochastic
games,” presented at the GandALF: Games, Automata, Logic, and Formal Verification,
Minori, Italy, 2011, vol. 54, pp. 74–86.'
ista: 'Chatterjee K, Fijalkow N. 2011. A reduction from parity games to simple stochastic
games. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 54,
74–86.'
mla: Chatterjee, Krishnendu, and Nathanaël Fijalkow. A Reduction from Parity
Games to Simple Stochastic Games. Vol. 54, EPTCS, 2011, pp. 74–86, doi:10.4204/EPTCS.54.6.
short: K. Chatterjee, N. Fijalkow, in:, EPTCS, 2011, pp. 74–86.
conference:
end_date: 2011-06-17
location: Minori, Italy
name: 'GandALF: Games, Automata, Logic, and Formal Verification'
start_date: 2011-06-15
corr_author: '1'
date_created: 2018-12-11T12:02:49Z
date_published: 2011-06-04T00:00:00Z
date_updated: 2025-06-11T08:12:12Z
day: '04'
department:
- _id: KrCh
doi: 10.4204/EPTCS.54.6
external_id:
arxiv:
- '1106.1232'
fulldoi: https://doi.org/10.4204/EPTCS.54.6
intvolume: ' 54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1106.1232
month: '06'
oa: 1
oa_version: Submitted Version
page: 74 - 86
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: EPTCS
publist_id: '3272'
scopus_import: '1'
status: public
title: A reduction from parity games to simple stochastic games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2011'
...
---
_id: '3350'
abstract:
- lang: eng
text: A controller for a discrete game with ω-regular objectives requires attention
if, intuitively, it requires measuring the state and switching from the current
control action. Minimum attention controllers are preferable in modern shared
implementations of cyber-physical systems because they produce the least burden
on system resources such as processor time or communication bandwidth. We give
algorithms to compute minimum attention controllers for ω-regular objectives in
imperfect information discrete two-player games. We show a polynomial-time reduction
from minimum attention controller synthesis to synthesis of controllers for mean-payoff
parity objectives in games of incomplete information. This gives an optimal EXPTIME-complete
synthesis algorithm. We show that the minimum attention controller problem is
decidable for infinite state systems with finite bisimulation quotients. In particular,
the problem is decidable for timed and rectangular automata.
alternative_title:
- LNCS
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Chatterjee K, Majumdar R. Minimum attention controller synthesis for omega
regular objectives. In: Fahrenberg U, Tripakis S, eds. Vol 6919. Springer; 2011:145-159.
doi:10.1007/978-3-642-24310-3_11'
apa: 'Chatterjee, K., & Majumdar, R. (2011). Minimum attention controller synthesis
for omega regular objectives. In U. Fahrenberg & S. Tripakis (Eds.) (Vol.
6919, pp. 145–159). Presented at the FORMATS: Formal Modeling and Analysis of
Timed Systems, Aalborg, Denmark: Springer. https://doi.org/10.1007/978-3-642-24310-3_11'
chicago: Chatterjee, Krishnendu, and Ritankar Majumdar. “Minimum Attention Controller
Synthesis for Omega Regular Objectives.” edited by Uli Fahrenberg and Stavros
Tripakis, 6919:145–59. Springer, 2011. https://doi.org/10.1007/978-3-642-24310-3_11.
ieee: 'K. Chatterjee and R. Majumdar, “Minimum attention controller synthesis for
omega regular objectives,” presented at the FORMATS: Formal Modeling and Analysis
of Timed Systems, Aalborg, Denmark, 2011, vol. 6919, pp. 145–159.'
ista: 'Chatterjee K, Majumdar R. 2011. Minimum attention controller synthesis for
omega regular objectives. FORMATS: Formal Modeling and Analysis of Timed Systems,
LNCS, vol. 6919, 145–159.'
mla: Chatterjee, Krishnendu, and Ritankar Majumdar. Minimum Attention Controller
Synthesis for Omega Regular Objectives. Edited by Uli Fahrenberg and Stavros
Tripakis, vol. 6919, Springer, 2011, pp. 145–59, doi:10.1007/978-3-642-24310-3_11.
short: K. Chatterjee, R. Majumdar, in:, U. Fahrenberg, S. Tripakis (Eds.), Springer,
2011, pp. 145–159.
conference:
end_date: 2011-09-23
location: Aalborg, Denmark
name: 'FORMATS: Formal Modeling and Analysis of Timed Systems'
start_date: 2011-09-21
date_created: 2018-12-11T12:02:49Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:51Z
day: '01'
department:
- _id: KrCh
doi: 10.1007/978-3-642-24310-3_11
editor:
- first_name: Uli
full_name: Fahrenberg, Uli
last_name: Fahrenberg
- first_name: Stavros
full_name: Tripakis, Stavros
last_name: Tripakis
fulldoi: https://doi.org/10.1007/978-3-642-24310-3_11
intvolume: ' 6919'
language:
- iso: eng
month: '01'
oa_version: None
page: 145 - 159
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3271'
quality_controlled: '1'
scopus_import: 1
status: public
title: Minimum attention controller synthesis for omega regular objectives
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6919
year: '2011'
...
---
_id: '3351'
abstract:
- lang: eng
text: In two-player games on graph, the players construct an infinite path through
the game graph and get a reward computed by a payoff function over infinite paths.
Over weighted graphs, the typical and most studied payoff functions compute the
limit-average or the discounted sum of the rewards along the path. Besides their
simple definition, these two payoff functions enjoy the property that memoryless
optimal strategies always exist. In an attempt to construct other simple payoff
functions, we define a class of payoff functions which compute an (infinite) weighted
average of the rewards. This new class contains both the limit-average and the
discounted sum functions, and we show that they are the only members of this class
which induce memoryless optimal strategies, showing that there is essentially
no other simple payoff functions.
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: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Rohit
full_name: Singh, Rohit
last_name: Singh
citation:
ama: 'Chatterjee K, Doyen L, Singh R. On memoryless quantitative objectives. In:
Owe O, Steffen M, Telle JA, eds. Vol 6914. Springer; 2011:148-159. doi:10.1007/978-3-642-22953-4_13'
apa: 'Chatterjee, K., Doyen, L., & Singh, R. (2011). On memoryless quantitative
objectives. In O. Owe, M. Steffen, & J. A. Telle (Eds.) (Vol. 6914, pp. 148–159).
Presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway: Springer.
https://doi.org/10.1007/978-3-642-22953-4_13'
chicago: Chatterjee, Krishnendu, Laurent Doyen, and Rohit Singh. “On Memoryless
Quantitative Objectives.” edited by Olaf Owe, Martin Steffen, and Jan Arne Telle,
6914:148–59. Springer, 2011. https://doi.org/10.1007/978-3-642-22953-4_13.
ieee: 'K. Chatterjee, L. Doyen, and R. Singh, “On memoryless quantitative objectives,”
presented at the FCT: Fundamentals of Computation Theory, Oslo, Norway, 2011,
vol. 6914, pp. 148–159.'
ista: 'Chatterjee K, Doyen L, Singh R. 2011. On memoryless quantitative objectives.
FCT: Fundamentals of Computation Theory, LNCS, vol. 6914, 148–159.'
mla: Chatterjee, Krishnendu, et al. On Memoryless Quantitative Objectives.
Edited by Olaf Owe et al., vol. 6914, Springer, 2011, pp. 148–59, doi:10.1007/978-3-642-22953-4_13.
short: K. Chatterjee, L. Doyen, R. Singh, in:, O. Owe, M. Steffen, J.A. Telle (Eds.),
Springer, 2011, pp. 148–159.
conference:
end_date: 2011-08-25
location: Oslo, Norway
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2011-08-22
date_created: 2018-12-11T12:02:50Z
date_published: 2011-04-16T00:00:00Z
date_updated: 2025-06-11T08:12:32Z
day: '16'
department:
- _id: KrCh
doi: 10.1007/978-3-642-22953-4_13
editor:
- first_name: Olaf
full_name: Owe, Olaf
last_name: Owe
- first_name: Martin
full_name: Steffen, Martin
last_name: Steffen
- first_name: Jan Arne
full_name: Telle, Jan Arne
last_name: Telle
external_id:
arxiv:
- '1104.3211'
fulldoi: https://doi.org/10.1007/978-3-642-22953-4_13
intvolume: ' 6914'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1104.3211
month: '04'
oa: 1
oa_version: Submitted Version
page: 148 - 159
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: Springer
publist_id: '3270'
quality_controlled: '1'
scopus_import: '1'
status: public
title: On memoryless quantitative objectives
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6914
year: '2011'
...
---
_id: '3352'
abstract:
- lang: eng
text: Exploring the connection of biology with reactive systems to better understand
living systems.
article_processing_charge: No
author:
- first_name: Jasmin
full_name: Fisher, Jasmin
last_name: Fisher
- first_name: David
full_name: Harel, David
last_name: Harel
- 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: Fisher J, Harel D, Henzinger TA. Biology as reactivity. Communications of
the ACM. 2011;54(10):72-82. doi:10.1145/2001269.2001289
apa: Fisher, J., Harel, D., & Henzinger, T. A. (2011). Biology as reactivity.
Communications of the ACM. ACM. https://doi.org/10.1145/2001269.2001289
chicago: Fisher, Jasmin, David Harel, and Thomas A Henzinger. “Biology as Reactivity.”
Communications of the ACM. ACM, 2011. https://doi.org/10.1145/2001269.2001289.
ieee: J. Fisher, D. Harel, and T. A. Henzinger, “Biology as reactivity,” Communications
of the ACM, vol. 54, no. 10. ACM, pp. 72–82, 2011.
ista: Fisher J, Harel D, Henzinger TA. 2011. Biology as reactivity. Communications
of the ACM. 54(10), 72–82.
mla: Fisher, Jasmin, et al. “Biology as Reactivity.” Communications of the ACM,
vol. 54, no. 10, ACM, 2011, pp. 72–82, doi:10.1145/2001269.2001289.
short: J. Fisher, D. Harel, T.A. Henzinger, Communications of the ACM 54 (2011)
72–82.
date_created: 2018-12-11T12:02:50Z
date_published: 2011-10-01T00:00:00Z
date_updated: 2025-09-30T09:06:32Z
day: '01'
department:
- _id: ToHe
doi: 10.1145/2001269.2001289
ec_funded: 1
external_id:
isi:
- '000296022500019'
fulldoi: https://doi.org/10.1145/2001269.2001289
intvolume: ' 54'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 72 - 82
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
publication: Communications of the ACM
publication_status: published
publisher: ACM
publist_id: '3267'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Biology as reactivity
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 54
year: '2011'
...
---
_id: '3355'
abstract:
- lang: eng
text: Byzantine Fault Tolerant (BFT) protocols aim to improve the reliability of
distributed systems. They enable systems to tolerate arbitrary failures in a bounded
number of nodes. BFT protocols are usually proven correct for certain safety and
liveness properties. However, recent studies have shown that the performance of
state-of-the-art BFT protocols decreases drastically in the presence of even a
single malicious node. This motivates a formal quantitative analysis of BFT protocols
to investigate their performance characteristics under different scenarios. We
present HyPerf, a new hybrid methodology based on model checking and simulation
techniques for evaluating the performance of BFT protocols. We build a transition
system corresponding to a BFT protocol and systematically explore the set of behaviors
allowed by the protocol. We associate certain timing information with different
operations in the protocol, like cryptographic operations and message transmission.
After an elaborate state exploration, we use the time information to evaluate
the performance characteristics of the protocol using simulation techniques. We
integrate our framework in Mace, a tool for building and verifying distributed
systems. We evaluate the performance of PBFT using our framework. We describe
two different use-cases of our methodology. For the benign operation of the protocol,
we use the time information as random variables to compute the probability distribution
of the execution times. In the presence of faults, we estimate the worst-case
performance of the protocol for various attacks that can be employed by malicious
nodes. Our results show the importance of hybrid techniques in systematically
analyzing the performance of large-scale systems.
author:
- first_name: Raluca
full_name: Halalai, Raluca
id: 584C6850-E996-11E9-805B-F01764644770
last_name: Halalai
- 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: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
citation:
ama: 'Halalai R, Henzinger TA, Singh V. Quantitative evaluation of BFT protocols.
In: IEEE; 2011:255-264. doi:10.1109/QEST.2011.40'
apa: 'Halalai, R., Henzinger, T. A., & Singh, V. (2011). Quantitative evaluation
of BFT protocols (pp. 255–264). Presented at the QEST: Quantitative Evaluation
of Systems, Aachen, Germany: IEEE. https://doi.org/10.1109/QEST.2011.40'
chicago: Halalai, Raluca, Thomas A Henzinger, and Vasu Singh. “Quantitative Evaluation
of BFT Protocols,” 255–64. IEEE, 2011. https://doi.org/10.1109/QEST.2011.40.
ieee: 'R. Halalai, T. A. Henzinger, and V. Singh, “Quantitative evaluation of BFT
protocols,” presented at the QEST: Quantitative Evaluation of Systems, Aachen,
Germany, 2011, pp. 255–264.'
ista: 'Halalai R, Henzinger TA, Singh V. 2011. Quantitative evaluation of BFT protocols.
QEST: Quantitative Evaluation of Systems, 255–264.'
mla: Halalai, Raluca, et al. Quantitative Evaluation of BFT Protocols. IEEE,
2011, pp. 255–64, doi:10.1109/QEST.2011.40.
short: R. Halalai, T.A. Henzinger, V. Singh, in:, IEEE, 2011, pp. 255–264.
conference:
end_date: 2011-09-08
location: Aachen, Germany
name: 'QEST: Quantitative Evaluation of Systems'
start_date: 2011-09-05
corr_author: '1'
date_created: 2018-12-11T12:02:51Z
date_published: 2011-10-13T00:00:00Z
date_updated: 2024-10-09T20:54:27Z
day: '13'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1109/QEST.2011.40
file:
- access_level: open_access
checksum: 4dc8750ab7921f51de992000b13d1b01
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:07:49Z
date_updated: 2020-07-14T12:46:09Z
file_id: '4648'
file_name: IST-2012-84-v1+1_Quantitative_evaluation_of_BFT_protocols.pdf
file_size: 272017
relation: main_file
file_date_updated: 2020-07-14T12:46:09Z
fulldoi: https://doi.org/10.1109/QEST.2011.40
has_accepted_license: '1'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Submitted Version
page: 255 - 264
publication_status: published
publisher: IEEE
publist_id: '3260'
pubrep_id: '84'
quality_controlled: '1'
scopus_import: 1
status: public
title: Quantitative evaluation of BFT protocols
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3357'
abstract:
- lang: eng
text: We consider two-player graph games whose objectives are request-response condition,
i.e conjunctions of conditions of the form "if a state with property Rq is visited,
then later a state with property Rp is visited". The winner of such games can
be decided in EXPTIME and the problem is known to be NP-hard. In this paper, we
close this gap by showing that this problem is, in fact, EXPTIME-complete. We
show that the problem becomes PSPACE-complete if we only consider games played
on DAGs, and NP-complete or PTIME-complete if there is only one player (depending
on whether he wants to enforce or spoil the request-response condition). We also
present near-optimal bounds on the memory needed to design winning strategies
for each player, in each case.
alternative_title:
- LNCS
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: Florian
full_name: Horn, Florian
id: 37327ACE-F248-11E8-B48F-1D18A9856A87
last_name: Horn
citation:
ama: 'Chatterjee K, Henzinger TA, Horn F. The complexity of request-response games.
In: Dediu A-H, Inenaga S, Martín-Vide C, eds. Vol 6638. Springer; 2011:227-237.
doi:10.1007/978-3-642-21254-3_17'
apa: 'Chatterjee, K., Henzinger, T. A., & Horn, F. (2011). The complexity of
request-response games. In A.-H. Dediu, S. Inenaga, & C. Martín-Vide (Eds.)
(Vol. 6638, pp. 227–237). Presented at the LATA: Language and Automata Theory
and Applications, Tarragona, Spain: Springer. https://doi.org/10.1007/978-3-642-21254-3_17'
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Florian Horn. “The Complexity
of Request-Response Games.” edited by Adrian-Horia Dediu, Shunsuke Inenaga, and
Carlos Martín-Vide, 6638:227–37. Springer, 2011. https://doi.org/10.1007/978-3-642-21254-3_17.
ieee: 'K. Chatterjee, T. A. Henzinger, and F. Horn, “The complexity of request-response
games,” presented at the LATA: Language and Automata Theory and Applications,
Tarragona, Spain, 2011, vol. 6638, pp. 227–237.'
ista: 'Chatterjee K, Henzinger TA, Horn F. 2011. The complexity of request-response
games. LATA: Language and Automata Theory and Applications, LNCS, vol. 6638, 227–237.'
mla: Chatterjee, Krishnendu, et al. The Complexity of Request-Response Games.
Edited by Adrian-Horia Dediu et al., vol. 6638, Springer, 2011, pp. 227–37, doi:10.1007/978-3-642-21254-3_17.
short: K. Chatterjee, T.A. Henzinger, F. Horn, in:, A.-H. Dediu, S. Inenaga, C.
Martín-Vide (Eds.), Springer, 2011, pp. 227–237.
conference:
end_date: 2011-05-31
location: Tarragona, Spain
name: 'LATA: Language and Automata Theory and Applications'
start_date: 2011-05-26
corr_author: '1'
date_created: 2018-12-11T12:02:52Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2024-10-09T20:54:27Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-642-21254-3_17
editor:
- first_name: Adrian-Horia
full_name: Dediu, Adrian-Horia
last_name: Dediu
- first_name: Shunsuke
full_name: Inenaga, Shunsuke
last_name: Inenaga
- first_name: Carlos
full_name: Martín-Vide, Carlos
last_name: Martín-Vide
fulldoi: https://doi.org/10.1007/978-3-642-21254-3_17
intvolume: ' 6638'
language:
- iso: eng
month: '01'
oa_version: None
page: 227 - 237
publication_status: published
publisher: Springer
publist_id: '3258'
quality_controlled: '1'
scopus_import: 1
status: public
title: The complexity of request-response games
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
volume: 6638
year: '2011'
...
---
_id: '3358'
abstract:
- lang: eng
text: The static scheduling problem often arises as a fundamental problem in real-time
systems and grid computing. We consider the problem of statically scheduling a
large job expressed as a task graph on a large number of computing nodes, such
as a data center. This paper solves the large-scale static scheduling problem
using abstraction refinement, a technique commonly used in formal verification
to efficiently solve computationally hard problems. A scheduler based on abstraction
refinement first attempts to solve the scheduling problem with abstract representations
of the job and the computing resources. As abstract representations are generally
small, the scheduling can be done reasonably fast. If the obtained schedule does
not meet specified quality conditions (like data center utilization or schedule
makespan) then the scheduler refines the job and data center abstractions and,
again solves the scheduling problem. We develop different schedulers based on
abstraction refinement. We implemented these schedulers and used them to schedule
task graphs from various computing domains on simulated data centers with realistic
topologies. We compared the speed of scheduling and the quality of the produced
schedules with our abstraction refinement schedulers against a baseline scheduler
that does not use any abstraction. We conclude that abstraction refinement techniques
give a significant speed-up compared to traditional static scheduling heuristics,
at a reasonable cost in the quality of the produced schedules. We further used
our static schedulers in an actual system that we deployed on Amazon EC2 and compared
it against the Hadoop dynamic scheduler for large MapReduce jobs. Our experiments
indicate that there is great potential for static scheduling techniques.
article_processing_charge: No
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Vasu
full_name: Singh, Vasu
id: 4DAE2708-F248-11E8-B48F-1D18A9856A87
last_name: Singh
- first_name: Thomas
full_name: Wies, Thomas
id: 447BFB88-F248-11E8-B48F-1D18A9856A87
last_name: Wies
- first_name: Damien
full_name: Zufferey, Damien
id: 4397AC76-F248-11E8-B48F-1D18A9856A87
last_name: Zufferey
orcid: 0000-0002-3197-8736
citation:
ama: 'Henzinger TA, Singh V, Wies T, Zufferey D. Scheduling large jobs by abstraction
refinement. In: ACM; 2011:329-342. doi:10.1145/1966445.1966476'
apa: 'Henzinger, T. A., Singh, V., Wies, T., & Zufferey, D. (2011). Scheduling
large jobs by abstraction refinement (pp. 329–342). Presented at the EuroSys,
Salzburg, Austria: ACM. https://doi.org/10.1145/1966445.1966476'
chicago: Henzinger, Thomas A, Vasu Singh, Thomas Wies, and Damien Zufferey. “Scheduling
Large Jobs by Abstraction Refinement,” 329–42. ACM, 2011. https://doi.org/10.1145/1966445.1966476.
ieee: T. A. Henzinger, V. Singh, T. Wies, and D. Zufferey, “Scheduling large jobs
by abstraction refinement,” presented at the EuroSys, Salzburg, Austria, 2011,
pp. 329–342.
ista: Henzinger TA, Singh V, Wies T, Zufferey D. 2011. Scheduling large jobs by
abstraction refinement. EuroSys, 329–342.
mla: Henzinger, Thomas A., et al. Scheduling Large Jobs by Abstraction Refinement.
ACM, 2011, pp. 329–42, doi:10.1145/1966445.1966476.
short: T.A. Henzinger, V. Singh, T. Wies, D. Zufferey, in:, ACM, 2011, pp. 329–342.
conference:
end_date: 2011-04-13
location: Salzburg, Austria
name: EuroSys
start_date: 2011-04-10
corr_author: '1'
date_created: 2018-12-11T12:02:53Z
date_published: 2011-04-10T00:00:00Z
date_updated: 2026-06-18T18:44:21Z
day: '10'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/1966445.1966476
fulldoi: https://doi.org/10.1145/1966445.1966476
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://cs.nyu.edu/wies/publ/scheduling_large_jobs_by_abstraction_refinement.pdf
month: '04'
oa: 1
oa_version: Published Version
page: 329 - 342
publication_status: published
publisher: ACM
publist_id: '3257'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scheduling large jobs by abstraction refinement
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3359'
abstract:
- lang: eng
text: "Motivated by improvements in constraint-solving technology and by the increase
of routinely available computational power, partial-program synthesis is emerging
as an effective approach for increasing programmer productivity. The goal of the
approach is to allow the programmer to specify a part of her intent imperatively
(that is, give a partial program) and a part of her intent declaratively, by specifying
which conditions need to be achieved or maintained. The task of the synthesizer
is to construct a program that satisfies the specification. As an example, consider
a partial program where threads access shared data without using any synchronization
mechanism, and a declarative specification that excludes data races and deadlocks.
The task of the synthesizer is then to place locks into the program code in order
for the program to meet the specification.\r\n\r\nIn this paper, we argue that
quantitative objectives are needed in partial-program synthesis in order to produce
higher-quality programs, while enabling simpler specifications. Returning to the
example, the synthesizer could construct a naive solution that uses one global
lock for shared data. This can be prevented either by constraining the solution
space further (which is error-prone and partly defeats the point of synthesis),
or by optimizing a quantitative objective that models performance. Other quantitative
notions useful in synthesis include fault tolerance, robustness, resource (memory,
power) consumption, and information flow."
acknowledgement: This work was partially supported by the ERC Advanced Grant QUAREM,
the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- 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: 'Cerny P, Henzinger TA. From boolean to quantitative synthesis. In: ACM; 2011:149-154.
doi:10.1145/2038642.2038666'
apa: 'Cerny, P., & Henzinger, T. A. (2011). From boolean to quantitative synthesis
(pp. 149–154). Presented at the EMSOFT: Embedded Software , Taipei; Taiwan: ACM.
https://doi.org/10.1145/2038642.2038666'
chicago: Cerny, Pavol, and Thomas A Henzinger. “From Boolean to Quantitative Synthesis,”
149–54. ACM, 2011. https://doi.org/10.1145/2038642.2038666.
ieee: 'P. Cerny and T. A. Henzinger, “From boolean to quantitative synthesis,” presented
at the EMSOFT: Embedded Software , Taipei; Taiwan, 2011, pp. 149–154.'
ista: 'Cerny P, Henzinger TA. 2011. From boolean to quantitative synthesis. EMSOFT:
Embedded Software , 149–154.'
mla: Cerny, Pavol, and Thomas A. Henzinger. From Boolean to Quantitative Synthesis.
ACM, 2011, pp. 149–54, doi:10.1145/2038642.2038666.
short: P. Cerny, T.A. Henzinger, in:, ACM, 2011, pp. 149–154.
conference:
end_date: 2011-10-14
location: Taipei; Taiwan
name: 'EMSOFT: Embedded Software '
start_date: 2011-10-09
corr_author: '1'
date_created: 2018-12-11T12:02:53Z
date_published: 2011-10-09T00:00:00Z
date_updated: 2024-10-21T06:03:04Z
day: '09'
department:
- _id: ToHe
doi: 10.1145/2038642.2038666
ec_funded: 1
fulldoi: https://doi.org/10.1145/2038642.2038666
language:
- iso: eng
month: '10'
oa_version: None
page: 149 - 154
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: ACM
publist_id: '3256'
quality_controlled: '1'
scopus_import: '1'
status: public
title: From boolean to quantitative synthesis
type: conference
user_id: 4435EBFC-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3360'
abstract:
- lang: eng
text: 'A discounted-sum automaton (NDA) is a nondeterministic finite automaton with
edge weights, which values a run by the discounted sum of visited edge weights.
More precisely, the weight in the i-th position of the run is divided by lambda^i,
where the discount factor lambda is a fixed rational number greater than 1. Discounted
summation is a common and useful measuring scheme, especially for infinite sequences,
which reflects the assumption that earlier weights are more important than later
weights. Determinizing automata is often essential, for example, in formal verification,
where there are polynomial algorithms for comparing two deterministic NDAs, while
the equivalence problem for NDAs is not known to be decidable. Unfortunately,
however, discounted-sum automata are, in general, not determinizable: it is currently
known that for every rational discount factor 1 < lambda < 2, there is an
NDA with lambda (denoted lambda-NDA) that cannot be determinized. We provide positive
news, showing that every NDA with an integral factor is determinizable. We also
complete the picture by proving that the integers characterize exactly the discount
factors that guarantee determinizability: we show that for every non-integral
rational factor lambda, there is a nondeterminizable lambda-NDA. Finally, we prove
that the class of NDAs with integral discount factors enjoys closure under the
algebraic operations min, max, addition, and subtraction, which is not the case
for general NDAs nor for deterministic NDAs. This shows that for integral discount
factors, the class of NDAs forms an attractive specification formalism in quantitative
formal verification. All our results hold equally for automata over finite words
and for automata over infinite words. '
alternative_title:
- LIPIcs
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
citation:
ama: 'Boker U, Henzinger TA. Determinizing discounted-sum automata. In: Vol 12.
Springer; 2011:82-96. doi:10.4230/LIPIcs.CSL.2011.82'
apa: 'Boker, U., & Henzinger, T. A. (2011). Determinizing discounted-sum automata
(Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway:
Springer. https://doi.org/10.4230/LIPIcs.CSL.2011.82'
chicago: Boker, Udi, and Thomas A Henzinger. “Determinizing Discounted-Sum Automata,”
12:82–96. Springer, 2011. https://doi.org/10.4230/LIPIcs.CSL.2011.82.
ieee: 'U. Boker and T. A. Henzinger, “Determinizing discounted-sum automata,” presented
at the CSL: Computer Science Logic, Bergen, Norway, 2011, vol. 12, pp. 82–96.'
ista: 'Boker U, Henzinger TA. 2011. Determinizing discounted-sum automata. CSL:
Computer Science Logic, LIPIcs, vol. 12, 82–96.'
mla: Boker, Udi, and Thomas A. Henzinger. Determinizing Discounted-Sum Automata.
Vol. 12, Springer, 2011, pp. 82–96, doi:10.4230/LIPIcs.CSL.2011.82.
short: U. Boker, T.A. Henzinger, in:, Springer, 2011, pp. 82–96.
conference:
end_date: 2011-09-15
location: Bergen, Norway
name: 'CSL: Computer Science Logic'
start_date: 2011-09-12
date_created: 2018-12-11T12:02:53Z
date_published: 2011-08-31T00:00:00Z
date_updated: 2021-01-12T07:42:56Z
day: '31'
ddc:
- '004'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CSL.2011.82
ec_funded: 1
file:
- access_level: open_access
checksum: 250603c6be8ccad4fbd4d7b24221f0ee
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:17Z
date_updated: 2020-07-14T12:46:10Z
file_id: '4803'
file_name: IST-2012-82-v1+1_Determinizing_discounted-sum_automata.pdf
file_size: 504270
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
fulldoi: https://doi.org/10.4230/LIPIcs.CSL.2011.82
has_accepted_license: '1'
intvolume: ' 12'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 82 - 96
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: published
publisher: Springer
publist_id: '3255'
pubrep_id: '82'
quality_controlled: '1'
scopus_import: 1
status: public
title: Determinizing discounted-sum automata
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 12
year: '2011'
...
---
_id: '3361'
abstract:
- lang: eng
text: In this paper, we investigate the computational complexity of quantitative
information flow (QIF) problems. Information-theoretic quantitative relaxations
of noninterference (based on Shannon entropy)have been introduced to enable more
fine-grained reasoning about programs in situations where limited information
flow is acceptable. The QIF bounding problem asks whether the information flow
in a given program is bounded by a constant $d$. Our first result is that the
QIF bounding problem is PSPACE-complete. The QIF memoryless synthesis problem
asks whether it is possible to resolve nondeterministic choices in a given partial
program in such a way that in the resulting deterministic program, the quantitative
information flow is bounded by a given constant $d$. Our second result is that
the QIF memoryless synthesis problem is also EXPTIME-complete. The QIF memoryless
synthesis problem generalizes to QIF general synthesis problem which does not
impose the memoryless requirement (that is, by allowing the synthesized program
to have more variables then the original partial program). Our third result is
that the QIF general synthesis problem is EXPTIME-hard.
article_processing_charge: No
author:
- first_name: Pavol
full_name: Cerny, Pavol
id: 4DCBEFFE-F248-11E8-B48F-1D18A9856A87
last_name: Cerny
- 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
citation:
ama: 'Cerny P, Chatterjee K, Henzinger TA. The complexity of quantitative information
flow problems. In: IEEE; 2011:205-217. doi:10.1109/CSF.2011.21'
apa: 'Cerny, P., Chatterjee, K., & Henzinger, T. A. (2011). The complexity of
quantitative information flow problems (pp. 205–217). Presented at the CSF: Computer
Security Foundations, Cernay-la-Ville, France: IEEE. https://doi.org/10.1109/CSF.2011.21'
chicago: Cerny, Pavol, Krishnendu Chatterjee, and Thomas A Henzinger. “The Complexity
of Quantitative Information Flow Problems,” 205–17. IEEE, 2011. https://doi.org/10.1109/CSF.2011.21.
ieee: 'P. Cerny, K. Chatterjee, and T. A. Henzinger, “The complexity of quantitative
information flow problems,” presented at the CSF: Computer Security Foundations,
Cernay-la-Ville, France, 2011, pp. 205–217.'
ista: 'Cerny P, Chatterjee K, Henzinger TA. 2011. The complexity of quantitative
information flow problems. CSF: Computer Security Foundations, 205–217.'
mla: Cerny, Pavol, et al. The Complexity of Quantitative Information Flow Problems.
IEEE, 2011, pp. 205–17, doi:10.1109/CSF.2011.21.
short: P. Cerny, K. Chatterjee, T.A. Henzinger, in:, IEEE, 2011, pp. 205–217.
conference:
end_date: 2011-06-29
location: Cernay-la-Ville, France
name: 'CSF: Computer Security Foundations'
start_date: 2011-06-27
corr_author: '1'
date_created: 2018-12-11T12:02:54Z
date_published: 2011-06-27T00:00:00Z
date_updated: 2025-09-30T09:04:15Z
day: '27'
ddc:
- '000'
- '005'
department:
- _id: ToHe
- _id: KrCh
doi: 10.1109/CSF.2011.21
ec_funded: 1
external_id:
isi:
- '000300766400014'
file:
- access_level: open_access
checksum: 1a25be0c62459fc7640db88af08ff63a
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:10:07Z
date_updated: 2020-07-14T12:46:10Z
file_id: '4792'
file_name: IST-2012-81-v1+1_The_complexity_of_quantitative_information_flow_problems.pdf
file_size: 299069
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
fulldoi: https://doi.org/10.1109/CSF.2011.21
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 205 - 217
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication_status: published
publisher: IEEE
publist_id: '3254'
pubrep_id: '81'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The complexity of quantitative information flow problems
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2011'
...
---
_id: '3362'
abstract:
- lang: eng
text: State-transition systems communicating by shared variables have been the underlying
model of choice for applications of model checking. Such formalisms, however,
have difficulty with modeling process creation or death and communication reconfigurability.
Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling
formalism that supports dynamic reconfiguration and creation/death of processes.
The resulting formalism supports two types of variables, data variables and reference
variables. Reference variables enable changing the connectivity between processes
and referring to instances of processes. We show how this new formalism supports
parallel composition and refinement through trace containment. DRM provide a natural
language for modeling (and ultimately reasoning about) biological systems and
multiple threads communicating through shared variables.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jasmin
full_name: Fisher, Jasmin
last_name: Fisher
- 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: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Nir
full_name: Piterman, Nir
last_name: Piterman
- first_name: Anmol
full_name: Singh, Anmol
last_name: Singh
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. Dynamic
reactive modules. In: Vol 6901. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2011:404-418. doi:10.1007/978-3-642-23217-6_27'
apa: 'Fisher, J., Henzinger, T. A., Nickovic, D., Piterman, N., Singh, A., &
Vardi, M. (2011). Dynamic reactive modules (Vol. 6901, pp. 404–418). Presented
at the CONCUR: Concurrency Theory, Aachen, Germany: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.1007/978-3-642-23217-6_27'
chicago: Fisher, Jasmin, Thomas A Henzinger, Dejan Nickovic, Nir Piterman, Anmol
Singh, and Moshe Vardi. “Dynamic Reactive Modules,” 6901:404–18. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2011. https://doi.org/10.1007/978-3-642-23217-6_27.
ieee: 'J. Fisher, T. A. Henzinger, D. Nickovic, N. Piterman, A. Singh, and M. Vardi,
“Dynamic reactive modules,” presented at the CONCUR: Concurrency Theory, Aachen,
Germany, 2011, vol. 6901, pp. 404–418.'
ista: 'Fisher J, Henzinger TA, Nickovic D, Piterman N, Singh A, Vardi M. 2011. Dynamic
reactive modules. CONCUR: Concurrency Theory, LNCS, vol. 6901, 404–418.'
mla: Fisher, Jasmin, et al. Dynamic Reactive Modules. Vol. 6901, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–18, doi:10.1007/978-3-642-23217-6_27.
short: J. Fisher, T.A. Henzinger, D. Nickovic, N. Piterman, A. Singh, M. Vardi,
in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2011, pp. 404–418.
conference:
end_date: 2011-09-09
location: Aachen, Germany
name: 'CONCUR: Concurrency Theory'
start_date: 2011-09-06
date_created: 2018-12-11T12:02:54Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:42:57Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-642-23217-6_27
ec_funded: 1
file:
- access_level: open_access
checksum: 6bf2453d8e52e979ddb58d17325bad26
content_type: application/pdf
creator: dernst
date_created: 2020-05-19T16:17:48Z
date_updated: 2020-07-14T12:46:10Z
file_id: '7870'
file_name: 2011_CONCUR_Fisher.pdf
file_size: 337125
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
fulldoi: https://doi.org/10.1007/978-3-642-23217-6_27
has_accepted_license: '1'
intvolume: ' 6901'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Submitted Version
page: 404 - 418
project:
- _id: 25EE3708-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '267989'
name: Quantitative Reactive Modeling
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '3253'
quality_controlled: '1'
scopus_import: 1
status: public
title: Dynamic reactive modules
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6901
year: '2011'
...
---
_id: '3363'
abstract:
- lang: eng
text: We consider probabilistic automata on infinite words with acceptance defined
by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider
quantitative and qualitative decision problems. We present extensions and adaptations
of proofs for probabilistic finite automata and present a complete characterization
of the decidability and undecidability frontier of the quantitative and qualitative
decision problems for probabilistic automata on infinite words.
article_number: '1104.0127'
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: Mathieu
full_name: Tracol, Mathieu
id: 3F54FA38-F248-11E8-B48F-1D18A9856A87
last_name: Tracol
citation:
ama: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic
automata on infinite words. doi:10.48550/arXiv.1104.0127
apa: Chatterjee, K., Henzinger, T. A., & Tracol, M. (n.d.). The decidability
frontier for probabilistic automata on infinite words. ArXiv. https://doi.org/10.48550/arXiv.1104.0127
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Mathieu Tracol. “The Decidability
Frontier for Probabilistic Automata on Infinite Words.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1104.0127.
ieee: K. Chatterjee, T. A. Henzinger, and M. Tracol, “The decidability frontier
for probabilistic automata on infinite words.” ArXiv.
ista: Chatterjee K, Henzinger TA, Tracol M. The decidability frontier for probabilistic
automata on infinite words. 1104.0127.
mla: Chatterjee, Krishnendu, et al. The Decidability Frontier for Probabilistic
Automata on Infinite Words. 1104.0127, ArXiv, doi:10.48550/arXiv.1104.0127.
short: K. Chatterjee, T.A. Henzinger, M. Tracol, (n.d.).
corr_author: '1'
date_created: 2018-12-11T12:02:54Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2025-06-26T09:19:59Z
day: '01'
department:
- _id: KrCh
- _id: ToHe
doi: 10.48550/arXiv.1104.0127
ec_funded: 1
external_id:
arxiv:
- '1104.0127'
fulldoi: https://doi.org/10.48550/arXiv.1104.0127
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1104.0127
month: '04'
oa: 1
oa_version: Preprint
page: '19'
project:
- _id: 25EFB36C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '215543'
name: COMponent-Based Embedded Systems design Techniques
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
- _id: 25F1337C-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '214373'
name: Design for Embedded Systems
publication_status: submitted
publisher: ArXiv
publist_id: '3251'
status: public
title: The decidability frontier for probabilistic automata on infinite words
type: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '3364'
abstract:
- lang: eng
text: Molecular noise, which arises from the randomness of the discrete events in
the cell, significantly influences fundamental biological processes. Discrete-state
continuous-time stochastic models (CTMC) can be used to describe such effects,
but the calculation of the probabilities of certain events is computationally
expensive. We present a comparison of two analysis approaches for CTMC. On one
hand, we estimate the probabilities of interest using repeated Gillespie simulation
and determine the statistical accuracy that we obtain. On the other hand, we apply
a numerical reachability analysis that approximates the probability distributions
of the system at several time instances. We use examples of cellular processes
to demonstrate the superiority of the reachability analysis if accurate results
are required.
article_processing_charge: No
author:
- first_name: Frédéric
full_name: Didier, Frédéric
last_name: Didier
- 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: Maria
full_name: Mateescu, Maria
last_name: Mateescu
- first_name: Verena
full_name: Wolf, Verena
last_name: Wolf
citation:
ama: Didier F, Henzinger TA, Mateescu M, Wolf V. Approximation of event probabilities
in noisy cellular processes. Theoretical Computer Science. 2011;412(21):2128-2141.
doi:10.1016/j.tcs.2010.10.022
apa: Didier, F., Henzinger, T. A., Mateescu, M., & Wolf, V. (2011). Approximation
of event probabilities in noisy cellular processes. Theoretical Computer Science.
Elsevier. https://doi.org/10.1016/j.tcs.2010.10.022
chicago: Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf.
“Approximation of Event Probabilities in Noisy Cellular Processes.” Theoretical
Computer Science. Elsevier, 2011. https://doi.org/10.1016/j.tcs.2010.10.022.
ieee: F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Approximation of event
probabilities in noisy cellular processes,” Theoretical Computer Science,
vol. 412, no. 21. Elsevier, pp. 2128–2141, 2011.
ista: Didier F, Henzinger TA, Mateescu M, Wolf V. 2011. Approximation of event probabilities
in noisy cellular processes. Theoretical Computer Science. 412(21), 2128–2141.
mla: Didier, Frédéric, et al. “Approximation of Event Probabilities in Noisy Cellular
Processes.” Theoretical Computer Science, vol. 412, no. 21, Elsevier, 2011,
pp. 2128–41, doi:10.1016/j.tcs.2010.10.022.
short: F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, Theoretical Computer Science
412 (2011) 2128–2141.
date_created: 2018-12-11T12:02:55Z
date_published: 2011-05-06T00:00:00Z
date_updated: 2025-09-30T09:03:30Z
day: '06'
ddc:
- '000'
- '004'
department:
- _id: ToHe
doi: 10.1016/j.tcs.2010.10.022
external_id:
isi:
- '000290078000005'
file:
- access_level: open_access
checksum: e5503e25ce020d753e06b3431e16841e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:11:09Z
date_updated: 2020-07-14T12:46:10Z
file_id: '4862'
file_name: IST-2012-79-v1+1_Approximation_of_event_probabilities_in_noisy_cellular_processes.pdf
file_size: 230503
relation: main_file
file_date_updated: 2020-07-14T12:46:10Z
fulldoi: https://doi.org/10.1016/j.tcs.2010.10.022
has_accepted_license: '1'
intvolume: ' 412'
isi: 1
issue: '21'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Submitted Version
page: 2128 - 2141
publication: Theoretical Computer Science
publication_status: published
publisher: Elsevier
publist_id: '3249'
pubrep_id: '79'
quality_controlled: '1'
related_material:
record:
- id: '4535'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Approximation of event probabilities in noisy cellular processes
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 412
year: '2011'
...