---
OA_place: repository
OA_type: green
_id: '22294'
abstract:
- lang: eng
  text: 'Modern computer systems store vast amounts of personal data, enabling advances
    in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes
    desired for an ML model to forget part of the data it was trained on. In this
    paper, we introduce a novel unlearning approach based on Forgetting Neural Networks
    (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting
    through multiplicative decay factors. While FNNs had previously been studied as
    a theoretical construct, we provide the first concrete implementation and demonstrate
    their effectiveness for targeted unlearning. We propose several variants with
    per-neuron forgetting factors, including rank-based assignments guided by activation
    levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically
    removes information associated with forget sets while preserving performance on
    retained data. Membership inference attacks confirm the effectiveness of FNN-based
    unlearning in erasing information about the training data from the neural network.
    These results establish FNNs as a promising foundation for efficient and interpretable
    unlearning. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Amartya
  full_name: Hatua, Amartya
  last_name: Hatua
- first_name: Trung
  full_name: Nguyen, Trung
  last_name: Nguyen
- first_name: Filip
  full_name: Cano Cordoba, Filip
  id: 708cad98-e86a-11ef-8098-bdae2d7c6af1
  last_name: Cano Cordoba
  orcid: 0000-0002-0783-904X
- first_name: Andrew
  full_name: Sung, Andrew
  last_name: Sung
citation:
  ama: 'Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting
    neural networks. In: <i>Proceedings of the 18th International Conference on Agents
    and Artificial Intelligence</i>. Vol 2. SciTePress; 2026:1536-1546. doi:<a href="https://doi.org/10.5220/0014326500004052">10.5220/0014326500004052</a>'
  apa: 'Hatua, A., Nguyen, T., Cano Cordoba, F., &#38; Sung, A. (2026). Machine unlearning
    using forgetting neural networks. In <i>Proceedings of the 18th International
    Conference on Agents and Artificial Intelligence</i> (Vol. 2, pp. 1536–1546).
    Marbella, Spain: SciTePress. <a href="https://doi.org/10.5220/0014326500004052">https://doi.org/10.5220/0014326500004052</a>'
  chicago: Hatua, Amartya, Trung Nguyen, Filip Cano Cordoba, and Andrew Sung. “Machine
    Unlearning Using Forgetting Neural Networks.” In <i>Proceedings of the 18th International
    Conference on Agents and Artificial Intelligence</i>, 2:1536–46. SciTePress, 2026.
    <a href="https://doi.org/10.5220/0014326500004052">https://doi.org/10.5220/0014326500004052</a>.
  ieee: A. Hatua, T. Nguyen, F. Cano Cordoba, and A. Sung, “Machine unlearning using
    forgetting neural networks,” in <i>Proceedings of the 18th International Conference
    on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol. 2, pp.
    1536–1546.
  ista: 'Hatua A, Nguyen T, Cano Cordoba F, Sung A. 2026. Machine unlearning using
    forgetting neural networks. Proceedings of the 18th International Conference on
    Agents and Artificial Intelligence. ICAART: International Conference on Agents
    and Artificial Intelligence vol. 2, 1536–1546.'
  mla: Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.”
    <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>,
    vol. 2, SciTePress, 2026, pp. 1536–46, doi:<a href="https://doi.org/10.5220/0014326500004052">10.5220/0014326500004052</a>.
  short: A. Hatua, T. Nguyen, F. Cano Cordoba, A. Sung, in:, Proceedings of the 18th
    International Conference on Agents and Artificial Intelligence, SciTePress, 2026,
    pp. 1536–1546.
conference:
  end_date: 2026-03-08
  location: Marbella, Spain
  name: 'ICAART: International Conference on Agents and Artificial Intelligence'
  start_date: 2026-03-05
das_tickbox: '1'
date_created: 2026-07-13T09:46:46Z
date_published: 2026-06-30T00:00:00Z
date_updated: 2026-07-16T09:02:53Z
day: '30'
department:
- _id: ToHe
doi: 10.5220/0014326500004052
external_id:
  arxiv:
  - '2410.22374'
fulldoi: https://doi.org/10.5220/0014326500004052
intvolume: '         2'
keyword:
- Machine Unlearning
- Neuroscience-Inspired Machine Learning
- Membership Inference Attacks
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2410.22374
month: '06'
oa: 1
oa_version: Preprint
page: 1536-1546
publication: Proceedings of the 18th International Conference on Agents and Artificial
  Intelligence
publication_identifier:
  eissn:
  - 2184-433X
  isbn:
  - '9789897587962'
publication_status: published
publisher: SciTePress
quality_controlled: '1'
scopus_import: '1'
status: public
title: Machine unlearning using forgetting neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22104'
abstract:
- lang: eng
  text: ' Modern computer systems store vast amounts of personal data, enabling advances
    in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes
    desired for an ML model to forget part of the data it was trained on. In this
    paper, we introduce a novel unlearning approach based on Forgetting Neural Networks
    (FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting
    through multiplicative decay factors. While FNNs had previously been studied as
    a theoretical construct, we provide the first concrete implementation and demonstrate
    their effectiveness for targeted unlearning. We propose several variants with
    per-neuron forgetting factors, including rank-based assignments guided by activation
    levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically
    removes information associated with forget sets while preserving performance on
    retained data. Membership inference attacks confirm the effectiveness of FNN-based
    unlearning in erasing information about the training data from the neural network.
    These results establish FNNs as a promising foundation for efficient and interpretable
    unlearning.'
acknowledgement: "This work has been supported by the European Research\r\nCouncil
  under Grant No.: ERC-2020-AdG\r\n101020093. We thank Brian Subirana for the original\r\nideation
  of the concept of forgetting neural networks\r\nand his belief in their potential."
article_processing_charge: No
arxiv: 1
author:
- first_name: Amartya
  full_name: Hatua, Amartya
  last_name: Hatua
- first_name: Trung T.
  full_name: Nguyen, Trung T.
  last_name: Nguyen
- first_name: Filip
  full_name: Cano Cordoba, Filip
  id: 708cad98-e86a-11ef-8098-bdae2d7c6af1
  last_name: Cano Cordoba
  orcid: 0000-0002-0783-904X
- first_name: Andrew H.
  full_name: Sung, Andrew H.
  last_name: Sung
citation:
  ama: 'Hatua A, Nguyen TT, Cano Cordoba F, Sung AH. Machine unlearning using forgetting
    neural networks. In: <i>Proceedings of the 18th International Conference on Agents
    and Artificial Intelligence</i>. Vol 2. Science and Technology Publications; 2026:1536-1546.
    doi:<a href="https://doi.org/10.5220/0014326500004052">10.5220/0014326500004052</a>'
  apa: 'Hatua, A., Nguyen, T. T., Cano Cordoba, F., &#38; Sung, A. H. (2026). Machine
    unlearning using forgetting neural networks. In <i>Proceedings of the 18th International
    Conference on Agents and Artificial Intelligence</i> (Vol. 2, pp. 1536–1546).
    Marbella, Spain: Science and Technology Publications. <a href="https://doi.org/10.5220/0014326500004052">https://doi.org/10.5220/0014326500004052</a>'
  chicago: Hatua, Amartya, Trung T. Nguyen, Filip Cano Cordoba, and Andrew H. Sung.
    “Machine Unlearning Using Forgetting Neural Networks.” In <i>Proceedings of the
    18th International Conference on Agents and Artificial Intelligence</i>, 2:1536–46.
    Science and Technology Publications, 2026. <a href="https://doi.org/10.5220/0014326500004052">https://doi.org/10.5220/0014326500004052</a>.
  ieee: A. Hatua, T. T. Nguyen, F. Cano Cordoba, and A. H. Sung, “Machine unlearning
    using forgetting neural networks,” in <i>Proceedings of the 18th International
    Conference on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol.
    2, pp. 1536–1546.
  ista: 'Hatua A, Nguyen TT, Cano Cordoba F, Sung AH. 2026. Machine unlearning using
    forgetting neural networks. Proceedings of the 18th International Conference on
    Agents and Artificial Intelligence. ICAART: International Conference on Agents
    and Artificial Intelligence vol. 2, 1536–1546.'
  mla: Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.”
    <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>,
    vol. 2, Science and Technology Publications, 2026, pp. 1536–46, doi:<a href="https://doi.org/10.5220/0014326500004052">10.5220/0014326500004052</a>.
  short: A. Hatua, T.T. Nguyen, F. Cano Cordoba, A.H. Sung, in:, Proceedings of the
    18th International Conference on Agents and Artificial Intelligence, Science and
    Technology Publications, 2026, pp. 1536–1546.
conference:
  end_date: 2026-03-08
  location: Marbella, Spain
  name: 'ICAART: International Conference on Agents and Artificial Intelligence'
  start_date: 2026-03-05
das_tickbox: '0'
date_created: 2026-06-21T22:03:01Z
date_published: 2026-04-01T00:00:00Z
date_updated: 2026-10-20T14:05:02Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.5220/0014326500004052
ec_funded: 1
external_id:
  arxiv:
  - '2410.22374'
file:
- access_level: open_access
  checksum: d0f5212846c8f3129509b081648465cb
  content_type: application/pdf
  creator: dernst
  date_created: 2026-10-20T14:00:27Z
  date_updated: 2026-10-20T14:00:27Z
  file_id: '23178'
  file_name: 2026_CAART_Hatua.pdf
  file_size: 779692
  relation: main_file
  success: 1
file_date_updated: 2026-10-20T14:00:27Z
fulldoi: https://doi.org/10.5220/0014326500004052
has_accepted_license: '1'
intvolume: '         2'
keyword:
- Machine Unlearning
- Neuroscience-Inspired Machine Learning
- Membership Inference Attacks
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '04'
oa: 1
oa_version: Published Version
page: 1536-1546
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
  call_identifier: H2020
  grant_number: '101020093'
  name: Vigilant Algorithmic Monitoring of Software
publication: Proceedings of the 18th International Conference on Agents and Artificial
  Intelligence
publication_identifier:
  eissn:
  - 2184-433X
  isbn:
  - '9789897587962'
  issn:
  - 2184-3589
publication_status: published
publisher: Science and Technology Publications
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Machine unlearning using forgetting neural networks
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: 2
year: '2026'
...
---
_id: '9200'
abstract:
- lang: eng
  text: Formal design of embedded and cyber-physical systems relies on mathematical
    modeling. In this paper, we consider the model class of hybrid automata whose
    dynamics are defined by affine differential equations. Given a set of time-series
    data, we present an algorithmic approach to synthesize a hybrid automaton exhibiting
    behavior that is close to the data, up to a specified precision, and changes in
    synchrony with the data. A fundamental problem in our synthesis algorithm is to
    check membership of a time series in a hybrid automaton. Our solution integrates
    reachability and optimization techniques for affine dynamical systems to obtain
    both a sufficient and a necessary condition for membership, combined in a refinement
    framework. The algorithm processes one time series at a time and hence can be
    interrupted, provide an intermediate result, and be resumed. We report experimental
    results demonstrating the applicability of our synthesis approach.
acknowledgement: This research was supported in part by the Austrian Science Fund
  (FWF) under grant Z211-N23 (Wittgenstein Award) and the European Union’s Horizon
  2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement
  No. 754411.
article_processing_charge: No
arxiv: 1
author:
- first_name: Miriam
  full_name: Garcia Soto, Miriam
  id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
  last_name: Garcia Soto
  orcid: 0000-0003-2936-5719
- 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: Christian
  full_name: Schilling, Christian
  id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
  last_name: Schilling
  orcid: 0000-0003-3658-1065
citation:
  ama: 'Garcia Soto M, Henzinger TA, Schilling C. Synthesis of hybrid automata with
    affine dynamics from time-series data. In: <i>HSCC ’21: Proceedings of the 24th
    International Conference on Hybrid Systems: Computation and Control</i>. Association
    for Computing Machinery; 2021:2102.12734. doi:<a href="https://doi.org/10.1145/3447928.3456704">10.1145/3447928.3456704</a>'
  apa: 'Garcia Soto, M., Henzinger, T. A., &#38; Schilling, C. (2021). Synthesis of
    hybrid automata with affine dynamics from time-series data. In <i>HSCC ’21: Proceedings
    of the 24th International Conference on Hybrid Systems: Computation and Control</i>
    (p. 2102.12734). Nashville, TN, United States: Association for Computing Machinery.
    <a href="https://doi.org/10.1145/3447928.3456704">https://doi.org/10.1145/3447928.3456704</a>'
  chicago: 'Garcia Soto, Miriam, Thomas A Henzinger, and Christian Schilling. “Synthesis
    of Hybrid Automata with Affine Dynamics from Time-Series Data.” In <i>HSCC ’21:
    Proceedings of the 24th International Conference on Hybrid Systems: Computation
    and Control</i>, 2102.12734. Association for Computing Machinery, 2021. <a href="https://doi.org/10.1145/3447928.3456704">https://doi.org/10.1145/3447928.3456704</a>.'
  ieee: 'M. Garcia Soto, T. A. Henzinger, and C. Schilling, “Synthesis of hybrid automata
    with affine dynamics from time-series data,” in <i>HSCC ’21: Proceedings of the
    24th International Conference on Hybrid Systems: Computation and Control</i>,
    Nashville, TN, United States, 2021, p. 2102.12734.'
  ista: 'Garcia Soto M, Henzinger TA, Schilling C. 2021. Synthesis of hybrid automata
    with affine dynamics from time-series data. HSCC ’21: Proceedings of the 24th
    International Conference on Hybrid Systems: Computation and Control. HSCC: Hybrid
    Systems - Computation and Control, 2102.12734.'
  mla: 'Garcia Soto, Miriam, et al. “Synthesis of Hybrid Automata with Affine Dynamics
    from Time-Series Data.” <i>HSCC ’21: Proceedings of the 24th International Conference
    on Hybrid Systems: Computation and Control</i>, Association for Computing Machinery,
    2021, p. 2102.12734, doi:<a href="https://doi.org/10.1145/3447928.3456704">10.1145/3447928.3456704</a>.'
  short: 'M. Garcia Soto, T.A. Henzinger, C. Schilling, in:, HSCC ’21: Proceedings
    of the 24th International Conference on Hybrid Systems: Computation and Control,
    Association for Computing Machinery, 2021, p. 2102.12734.'
conference:
  end_date: 2021-05-21
  location: Nashville, TN, United States
  name: 'HSCC: Hybrid Systems - Computation and Control'
  start_date: 2021-05-19
corr_author: '1'
date_created: 2021-02-26T16:30:39Z
date_published: 2021-05-01T00:00:00Z
date_updated: 2025-07-10T12:01:40Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1145/3447928.3456704
ec_funded: 1
external_id:
  arxiv:
  - '2102.12734'
  isi:
  - '000932821700028'
file:
- access_level: open_access
  checksum: 4c1202c1abf71384c3ee6fea88c2f80e
  content_type: application/pdf
  creator: kschuh
  date_created: 2021-05-25T13:53:22Z
  date_updated: 2021-05-25T13:53:22Z
  file_id: '9424'
  file_name: 2021_HSCC_Soto.pdf
  file_size: 1474786
  relation: main_file
  success: 1
file_date_updated: 2021-05-25T13:53:22Z
fulldoi: https://doi.org/10.1145/3447928.3456704
has_accepted_license: '1'
isi: 1
keyword:
- hybrid automaton
- membership
- system identification
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: '2102.12734'
project:
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
publication: 'HSCC ''21: Proceedings of the 24th International Conference on Hybrid
  Systems: Computation and Control'
publication_identifier:
  isbn:
  - '9781450383394'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Synthesis of hybrid automata with affine dynamics from time-series data
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
year: '2021'
...
---
_id: '6493'
abstract:
- lang: eng
  text: We present two algorithmic approaches for synthesizing linear hybrid automata
    from experimental data. Unlike previous approaches, our algorithms work without
    a template and generate an automaton with nondeterministic guards and invariants,
    and with an arbitrary number and topology of modes. They thus construct a succinct
    model from the data and provide formal guarantees. In particular, (1) the generated
    automaton can reproduce the data up to a specified tolerance and (2) the automaton
    is tight, given the first guarantee. Our first approach encodes the synthesis
    problem as a logical formula in the theory of linear arithmetic, which can then
    be solved by an SMT solver. This approach minimizes the number of modes in the
    resulting model but is only feasible for limited data sets. To address scalability,
    we propose a second approach that does not enforce to find a minimal model. The
    algorithm constructs an initial automaton and then iteratively extends the automaton
    based on processing new data. Therefore the algorithm is well-suited for online
    and synthesis-in-the-loop applications. The core of the algorithm is a membership
    query that checks whether, within the specified tolerance, a given data set can
    result from the execution of a given automaton. We solve this membership problem
    for linear hybrid automata by repeated reachability computations. We demonstrate
    the effectiveness of the algorithm on synthetic data sets and on cardiac-cell
    measurements.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Miriam
  full_name: Garcia Soto, Miriam
  id: 4B3207F6-F248-11E8-B48F-1D18A9856A87
  last_name: Garcia Soto
  orcid: 0000−0003−2936−5719
- 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: Christian
  full_name: Schilling, Christian
  id: 3A2F4DCE-F248-11E8-B48F-1D18A9856A87
  last_name: Schilling
  orcid: 0000-0003-3658-1065
- first_name: Luka
  full_name: Zeleznik, Luka
  id: 3ADCA2E4-F248-11E8-B48F-1D18A9856A87
  last_name: Zeleznik
citation:
  ama: 'Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. Membership-based synthesis
    of linear hybrid automata. In: <i>31st International Conference on Computer-Aided
    Verification</i>. Vol 11561. Springer; 2019:297-314. doi:<a href="https://doi.org/10.1007/978-3-030-25540-4_16">10.1007/978-3-030-25540-4_16</a>'
  apa: 'Garcia Soto, M., Henzinger, T. A., Schilling, C., &#38; Zeleznik, L. (2019).
    Membership-based synthesis of linear hybrid automata. In <i>31st International
    Conference on Computer-Aided Verification</i> (Vol. 11561, pp. 297–314). New York
    City, NY, USA: Springer. <a href="https://doi.org/10.1007/978-3-030-25540-4_16">https://doi.org/10.1007/978-3-030-25540-4_16</a>'
  chicago: Garcia Soto, Miriam, Thomas A Henzinger, Christian Schilling, and Luka
    Zeleznik. “Membership-Based Synthesis of Linear Hybrid Automata.” In <i>31st International
    Conference on Computer-Aided Verification</i>, 11561:297–314. Springer, 2019.
    <a href="https://doi.org/10.1007/978-3-030-25540-4_16">https://doi.org/10.1007/978-3-030-25540-4_16</a>.
  ieee: M. Garcia Soto, T. A. Henzinger, C. Schilling, and L. Zeleznik, “Membership-based
    synthesis of linear hybrid automata,” in <i>31st International Conference on Computer-Aided
    Verification</i>, New York City, NY, USA, 2019, vol. 11561, pp. 297–314.
  ista: 'Garcia Soto M, Henzinger TA, Schilling C, Zeleznik L. 2019. Membership-based
    synthesis of linear hybrid automata. 31st International Conference on Computer-Aided
    Verification. CAV: Computer-Aided Verification, LNCS, vol. 11561, 297–314.'
  mla: Garcia Soto, Miriam, et al. “Membership-Based Synthesis of Linear Hybrid Automata.”
    <i>31st International Conference on Computer-Aided Verification</i>, vol. 11561,
    Springer, 2019, pp. 297–314, doi:<a href="https://doi.org/10.1007/978-3-030-25540-4_16">10.1007/978-3-030-25540-4_16</a>.
  short: M. Garcia Soto, T.A. Henzinger, C. Schilling, L. Zeleznik, in:, 31st International
    Conference on Computer-Aided Verification, Springer, 2019, pp. 297–314.
conference:
  end_date: 2019-07-18
  location: New York City, NY, USA
  name: 'CAV: Computer-Aided Verification'
  start_date: 2019-07-15
corr_author: '1'
date_created: 2019-05-27T07:09:53Z
date_published: 2019-07-12T00:00:00Z
date_updated: 2025-04-15T06:26:13Z
day: '12'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-030-25540-4_16
ec_funded: 1
external_id:
  isi:
  - '000491468000016'
file:
- access_level: open_access
  checksum: 1f1d61b83a151031745ef70a501da3d6
  content_type: application/pdf
  creator: dernst
  date_created: 2019-08-14T11:05:30Z
  date_updated: 2020-07-14T12:47:32Z
  file_id: '6817'
  file_name: 2019_CAV_GarciaSoto.pdf
  file_size: 674795
  relation: main_file
file_date_updated: 2020-07-14T12:47:32Z
fulldoi: https://doi.org/10.1007/978-3-030-25540-4_16
has_accepted_license: '1'
intvolume: '     11561'
isi: 1
keyword:
- Synthesis
- Linear hybrid automaton
- Membership
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 297-314
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
  call_identifier: H2020
  grant_number: '754411'
  name: ISTplus - Postdoctoral Fellowships
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: S 11407_N23
  name: Rigorous Systems Engineering
- _id: 25F42A32-B435-11E9-9278-68D0E5697425
  call_identifier: FWF
  grant_number: Z211
  name: Formal methods for the design and analysis of complex systems
publication: 31st International Conference on Computer-Aided Verification
publication_identifier:
  isbn:
  - '9783030255398'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer
quality_controlled: '1'
scopus_import: '1'
status: public
title: Membership-based synthesis of linear hybrid automata
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: 4359f0d1-fa6c-11eb-b949-802e58b17ae8
volume: 11561
year: '2019'
...
