Decidable properties for monadic abstract state machines
From MaRDI portal
Publication:2498914
DOI10.1016/j.apal.2005.12.002zbMath1106.03035MaRDI QIDQ2498914
Publication date: 16 August 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2005.12.002
automata; specification of distributed systems; decidable classes of verification; verification of timing
03B70: Logic in computer science
03D05: Automata and formal grammars in connection with logical questions
68Q60: Specification and verification (program logics, model checking, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
03B25: Decidability of theories and sets of sentences
03B44: Temporal logic
Cites Work
- Decidable verification for reducible timed automata specified in a first order logic with time
- Periodicity based decidable classes in a first order timed logic
- Evolving Algebras 1993: Lipari Guide
- Abstract State Machines 2004. Advances in Theory and Practice
- Abstract State Machines 2004. Advances in Theory and Practice
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
