synchronous/korg-paper
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

more

Browse Source
This commit is contained in:
Your Name
2025-03-08 22:17:39 -05:00
parent d5f7fff2a7
commit 679c21f082
10 changed files with 1995 additions and 1994 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sections/appendix-revised.tex
View File

@@ -129,7 +129,7 @@ By the previous argument the $\exists$ASP problem corresponds to \ba language in
\end{proof}
\subsection{Priorities \& On-the-fly B\"uchi Automata Composition}%
\label{sub:Priority \& On-the-fly B\"uchi Automata Composition}
\label{sub:Priority}
As described in Appendix Section \ref{sub:Proofs of Soundness and Completeness}, \spin reduces verification problems to deciding B\"uchi Automata intersection emptiness. That is, given $n$ B\"uchi Automata programs $P_1,\ldots.,P_n$, \spin decides:
\[