Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata.
Tobe TobenBernd WestphalPublished in: Electron. Notes Theor. Comput. Sci. (2006)
Keyphrases
- partially ordered
- partial order
- totally ordered
- partial ordering
- event calculus
- high level
- desirable properties
- total ordering
- model checking
- finite state
- cellular automata
- decomposition method
- rough sets
- finite automata
- decomposition methods
- high dimensional
- total order
- concurrent systems
- data structure
- reinforcement learning