---
_id: '7232'
abstract:
- lang: eng
text: 'We present Mixed-time Signal Temporal Logic (STL−MX), a specification formalism
which extends STL by capturing the discrete/ continuous time duality found in
many cyber-physical systems (CPS), as well as mixed-signal electronic designs.
In STL−MX, properties of components with continuous dynamics are expressed in
STL, while specifications of components with discrete dynamics are written in
LTL. To combine the two layers, we evaluate formulas on two traces, discrete-
and continuous-time, and introduce two interface operators that map signals, properties
and their satisfaction signals across the two time domains. We show that STL-mx
has the expressive power of STL supplemented with an implicit T-periodic clock
signal. We develop and implement an algorithm for monitoring STL-mx formulas and
illustrate the approach using a mixed-signal example. '
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
citation:
ama: 'Ferrere T, Maler O, Nickovic D. Mixed-time signal temporal logic. In: 17th
International Conference on Formal Modeling and Analysis of Timed Systems.
Vol 11750. Springer Nature; 2019:59-75. doi:10.1007/978-3-030-29662-9_4'
apa: 'Ferrere, T., Maler, O., & Nickovic, D. (2019). Mixed-time signal temporal
logic. In 17th International Conference on Formal Modeling and Analysis of
Timed Systems (Vol. 11750, pp. 59–75). Amsterdam, The Netherlands: Springer
Nature. https://doi.org/10.1007/978-3-030-29662-9_4'
chicago: Ferrere, Thomas, Oded Maler, and Dejan Nickovic. “Mixed-Time Signal Temporal
Logic.” In 17th International Conference on Formal Modeling and Analysis of
Timed Systems, 11750:59–75. Springer Nature, 2019. https://doi.org/10.1007/978-3-030-29662-9_4.
ieee: T. Ferrere, O. Maler, and D. Nickovic, “Mixed-time signal temporal logic,”
in 17th International Conference on Formal Modeling and Analysis of Timed Systems,
Amsterdam, The Netherlands, 2019, vol. 11750, pp. 59–75.
ista: 'Ferrere T, Maler O, Nickovic D. 2019. Mixed-time signal temporal logic. 17th
International Conference on Formal Modeling and Analysis of Timed Systems. FORMATS:
Formal Modeling and Anaysis of Timed Systems, LNCS, vol. 11750, 59–75.'
mla: Ferrere, Thomas, et al. “Mixed-Time Signal Temporal Logic.” 17th International
Conference on Formal Modeling and Analysis of Timed Systems, vol. 11750, Springer
Nature, 2019, pp. 59–75, doi:10.1007/978-3-030-29662-9_4.
short: T. Ferrere, O. Maler, D. Nickovic, in:, 17th International Conference on
Formal Modeling and Analysis of Timed Systems, Springer Nature, 2019, pp. 59–75.
conference:
end_date: 2019-08-29
location: Amsterdam, The Netherlands
name: 'FORMATS: Formal Modeling and Anaysis of Timed Systems'
start_date: 2019-08-27
date_created: 2020-01-05T23:00:48Z
date_published: 2019-08-13T00:00:00Z
date_updated: 2023-09-06T14:57:17Z
day: '13'
department:
- _id: ToHe
doi: 10.1007/978-3-030-29662-9_4
external_id:
isi:
- '000611677700004'
intvolume: ' 11750'
isi: 1
language:
- iso: eng
month: '08'
oa_version: None
page: 59-75
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: The Wittgenstein Prize
publication: 17th International Conference on Formal Modeling and Analysis of Timed
Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- 978-3-0302-9661-2
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mixed-time signal temporal logic
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 11750
year: '2019'
...
---
_id: '6894'
abstract:
- lang: eng
text: "Hybrid automata combine finite automata and dynamical systems, and model
the interaction of digital with physical systems. Formal analysis that can guarantee
the safety of all behaviors or rigorously witness failures, while unsolvable in
general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking,
assisted theorem proving.\r\nNevertheless, very few methods have addressed the
time-unbounded reachability analysis of hybrid automata and, for current sound
and automatic tools, scalability remains critical. We develop methods for the
polyhedral abstraction of hybrid automata, which construct coarse overapproximations
and tightens them incrementally, in a CEGAR fashion. We use template polyhedra,
i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile,
previously, directions were given by the user, we introduce (1) the first method\r\nfor
computing template directions from spurious counterexamples, so as to generalize
and\r\neliminate them. The method applies naturally to convex hybrid automata,
i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives
only, while for linear\r\nODE requires further abstraction. Specifically, we introduce
(2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate
(possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight
sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time
interpolation, which, combining interval arithmetic\r\nand template refinement,
computes appropriate (possibly non-uniform) time partitioning\r\nand template
directions along spurious trajectories, so as to eliminate them.\r\nWe obtain
sound and automatic methods for the reachability analysis over dense\r\nand unbounded
time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build
prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art
tools, on several benchmarks."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Mirco
full_name: Giacobbe, Mirco
id: 3444EA5E-F248-11E8-B48F-1D18A9856A87
last_name: Giacobbe
orcid: 0000-0001-8180-0904
citation:
ama: Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems.
2019. doi:10.15479/AT:ISTA:6894
apa: Giacobbe, M. (2019). Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:6894
chicago: Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems.” Institute of Science and Technology Austria, 2019. https://doi.org/10.15479/AT:ISTA:6894.
ieee: M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,”
Institute of Science and Technology Austria, 2019.
ista: Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid
systems. Institute of Science and Technology Austria.
mla: Giacobbe, Mirco. Automatic Time-Unbounded Reachability Analysis of Hybrid
Systems. Institute of Science and Technology Austria, 2019, doi:10.15479/AT:ISTA:6894.
short: M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems,
Institute of Science and Technology Austria, 2019.
date_created: 2019-09-22T14:08:44Z
date_published: 2019-09-30T00:00:00Z
date_updated: 2023-09-19T09:30:43Z
day: '30'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: ToHe
doi: 10.15479/AT:ISTA:6894
file:
- access_level: open_access
checksum: 773beaf4a85dc2acc2c12b578fbe1965
content_type: application/pdf
creator: mgiacobbe
date_created: 2019-09-27T14:15:05Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6916'
file_name: giacobbe_thesis.pdf
file_size: 4100685
relation: main_file
- access_level: closed
checksum: 97f1c3da71feefd27e6e625d32b4c75b
content_type: application/gzip
creator: mgiacobbe
date_created: 2019-09-27T14:22:04Z
date_updated: 2020-07-14T12:47:43Z
file_id: '6917'
file_name: giacobbe_thesis_src.tar.gz
file_size: 7959732
relation: source_file
file_date_updated: 2020-07-14T12:47:43Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '132'
publication_identifier:
eissn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '631'
relation: part_of_dissertation
status: public
- id: '647'
relation: part_of_dissertation
status: public
- id: '140'
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 time-unbounded reachability analysis of hybrid systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2019'
...
---
_id: '3300'
abstract:
- lang: eng
text: "This book first explores the origins of this idea, grounded in theoretical
work on temporal logic and automata. The editors and authors are among the world's
leading researchers in this domain, and they contributed 32 chapters representing
a thorough view of the development and application of the technique. Topics covered
include binary decision diagrams, symbolic model checking, satisfiability modulo
theories, partial-order reduction, abstraction, interpolation, concurrency, security
protocols, games, probabilistic model checking, and process algebra, and chapters
on the transfer of theory to industrial practice, property specification languages
for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe
book will be valuable for researchers and graduate students engaged with the development
of formal methods and verification tools."
article_processing_charge: No
author:
- first_name: Edmund M.
full_name: Clarke, Edmund M.
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
- first_name: Roderick
full_name: Bloem, Roderick
last_name: Bloem
citation:
ama: 'Clarke EM, Henzinger TA, Veith H, Bloem R. Handbook of Model Checking.
1st ed. Cham: Springer Nature; 2018. doi:10.1007/978-3-319-10575-8'
apa: 'Clarke, E. M., Henzinger, T. A., Veith, H., & Bloem, R. (2018). Handbook
of Model Checking (1st ed.). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-10575-8'
chicago: 'Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem.
Handbook of Model Checking. 1st ed. Cham: Springer Nature, 2018. https://doi.org/10.1007/978-3-319-10575-8.'
ieee: 'E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, Handbook of Model
Checking, 1st ed. Cham: Springer Nature, 2018.'
ista: 'Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking
1st ed., Cham: Springer Nature, XLVIII, 1212p.'
mla: Clarke, Edmund M., et al. Handbook of Model Checking. 1st ed., Springer
Nature, 2018, doi:10.1007/978-3-319-10575-8.
short: E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking,
1st ed., Springer Nature, Cham, 2018.
date_created: 2018-12-11T12:02:32Z
date_published: 2018-06-08T00:00:00Z
date_updated: 2021-12-21T10:49:36Z
day: '08'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8
edition: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: XLVIII, 1212
place: Cham
publication_identifier:
eisbn:
- 978-3-319-10575-8
isbn:
- 978-3-319-10574-1
publication_status: published
publisher: Springer Nature
publist_id: '3340'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Handbook of Model Checking
type: book
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2018'
...
---
_id: '60'
abstract:
- lang: eng
text: Model checking is a computer-assisted method for the analysis of dynamical
systems that can be modeled by state-transition systems. Drawing from research
traditions in mathematical logic, programming languages, hardware design, and
theoretical computer science, model checking is now widely used for the verification
of hardware and software in industry. This chapter is an introduction and short
survey of model checking. The chapter aims to motivate and link the individual
chapters of the handbook, and to provide context for readers who are not familiar
with model checking.
author:
- first_name: Edmund
full_name: Clarke, Edmund
last_name: Clarke
- 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: Helmut
full_name: Veith, Helmut
last_name: Veith
citation:
ama: 'Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger
TA, ed. Handbook of Model Checking. Handbook of Model Checking. Springer;
2018:1-26. doi:10.1007/978-3-319-10575-8_1'
apa: Clarke, E., Henzinger, T. A., & Veith, H. (2018). Introduction to model
checking. In T. A. Henzinger (Ed.), Handbook of Model Checking (pp. 1–26).
Springer. https://doi.org/10.1007/978-3-319-10575-8_1
chicago: Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to
Model Checking.” In Handbook of Model Checking, edited by Thomas A Henzinger,
1–26. Handbook of Model Checking. Springer, 2018. https://doi.org/10.1007/978-3-319-10575-8_1.
ieee: E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,”
in Handbook of Model Checking, T. A. Henzinger, Ed. Springer, 2018, pp.
1–26.
ista: 'Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In:
Handbook of Model Checking. , 1–26.'
mla: Clarke, Edmund, et al. “Introduction to Model Checking.” Handbook of Model
Checking, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:10.1007/978-3-319-10575-8_1.
short: E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook
of Model Checking, Springer, 2018, pp. 1–26.
date_created: 2018-12-11T11:44:25Z
date_published: 2018-05-19T00:00:00Z
date_updated: 2021-01-12T08:05:35Z
day: '19'
department:
- _id: ToHe
doi: 10.1007/978-3-319-10575-8_1
editor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
last_name: Henzinger
language:
- iso: eng
month: '05'
oa_version: None
page: 1 - 26
publication: Handbook of Model Checking
publication_status: published
publisher: Springer
publist_id: '7994'
quality_controlled: '1'
scopus_import: 1
series_title: Handbook of Model Checking
status: public
title: Introduction to model checking
type: book_chapter
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
year: '2018'
...
---
_id: '86'
abstract:
- lang: eng
text: Responsiveness—the requirement that every request to a system be eventually
handled—is one of the fundamental liveness properties of a reactive system. Average
response time is a quantitative measure for the responsiveness requirement used
commonly in performance evaluation. We show how average response time can be computed
on state-transition graphs, on Markov chains, and on game graphs. In all three
cases, we give polynomial-time algorithms.
acknowledgement: 'This research was supported in part by the Austrian Science Fund
(FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein
Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund
(WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland
under grant 2014/15/D/ST6/04543.'
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: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: 'Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh
M, Derler P, Sirjani M, eds. Principles of Modeling. Vol 10760. Springer;
2018:143-161. doi:10.1007/978-3-319-95246-8_9'
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2018). Computing average
response time. In M. Lohstroh, P. Derler, & M. Sirjani (Eds.), Principles
of Modeling (Vol. 10760, pp. 143–161). Springer. https://doi.org/10.1007/978-3-319-95246-8_9
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average
Response Time.” In Principles of Modeling, edited by Marten Lohstroh, Patricia
Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. https://doi.org/10.1007/978-3-319-95246-8_9.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,”
in Principles of Modeling, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani,
Eds. Springer, 2018, pp. 143–161.
ista: 'Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time.
In: Principles of Modeling. LNCS, vol. 10760, 143–161.'
mla: Chatterjee, Krishnendu, et al. “Computing Average Response Time.” Principles
of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018,
pp. 143–61, doi:10.1007/978-3-319-95246-8_9.
short: K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani
(Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.
date_created: 2018-12-11T11:44:33Z
date_published: 2018-07-20T00:00:00Z
date_updated: 2021-01-12T08:20:14Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.1007/978-3-319-95246-8_9
ec_funded: 1
editor:
- first_name: Marten
full_name: Lohstroh, Marten
last_name: Lohstroh
- first_name: Patricia
full_name: Derler, Patricia
last_name: Derler
- first_name: Marjan
full_name: Sirjani, Marjan
last_name: Sirjani
file:
- access_level: open_access
checksum: 9995c6ce6957333baf616fc4f20be597
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:22:18Z
date_updated: 2020-07-14T12:48:14Z
file_id: '7053'
file_name: 2018_PrinciplesModeling_Chatterjee.pdf
file_size: 516307
relation: main_file
file_date_updated: 2020-07-14T12:48:14Z
has_accepted_license: '1'
intvolume: ' 10760'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Submitted Version
page: 143 - 161
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z211
name: The Wittgenstein Prize
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Principles of Modeling
publication_status: published
publisher: Springer
publist_id: '7968'
quality_controlled: '1'
scopus_import: 1
status: public
title: Computing average response time
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 10760
year: '2018'
...
---
_id: '6005'
abstract:
- lang: eng
text: Network games are widely used as a model for selfish resource-allocation problems.
In the classicalmodel, each player selects a path connecting her source and target
vertices. The cost of traversingan edge depends on theload; namely, number of
players that traverse it. Thus, it abstracts the factthat different users may
use a resource at different times and for different durations, which playsan important
role in determining the costs of the users in reality. For example, when transmittingpackets
in a communication network, routing traffic in a road network, or processing a
task in aproduction system, actual sharing and congestion of resources crucially
depends on time.In [13], we introducedtimed network games, which add a time component
to network games.Each vertexvin the network is associated with a cost function,
mapping the load onvto theprice that a player pays for staying invfor one time
unit with this load. Each edge in thenetwork is guarded by the time intervals
in which it can be traversed, which forces the players tospend time in the vertices.
In this work we significantly extend the way time can be referred toin timed network
games. In the model we study, the network is equipped withclocks, and, as intimed
automata, edges are guarded by constraints on the values of the clocks, and their
traversalmay involve a reset of some clocks. We argue that the stronger model
captures many realisticnetworks. The addition of clocks breaks the techniques
we developed in [13] and we developnew techniques in order to show that positive
results on classic network games carry over to thestronger timed setting.
alternative_title:
- LIPIcs
article_number: '23'
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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23'
apa: 'Avni, G., Guha, S., & Kupferman, O. (2018). Timed network games with clocks
(Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science,
Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPICS.MFCS.2018.23'
chicago: Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with
Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. https://doi.org/10.4230/LIPICS.MFCS.2018.23.
ieee: 'G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented
at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom,
2018, vol. 117.'
ista: 'Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS:
Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.'
mla: Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
short: G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2018.
conference:
end_date: 2018-08-31
location: Liverpool, United Kingdom
name: 'MFCS: Mathematical Foundations of Computer Science'
start_date: 2018-08-27
date_created: 2019-02-14T14:12:09Z
date_published: 2018-08-01T00:00:00Z
date_updated: 2023-02-23T14:02:58Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPICS.MFCS.2018.23
file:
- access_level: open_access
checksum: 41ab2ae9b63f5eb49fa995250c0ba128
content_type: application/pdf
creator: dernst
date_created: 2019-02-14T14:22:04Z
date_updated: 2020-07-14T12:47:15Z
file_id: '6007'
file_name: 2018_LIPIcs_Avni.pdf
file_size: 542889
relation: main_file
file_date_updated: 2020-07-14T12:47:15Z
has_accepted_license: '1'
intvolume: ' 117'
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: The Wittgenstein Prize
- _id: 264B3912-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: M02369
name: Formal Methods meets Algorithmic Game Theory
publication_identifier:
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
record:
- id: '963'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Timed network games with clocks
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: 117
year: '2018'
...
---
_id: '133'
abstract:
- lang: eng
text: Synchronous programs are easy to specify because the side effects of an operation
are finished by the time the invocation of the operation returns to the caller.
Asynchronous programs, on the other hand, are difficult to specify because there
are side effects due to pending computation scheduled as a result of the invocation
of an operation. They are also difficult to verify because of the large number
of possible interleavings of concurrent computation threads. We present synchronization,
a new proof rule that simplifies the verification of asynchronous programs by
introducing the fiction, for proof purposes, that asynchronous operations complete
synchronously. Synchronization summarizes an asynchronous computation as immediate
atomic effect. Modular verification is enabled via pending asynchronous calls
in atomic summaries, and a complementary proof rule that eliminates pending asynchronous
calls when components and their specifications are composed. We evaluate synchronization
in the context of a multi-layer refinement verification methodology on a collection
of benchmark programs.
alternative_title:
- LIPIcs
article_number: '21'
author:
- first_name: Bernhard
full_name: Kragl, Bernhard
id: 320FC952-F248-11E8-B48F-1D18A9856A87
last_name: Kragl
orcid: 0000-0001-7745-9117
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- 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: 'Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPIcs.CONCUR.2018.21'
apa: 'Kragl, B., Qadeer, S., & Henzinger, T. A. (2018). Synchronizing the asynchronous
(Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory,
Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2018.21'
chicago: Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the
Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
https://doi.org/10.4230/LIPIcs.CONCUR.2018.21.
ieee: 'B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,”
presented at the CONCUR: International Conference on Concurrency Theory, Beijing,
China, 2018, vol. 118.'
ista: 'Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR:
International Conference on Concurrency Theory, LIPIcs, vol. 118, 21.'
mla: Kragl, Bernhard, et al. Synchronizing the Asynchronous. Vol. 118, 21,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.CONCUR.2018.21.
short: B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2018.
conference:
end_date: 2018-09-07
location: Beijing, China
name: 'CONCUR: International Conference on Concurrency Theory'
start_date: 2018-09-04
date_created: 2018-12-11T11:44:48Z
date_published: 2018-08-13T00:00:00Z
date_updated: 2023-09-07T13:18:00Z
day: '13'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2018.21
file:
- access_level: open_access
checksum: c90895f4c5fafc18ddc54d1c8848077e
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:18:46Z
date_updated: 2020-07-14T12:44:44Z
file_id: '5368'
file_name: IST-2018-853-v2+2_concur2018.pdf
file_size: 745438
relation: main_file
file_date_updated: 2020-07-14T12:44:44Z
has_accepted_license: '1'
intvolume: ' 118'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25F2ACDE-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Rigorous Systems Engineering
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
publication_identifier:
issn:
- '18688969'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '7790'
pubrep_id: '1039'
quality_controlled: '1'
related_material:
record:
- id: '6426'
relation: earlier_version
status: public
- id: '8332'
relation: dissertation_contains
status: public
scopus_import: 1
status: public
title: Synchronizing the asynchronous
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: 118
year: '2018'
...
---
_id: '299'
abstract:
- lang: eng
text: We introduce in this paper AMT 2.0 , a tool for qualitative and quantitative
analysis of hybrid continuous and Boolean signals that combine numerical values
and discrete events. The evaluation of the signals is based on rich temporal specifications
expressed in extended Signal Temporal Logic (xSTL), which integrates Timed Regular
Expressions (TRE) within Signal Temporal Logic (STL). The tool features qualitative
monitoring (property satisfaction checking), trace diagnostics for explaining
and justifying property violations and specification-driven measurement of quantitative
features of the signal.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Olivier
full_name: Lebeltel, Olivier
last_name: Lebeltel
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Dogan
full_name: Ulus, Dogan
last_name: Ulus
citation:
ama: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. AMT 2.0: Qualitative and
quantitative trace analysis with extended signal temporal logic. In: Beyer D,
Huisman M, eds. Vol 10806. Springer; 2018:303-319. doi:10.1007/978-3-319-89963-3_18'
apa: 'Nickovic, D., Lebeltel, O., Maler, O., Ferrere, T., & Ulus, D. (2018).
AMT 2.0: Qualitative and quantitative trace analysis with extended signal temporal
logic. In D. Beyer & M. Huisman (Eds.) (Vol. 10806, pp. 303–319). Presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece: Springer. https://doi.org/10.1007/978-3-319-89963-3_18'
chicago: 'Nickovic, Dejan, Olivier Lebeltel, Oded Maler, Thomas Ferrere, and Dogan
Ulus. “AMT 2.0: Qualitative and Quantitative Trace Analysis with Extended Signal
Temporal Logic.” edited by Dirk Beyer and Marieke Huisman, 10806:303–19. Springer,
2018. https://doi.org/10.1007/978-3-319-89963-3_18.'
ieee: 'D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, and D. Ulus, “AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic,” presented
at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems,
Thessaloniki, Greece, 2018, vol. 10806, pp. 303–319.'
ista: 'Nickovic D, Lebeltel O, Maler O, Ferrere T, Ulus D. 2018. AMT 2.0: Qualitative
and quantitative trace analysis with extended signal temporal logic. TACAS: Tools
and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 10806,
303–319.'
mla: 'Nickovic, Dejan, et al. AMT 2.0: Qualitative and Quantitative Trace Analysis
with Extended Signal Temporal Logic. Edited by Dirk Beyer and Marieke Huisman,
vol. 10806, Springer, 2018, pp. 303–19, doi:10.1007/978-3-319-89963-3_18.'
short: D. Nickovic, O. Lebeltel, O. Maler, T. Ferrere, D. Ulus, in:, D. Beyer, M.
Huisman (Eds.), Springer, 2018, pp. 303–319.
conference:
end_date: 2018-04-20
location: Thessaloniki, Greece
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2018-04-14
date_created: 2018-12-11T11:45:41Z
date_published: 2018-04-14T00:00:00Z
date_updated: 2023-09-08T11:52:02Z
day: '14'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-319-89963-3_18
editor:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Marieke
full_name: Huisman, Marieke
last_name: Huisman
external_id:
isi:
- '00445822600018'
file:
- access_level: open_access
checksum: e11db3b9c8e27a1c7d1c738cc5e4d25a
content_type: application/pdf
creator: dernst
date_created: 2019-02-06T07:33:05Z
date_updated: 2020-07-14T12:45:58Z
file_id: '5928'
file_name: 2018_LNCS_Nickovic.pdf
file_size: 3267209
relation: main_file
file_date_updated: 2020-07-14T12:45:58Z
has_accepted_license: '1'
intvolume: ' 10806'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 303 - 319
publication_status: published
publisher: Springer
publist_id: '7582'
quality_controlled: '1'
related_material:
record:
- id: '10861'
relation: later_version
status: public
scopus_import: '1'
status: public
title: 'AMT 2.0: Qualitative and quantitative trace analysis with extended signal
temporal logic'
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: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 10806
year: '2018'
...
---
_id: '144'
abstract:
- lang: eng
text: The task of a monitor is to watch, at run-time, the execution of a reactive
system, and signal the occurrence of a safety violation in the observed sequence
of events. While finite-state monitors have been studied extensively, in practice,
monitoring software also makes use of unbounded memory. We define a model of automata
equipped with integer-valued registers which can execute only a bounded number
of instructions between consecutive events, and thus can form the theoretical
basis for the study of infinite-state monitors. We classify these register monitors
according to the number k of available registers, and the type of register instructions.
In stark contrast to the theory of computability for register machines, we prove
that for every k 1, monitors with k + 1 counters (with instruction set 〈+1, =〉)
are strictly more expressive than monitors with k counters. We also show that
adder monitors (with instruction set 〈1, +, =〉) are strictly more expressive than
counter monitors, but are complete for monitoring all computable safety -languages
for k = 6. Real-time monitors are further required to signal the occurrence of
a safety violation as soon as it occurs. The expressiveness hierarchy for counter
monitors carries over to real-time monitors. We then show that 2 adders cannot
simulate 3 counters in real-time. Finally, we show that real-time adder monitors
with inequalities are as expressive as real-time Turing machines.
alternative_title:
- ACM/IEEE Symposium on Logic in Computer Science
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- 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: Ege
full_name: Saraç, Ege
last_name: Saraç
citation:
ama: 'Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part
F138033. IEEE; 2018:394-403. doi:10.1145/3209108.3209194'
apa: 'Ferrere, T., Henzinger, T. A., & Saraç, E. (2018). A theory of register
monitors (Vol. Part F138033, pp. 394–403). Presented at the LICS: Logic in Computer
Science, Oxford, UK: IEEE. https://doi.org/10.1145/3209108.3209194'
chicago: Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register
Monitors,” Part F138033:394–403. IEEE, 2018. https://doi.org/10.1145/3209108.3209194.
ieee: 'T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,”
presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part
F138033, pp. 394–403.'
ista: 'Ferrere T, Henzinger TA, Saraç E. 2018. A theory of register monitors. LICS:
Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol.
Part F138033, 394–403.'
mla: Ferrere, Thomas, et al. A Theory of Register Monitors. Vol. Part F138033,
IEEE, 2018, pp. 394–403, doi:10.1145/3209108.3209194.
short: T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.
conference:
end_date: 2018-07-12
location: Oxford, UK
name: 'LICS: Logic in Computer Science'
start_date: 2018-07-09
date_created: 2018-12-11T11:44:52Z
date_published: 2018-07-09T00:00:00Z
date_updated: 2023-09-08T11:49:13Z
day: '09'
department:
- _id: ToHe
doi: 10.1145/3209108.3209194
external_id:
isi:
- '000545262800041'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 394 - 403
publication_status: published
publisher: IEEE
publist_id: '7779'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A theory of register monitors
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: Part F138033
year: '2018'
...
---
_id: '182'
abstract:
- lang: eng
text: We describe a new algorithm for the parametric identification problem for
signal temporal logic (STL), stated as follows. Given a densetime real-valued
signal w and a parameterized temporal logic formula φ, compute the subset of the
parameter space that renders the formula satisfied by the signal. Unlike previous
solutions, which were based on search in the parameter space or quantifier elimination,
our procedure works recursively on φ and computes the evolution over time of the
set of valid parameter assignments. This procedure is similar to that of monitoring
or computing the robustness of φ relative to w. Our implementation and experiments
demonstrate that this approach can work well in practice.
alternative_title:
- HSCC Proceedings
article_processing_charge: No
author:
- first_name: Alexey
full_name: Bakhirkin, Alexey
last_name: Bakhirkin
- first_name: Thomas
full_name: Ferrere, Thomas
id: 40960E6E-F248-11E8-B48F-1D18A9856A87
last_name: Ferrere
orcid: 0000-0001-5199-3143
- first_name: Oded
full_name: Maler, Oded
last_name: Maler
citation:
ama: 'Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL.
In: Proceedings of the 21st International Conference on Hybrid Systems.
ACM; 2018:177-186. doi:10.1145/3178126.3178132'
apa: 'Bakhirkin, A., Ferrere, T., & Maler, O. (2018). Efficient parametric identification
for STL. In Proceedings of the 21st International Conference on Hybrid Systems
(pp. 177–186). Porto, Portugal: ACM. https://doi.org/10.1145/3178126.3178132'
chicago: Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric
Identification for STL.” In Proceedings of the 21st International Conference
on Hybrid Systems, 177–86. ACM, 2018. https://doi.org/10.1145/3178126.3178132.
ieee: A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification
for STL,” in Proceedings of the 21st International Conference on Hybrid Systems,
Porto, Portugal, 2018, pp. 177–186.
ista: 'Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification
for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC:
Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186.'
mla: Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” Proceedings
of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–86,
doi:10.1145/3178126.3178132.
short: A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International
Conference on Hybrid Systems, ACM, 2018, pp. 177–186.
conference:
end_date: 2018-04-13
location: Porto, Portugal
name: 'HSCC: Hybrid Systems: Computation and Control'
start_date: 2018-04-11
date_created: 2018-12-11T11:45:04Z
date_published: 2018-04-11T00:00:00Z
date_updated: 2023-09-11T13:30:51Z
day: '11'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3178126.3178132
external_id:
isi:
- '000474781600020'
file:
- access_level: open_access
checksum: 81eabc96430e84336ea88310ac0a1ad0
content_type: application/pdf
creator: dernst
date_created: 2020-05-14T12:18:29Z
date_updated: 2020-07-14T12:45:17Z
file_id: '7833'
file_name: 2018_HSCC_Bakhirkin.pdf
file_size: 5900421
relation: main_file
file_date_updated: 2020-07-14T12:45:17Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '04'
oa: 1
oa_version: Submitted Version
page: 177 - 186
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication: Proceedings of the 21st International Conference on Hybrid Systems
publication_identifier:
isbn:
- '978-1-4503-5642-8 '
publication_status: published
publisher: ACM
publist_id: '7739'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Efficient parametric identification for STL
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...