Chana Weil-Kennedy

Orcid: 0000-0002-1351-8824

According to our database1, Chana Weil-Kennedy authored at least 15 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Temporal Hyperproperties for Population Protocols.
CoRR, 2024

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction.
CoRR, 2024

Verification of Population Protocols with Unordered Data.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

A Uniform Framework for Language Inclusion Problems.
Proceedings of the Taming the Infinities of Concurrency, 2024

2023
Observation Petri Nets.
PhD thesis, 2023

2022
Parameterized Analysis of Reconfigurable Broadcast Networks (Long Version).
CoRR, 2022

Parameterized Analysis of Reconfigurable Broadcast Networks.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
The complexity of verifying population protocols.
Distributed Comput., 2021

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent (Long Version).
CoRR, 2021

2020
On the Flatness of Immediate Observation Petri Nets.
CoRR, 2020

Efficient Restrictions of Immediate Observation Petri Nets.
Proceedings of the Reachability Problems - 14th International Conference, 2020

Flatness and Complexity of Immediate Observation Petri Nets.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Parameterized Analysis of Immediate Observation Petri Nets.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2019

2018
Verification of Immediate Observation Population Protocols.
Proceedings of the 29th International Conference on Concurrency Theory, 2018


  Loading...