Local commutation and its limits: schedule-independence in a controlled-English specification language
Year: 2026
Type: preprint
Abstract: A concurrent system can run its moves in many orders, called schedules; a complete scheduleleaves no move enabled. For ZAL, a controlled-English specification language, we study full-state schedule-independence: all complete schedules from the same start emit the same word (their observations in order) and end in the same entire final state.
Author: Edwards, Dana
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: concurrent systems, final states
Open Access status: green
OpenAlex ID: W7236808964
