Diversity-based inference of finite automata
Journal of the ACM (JACM)
Model checking
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Communication and Concurrency
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata and Computability
Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
The Duality of TIme and Information
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Reinforcement learning with selective perception and hidden state
Reinforcement learning with selective perception and hidden state
Learning and discovery of predictive state representations in dynamical systems with reset
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Predictive state representations: a new theory for modeling dynamical systems
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Representing systems with hidden state
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Planning and acting in partially observable stochastic domains
Artificial Intelligence
Reinforcement learning with perceptual aliasing: the perceptual distinctions approach
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Duality for logics of transition systems
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Testing semantics: connecting processes and process logics
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Expository paper: Foundations of system theory: Decomposable systems
Automatica (Journal of IFAC)
Brzozowski's algorithm (co)algebraically
Logic and Program Semantics
Duality in Logic and Computation
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
In this paper we consider the problem of representing and reasoning about systems, especially probabilistic systems, with hidden state. We consider transition systems where the state is not completely visible to an outside observer. Instead, there are observables that partly identify the state. We show that one can interchange the notions of state and observation and obtain what we call a dual system. In the case of deterministic systems, the double dual gives a minimal representation of the behaviour of the original system. We extend these ideas to probabilistic transition systems and to partially observable Markov decision processes (POMDPs).