Model checking of unrestricted hierarchical state machines

DOI10.1007/3-540-48224-5_54MaRDI QIDQ4535054zbMATH OpenFDO

Authors Michael Benedikt, Patrice Godefroid, Thomas Reps

Publication date 12 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2076/20760652

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Formal analysis of hierarchical state machines
• Hierarchical and recursive state machines with context-dependent properties
• Mathematical Foundations of Computer Science 2004
• Hierarchical state machines
• Verification of scope-dependent hierarchical state machines

Cited in

(12)

• Deterministic finite automata with recursive calls and DPDAs
• Modular strategies for recursive game graphs
• Nested-unit Petri nets
• Querying probabilistic business processes for sub-flows
• A structural/temporal query language for business processes
• Hierarchical and recursive state machines with context-dependent properties
• scientific article; zbMATH DE number 7440190 (Why is no real title available?)
• Formal analysis of hierarchical state machines
• Mathematical Foundations of Computer Science 2004
• Automated Technology for Verification and Analysis
• On modelling recursive calls and callbacks with two variants of unified modelling language state diagrams
• Verification of scope-dependent hierarchical state machines

Describes a project that uses

Uses Software

• CESAR
• SPIN
• Bebop

This page was built for publication: Model checking of unrestricted hierarchical state machines

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