scientific article; zbMATH DE number 1951200

MaRDI QIDQ4413690zbMATH OpenFDO

Authors Antje Nowack

Publication date 21 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2589/25890341.htm

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 1670519
• Decidable properties for monadic abstract state machines
• scientific article; zbMATH DE number 2102724
• The computable kernel of abstract state machines
• A guarded fragment for abstract state machines

Cited in

(9)

• Decidable properties for monadic abstract state machines
• A guarded fragment for abstract state machines
• scientific article; zbMATH DE number 1670519 (Why is no real title available?)
• Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity
• scientific article; zbMATH DE number 1487500 (Why is no real title available?)
• scientific article; zbMATH DE number 2102724 (Why is no real title available?)
• Abstract State Machines 2004. Advances in Theory and Practice
• Abstract State Machines 2004. Advances in Theory and Practice
• Verification of well-formed communicating recursive state machines

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413690)