%0 Conference Paper %1 conf/rp/KojimaN24 %A Kojima, Misaki %A Nishida, Naoki %B RP %D 2024 %E Kovács, Laura %E Sokolova, Ana %I Springer %K dblp %P 54-70 %T On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness. %U http://dblp.uni-trier.de/db/conf/rp/rp2024.html#KojimaN24 %V 15050 %@ 978-3-031-72621-7

@inproceedings{conf/rp/KojimaN24, added-at = {2024-10-03T00:00:00.000+0200}, author = {Kojima, Misaki and Nishida, Naoki}, biburl = {https://www.bibsonomy.org/bibtex/278762d2265cb52f0caa505d0d30f343c/dblp}, booktitle = {RP}, crossref = {conf/rp/2024}, editor = {Kovács, Laura and Sokolova, Ana}, ee = {https://doi.org/10.1007/978-3-031-72621-7_5}, interhash = {78ea6d01d3d3baf21f9fe619e7d2210e}, intrahash = {78762d2265cb52f0caa505d0d30f343c}, isbn = {978-3-031-72621-7}, keywords = {dblp}, pages = {54-70}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-10-07T10:01:56.000+0200}, title = {On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness.}, url = {http://dblp.uni-trier.de/db/conf/rp/rp2024.html#KojimaN24}, volume = 15050, year = 2024 }