Idempotency
Part of Publications of the Newton Institute
- Editor: Jeremy Gunawardena
- Date Published: January 1998
- availability: Available
- format: Hardback
- isbn: 9780521553445
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Certain nonlinear optimization problems arising in such disparate areas as the theory of computation, pure and applied probability and mathematical physics, can be solved by linear methods, provided one replaces the usual number system with one in which addition satisfies the idempotent law. This systematic study of the subject has emerged, triggered in part by a workshop organized by Hewlett-Packard's Basic Research Institute in the Mathematical Sciences (BRIMS), which brought together many leading researchers in the area. This volume is a record of that workshop, but it also includes other invited contributions, a broad Introduction to Idempotency, written specially for the book, and a bibliography of the subject. In sum, the articles cover both practical and more theoretical considerations, making it essential reading for all workers in the area.
Read more- Brings together for the first time contributions from the main research groups in the area
- Theoretical contributions as well as applications to practical problems
- Specially written introduction to both the subject and the individual papers
Reviews & endorsements
'… essential reading for everybody interested in the area.' European Mathematical Society
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: January 1998
- format: Hardback
- isbn: 9780521553445
- length: 456 pages
- dimensions: 235 x 159 x 31 mm
- weight: 0.84kg
- contains: 25 b/w illus.
- availability: Available
Table of Contents
Foreword
Preface
List of participants
1. An introduction to idempotency Jeremy Gunawardena
2. Tropical semirings Jean-Eric Pin
3. Some automata-theoretic aspects of min-max-plus semirings Daniel Krob
4. The finite power property for rational sets of a free group Flavio d'Alessandro and Jacques Sakarovitch
5. The topological approach to the limitedness problem on distance automata Hing Leung
6. Types and dynamics in partially additive categories Gianfranco Mascari and Marco Pedicini
7. Task resource models and (max,+) automata Stéphane Gaubert and Jean Mairesse
8. Algebraic system analysis of timed Petri nets Guy Cohen, Stéphane Gaubert and Jean-Pierre Quadrat
9. Ergodic theorems for stochastic operators and discrete event networks François Baccelli and Jean Mairesse
10. Computational issues in recursive stochastic systems Bruno Gaujal and Alain Jean-Marie
11. Periodic points of nonexpansive maps Roger D. Nussbaum
12. A system-theoretic approach for discrete-event control of manufacturing systems Ayla Gürel, Octavian C. Pastravanu and Frank L. Lewis
13. Idempotent structures in the supervisory control of discrete event systems Darren D. Cofer and Vijay K. Garg
14. Maxpolynomials and discrete-event dynamic systems Raymond A. Cunninghame-Green
15. The Stochastic HJB equation and WKB method Vassili N. Kolokoltsov
16. The Lagrange problem from the point of view of idempotent analysis Serguei Samborskii
17. A new differential equation for the dynamics of the Pareto sets Vassili N. Kolokoltsov and Victor P. Maslov
18. Duality between probability and optimization Marianne Akian, Jean-Pierre Quadrat and Michel Viot
19. Maslov optimization theory: topological aspects Pierre Del Moral
20. Random particle methods in (max,+) optimization problems Pierre Del Moral and Gérard Salut
21. The geometry of finite dimensional pseudomodules Edouard Wagneur
22. A general linear max-plus solution technique Elizabeth A. Walkup and Gaetano Borriello
23. Axiomatics of thermodynamics and idempotent analysis Victor P. Maslov
24. The correspondence principle for idempotent calculus and some computer applications Grigori L. Litvinov and Victor P. Maslov.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×