Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
From MaRDI portal
Publication:1079373
DOI10.1016/0304-3975(86)90181-7zbMath0597.68049OpenAlexW1986700009MaRDI QIDQ1079373
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90181-7
livenessconcurrent processesextended finite automataevent sequenceseventualitylogical circuitstemporal properties of systems
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
- Hardware Specification with Temporal Logic: An Example
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
This page was built for publication: Specification and verification of decentralized daisy chain arbiters with \(\omega\)-extended regular expressions
