Tephilla Prince

Orcid: 0000-0002-1045-3033

According to our database1, Tephilla Prince authored at least 9 papers between 2022 and 2026.

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

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Verification of Unbounded Client-Server Systems with Distinguishable Clients.
CoRR, February, 2026

2025
A Lower Bound on Conservative Elementary Object Systems Coverability.
CoRR, April, 2025

Nets-Within-Nets Through the Lens of Data Nets.
Proceedings of the Reachability Problems - 19th International Conference, 2025

2024
Report on WiL 2024.
ACM SIGLOG News, October, 2024

Bounded Verification of Petri Nets and EOSs using Telingo: An Experience Report.
Proceedings of the 39th Italian Conference on Computational Logic, 2024

Deciding Reachability and Coverability in Lossy EOS.
Proceedings of the International Workshop on Petri Nets and Software Engineering 2024 co-located with the 45th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2024), June 24, 2024

2023
On Verifying Unbounded Client-Server Systems.
Proceedings of the Multi-Agent Systems - 20th European Conference, 2023

2022
Bounded Model Checking for Unbounded Client Server Systems.
CoRR, 2022

Formal Verification of Safety Properties Using Interpolation and k-induction.
CoRR, 2022


  Loading...