Constructing automata from temporal logic formulas: A tutorial
From MaRDI portal
Recommendations
Cited in
(23)- Tool support for learning Büchi automata and linear temporal logic
- Complexity and succinctness issues for linear-time hybrid logics
- Construction of an automaton from a formula of the monadic first-order theory of natural numbers
- Robust control for signal temporal logic specifications using discrete average space robustness
- Sampling polynomial trajectories for LTL verification
- Linear temporal logic for hybrid dynamical systems: characterizations and sufficient conditions
- Bounded model checking of infinite state systems
- Linear temporal logic vehicle routing with applications to multi-UAV mission planning
- Weighted LTL with discounting
- Hybrid and first-order complete extensions of CaRet
- Two variable vs. linear temporal logic in model checking and games
- Modified ant colony algorithm for constructing finite state machines from execution scenarios and temporal formulas
- Logic programming approach to automata-based decision procedures
- scientific article; zbMATH DE number 139828 (Why is no real title available?)
- On the construction of automata from linear arithmetic constraints
- scientific article; zbMATH DE number 4119651 (Why is no real title available?)
- scientific article; zbMATH DE number 6423748 (Why is no real title available?)
- Compositional failure detection in structured transition systems
- Guaranteed global performance through local coordinations
- Model Checking Quantitative Linear Time Logic
- Implementation and Application of Automata
- Experiments with deterministic -automata for formulas of linear temporal logic
- Specification of communicating processes: temporal logic versus refusals-based refinement
This page was built for publication: Constructing automata from temporal logic formulas: A tutorial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4547769)
