A simple modal logic approach to decision process

Authors:
Julio Clempner;Jesus Medel
Affiliations:
National Polytechnic Institute, Center for Applied Science and High Technology Research, Center for Computing Research, Mexico City, Mexico;National Polytechnic Institute, Center for Applied Science and High Technology Research, Center for Computing Research, Mexico City, Mexico
Venue:
MACMESE'07 Proceedings of the 9th WSEAS international conference on Mathematical and computational methods in science and engineering
Year:
2007

Citing 6
Cited 1

An automata-theoretic approach to linear temporal logic

Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Model-checking continuous-time Markov chains

ACM Transactions on Computational Logic (TOCL)
Faster and Symbolic CTMC Model Checking

PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the Logical Characterisation of Performability Properties

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximate Symbolic Model Checking of Continuous-Time Markov Chains

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Model Checking Continuous-Time Markov Chains by Transient Analysis

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification

A Lyapunov shortest-path characterization for Markov decision processes

MATH'08 Proceedings of the American Conference on Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce a new modeling paradigm for developing decision process representation associating to any Decision Process Petri net (DPPN) a Kripke structure (KS). The principal characteristics of this model is its ability to represent and analyze the shortest-path properties of a decision process. In this sense, we use a Lypunov-like function as a state-value function for path planning, obtaining as a result new characterizations for final decision points. We show that the dynamics of the DPPN can be captured by a KS and, some dynamic properties of a DPPN can be stated in temporal logics. The temporal logic is constructed according to the Lypunov-like function syntax and semantics. Moreover, we consider some results and discuss possible directions for further research.