Search Results for author:
Found 3 papers, 0 papers with code
Lost in Overlap: Exploring Watermark Collision in LLMs
The proliferation of large language models (LLMs) in generating content raises concerns about text copyright.
Non-Blockingness Verification of Bounded Petri Nets Using Basis Reachability Graphs -- An Extended Version With Benchmarks
In this paper, we study the problem of non-blockingness verification by tapping into the basis reachability graph (BRG).
Verification of Nonblockingness in Bounded Petri Nets With Minimax Basis Reachability Graphs
We construct a structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the reachability set of a net while preserving all information needed to test if the net is blocking.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
