Compilation of the ELECTRE reactive language into finite transition systems
From MaRDI portal
Publication:673127
DOI10.1016/0304-3975(94)00136-7zbMath0873.68127OpenAlexW1992729783MaRDI QIDQ673127
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00136-7
Uses Software
Cites Work
- From regular expressions to deterministic automata
- Automates a file
- A calculus of communicating systems
- Fairness and related properties in transition systems - a temporal logic to deal with fairness
- QRT FIFO automata, breadth-first grammars and their relations
- Operational semantics of a kernel of the language ELECTRE
- COSY - a system specification language based on paths and processes
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Notes on finite asynchronous automata
- Logic and programming languages
- Proving Properties of Programs by Structural Induction
- Derivatives of Regular Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Compilation of the ELECTRE reactive language into finite transition systems