Infinite State Systems: Verification and Automatic Checking: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:0215:02, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,398 bytes +2,398‎ Created page with "Title: Infinite State Systems: Verification and Automatic Checking Abstract: This research focuses on the automatic verification of infinite state systems, a common feature in software systems that handle data from infinite domains or have unbounded control structures. The study examines various formalisms, including Context Free Processes, Pushdown Automata, Petri Nets, and Process Algebras. It explores decidability results for certain classes of properties about infin..."
Retrieved from "https://simplesci.org/wiki/Infinite_State_Systems:_Verification_and_Automatic_Checking"