Decidable properties for monadic abstract state machines
From MaRDI portal
Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- scientific article; zbMATH DE number 1670520 (Why is no real title available?)
- scientific article; zbMATH DE number 1951200 (Why is no real title available?)
- scientific article; zbMATH DE number 1538047 (Why is no real title available?)
- scientific article; zbMATH DE number 2102724 (Why is no real title available?)
- scientific article; zbMATH DE number 1390056 (Why is no real title available?)
- A first order logic for specification of timed algorithms: Basic properties and a decidable class
- Abstract State Machines 2004. Advances in Theory and Practice
- Abstract State Machines 2004. Advances in Theory and Practice
- Decidable verification for reducible timed automata specified in a first order logic with time
- Evolving Algebras 1993: Lipari Guide
- Periodicity based decidable classes in a first order timed logic
Cited in
(5)- Abstract State Machines 2004. Advances in Theory and Practice
- scientific article; zbMATH DE number 1670519 (Why is no real title available?)
- Modal functions for concise definition of state machines and products
- scientific article; zbMATH DE number 1951200 (Why is no real title available?)
- On the complexity of verification of time-sensitive distributed systems
This page was built for publication: Decidable properties for monadic abstract state machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498914)