PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Bolognesi T., Boerger E. Abstract State Processes. In: Abstract State Machines 2003 - Advances in Theory and Practice (Taormina, Italy, 3-7 March 2003). Proceedings, pp. 22 - 32. Egon Boerger, Angelo Gargantini, Elvinia Riccobene (Eds.) (eds.). (Lecture Notes in Computer Science, vol. 2589). Springer, 2003.
 
 
Abstract
(English)
Process-algebraic languages offer a rich set of structuring techniques and concurrency patterns which allow one to decompose complex systems into concurrently interacting simpler component processes. They abstract however almost entirely from a notion of system state. The method of Abstract State Machines (ASMs) offers powerful abstraction and refinement techniques for specifying system dynamics based upon a most general notion of structured state. The evolutions of the state are governed however by a fixed and typically unstructured program, called 'rule', which describes a set of abstract updates occurring simultaneously at each step (synchronous parallelism). We propose to incorporate into one machine concept the advantages offered by both structuring techniques, and introduce to this purpose Abstract State Processes (ASPs), i.e. evolving processes (extended ASM programs which are structured and evolve like process-algebraic behaviour expressions) operating on evolving abstract states the way traditional ASM rules do.
Subject Abstract state machines
Process algebra
Integrated Formal Methods
D.1.3 Concurrent Programming
D.2.1 Requirements/Specifications
F.3.2 Semantics of Programming Languages


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional