Decidable properties for monadic abstract state machines

DOI10.1016/J.APAL.2005.12.002zbMath1106.03035OpenAlexW2068251508MaRDI QIDQ2498914

Danièle Beauquier

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

zbMATH Keywords

automataspecification of distributed systemsdecidable classes of verificationverification of timing

Mathematics Subject Classification ID

Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

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

This page was built for publication: Decidable properties for monadic abstract state machines