Reduced MDP representation of a logistical planning problem using Petri-nets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3809 LNAI, Issue , 2005, Pages 830-833

  Naguleswaran, Sanjeev ^a   Hickmott, Sarah L ^a   White, Langford B ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION THEORY; DYNAMIC PROGRAMMING; MARKOV PROCESSES; PLANNING; PROBLEM SOLVING;

DYNAMIC PROGRAMMING ALGORITHMS; LOGISTICAL PLANNING; MARKOV DECISION PROCESS (MDP); MARKOV PROPERTIES;

PETRI NETS;

EID: 33745604670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11589990_90     Document Type: Conference Paper

References (7)

1. A. Benveniste, E. Fabre, S. Haar. Markov nets: Probabilistic models for distributed and concurrent systems - extended version. Internal Report, IRISA, http://www.irisa.fr/distribcom/benveniste/ downloaded: November 2004, 2003.
2. T. Murata, D. Zhang. A predicate-transition net model for parallel interpretation of logic programs. IEEE Trans. on Software Engrg., 14:481-497, 1988.
3. J. Esparza, S. Romer, W. Vogler. An improvement of mcmillan's unfolding algorithm. Formal Methods in System Design, 20:285-310, 2002.
4. K. L. McMillan. A technique of a state space search based on unfolding. Formal Methods in System Design, 6:44-65, 1995.
5. V. Khomenko, M. Koutny. Branching processes of high level petri nets. Proc. TACAS 2003, LNCS, 2619, 2002.
6. M. Koutny V. Khomenko, W. Vogler. Towards an efficient algorithm for unfolding petri nets. Proc. CONCUR 2001, LNCS, 2154:366-380, 2001.
7. V. Khomenko K. Heljanko, M. Koutny. Parallelisation of the petri net unfolding algorithm. Proc. TACAS 2002, strony 372-385, 2002.