default search action
Chana Weil-Kennedy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy:
A Uniform Framework for Language Inclusion Problems. Taming the Infinities of Concurrency 2024: 155-171 - [c7]Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy:
Verification of Population Protocols with Unordered Data. ICALP 2024: 156:1-156:20 - [i10]Kyveli Doveri, Pierre Ganty, Chana Weil-Kennedy:
A Uniform Framework for Language Inclusion Problems. CoRR abs/2404.09862 (2024) - [i9]Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger, Chana Weil-Kennedy:
Verification of Population Protocols with Unordered Data. CoRR abs/2405.00921 (2024) - [i8]Paul Eichler, Swen Jacobs, Chana Weil-Kennedy:
Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction. CoRR abs/2408.05954 (2024) - 2023
- [b1]Chana Weil-Kennedy:
Observation Petri Nets. Technical University of Munich, Germany, 2023 - 2022
- [c6]A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS 2022: 61-80 - [i7]A. R. Balasubramanian, Lucie Guillou, Chana Weil-Kennedy:
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version). CoRR abs/2201.10432 (2022) - 2021
- [j1]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The complexity of verifying population protocols. Distributed Comput. 34(2): 133-177 (2021) - [c5]A. R. Balasubramanian, Chana Weil-Kennedy:
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF 2021: 18-34 - [i6]A. R. Balasubramanian, Chana Weil-Kennedy:
Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version). CoRR abs/2108.07510 (2021) - 2020
- [c4]Mikhail A. Raskin, Chana Weil-Kennedy, Javier Esparza:
Flatness and Complexity of Immediate Observation Petri Nets. CONCUR 2020: 45:1-45:19 - [c3]Michael Raskin, Chana Weil-Kennedy:
Efficient Restrictions of Immediate Observation Petri Nets. RP 2020: 99-114 - [i5]Mikhail A. Raskin, Chana Weil-Kennedy:
On the Flatness of Immediate Observation Petri Nets. CoRR abs/2001.09966 (2020) - [i4]Michael Raskin, Chana Weil-Kennedy:
Efficient Restrictions of Immediate Observation Petri Nets. CoRR abs/2007.09189 (2020)
2010 – 2019
- 2019
- [c2]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets 2019: 365-385 - [i3]Javier Esparza, Mikhail A. Raskin, Chana Weil-Kennedy:
Parameterized Analysis of Immediate Observation Petri Nets. CoRR abs/1902.03025 (2019) - [i2]Javier Esparza, Stefan Jaax, Mikhail A. Raskin, Chana Weil-Kennedy:
The Complexity of Verifying Population Protocols. CoRR abs/1912.06578 (2019) - 2018
- [c1]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CONCUR 2018: 31:1-31:16 - [i1]Javier Esparza, Pierre Ganty, Rupak Majumdar, Chana Weil-Kennedy:
Verification of Immediate Observation Population Protocols. CoRR abs/1807.06071 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint