Analysis of recursive state machines
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1543042
- Formal analysis of hierarchical state machines
- State-transition machines, revisited
- Reachability Analysis with State-Compatible Automata
- On the Complexity of Ltl Model-Checking of Recursive State Machines
- Automated analysis of Stateflow models
- On-the-fly reachability and cycle detection for recursive state machines
- Hierarchical and recursive state machines with context-dependent properties
- Timed recursive state machines: expressiveness and complexity
Cited in
(23)- Deterministic finite automata with recursive calls and DPDAs
- Analyzing probabilistic pushdown automata
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- Modular strategies for recursive game graphs
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata
- Faster algorithms for algebraic path properties in recursive state machines with constant treewidth
- Faster algorithms for weighted recursive state machines
- State‐based reconstructability analysis
- Subcubic algorithms for recursive state machines
- Improved model checking of hierarchical systems
- Hierarchical and recursive state machines with context-dependent properties
- scientific article; zbMATH DE number 1543042 (Why is no real title available?)
- REGULAR STATE MACHINES
- Recursive solution of number of reachable states of a simple subclass of FMS
- On the Complexity of Ltl Model-Checking of Recursive State Machines
- On-the-fly reachability and cycle detection for recursive state machines
- Verification, Model Checking, and Abstract Interpretation
- Be lazy and don't care: faster CTL model checking for recursive state machines
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
- A temporal logic for higher-order functional programs
- The recursive arrival problem
- On modelling recursive calls and callbacks with two variants of unified modelling language state diagrams
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
This page was built for publication: Analysis of recursive state machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4551151)