Compartir
Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship (Cambridge Tracts in Theoretical Computer Science) (en Inglés)
E. -R Olderog
(Autor)
·
Cambridge University Press
· Tapa Blanda
Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship (Cambridge Tracts in Theoretical Computer Science) (en Inglés) - Olderog, E. -R
$ 69.03
$ 138.05
Ahorras: $ 69.03
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis Listas
Origen: Estados Unidos
(Costos de importación incluídos en el precio)
Se enviará desde nuestra bodega entre el
Lunes 01 de Julio y el
Lunes 15 de Julio.
Lo recibirás en cualquier lugar de Ecuador entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship (Cambridge Tracts in Theoretical Computer Science) (en Inglés)"
The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.