Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Action Refinement In Process Algebras PDF full book. Access full book title Action Refinement In Process Algebras.
| Author | : Luca Aceto |
| Publisher | : Cambridge University Press |
| Total Pages | : 292 |
| Release | : 1992-08-28 |
| Genre | : Computers |
| ISBN | : 9780521431118 |
This book contains some important new developments in the understanding of concurrent processes and as such will be of value to all computer scientists researching into the theory of parallel computation.
| Author | : |
| Publisher | : |
| Total Pages | : |
| Release | : 1991 |
| Genre | : |
| ISBN | : |
We study several process algebras based on CCS and ACP and suitable notions of semantic equivalence for them which differ in their view of the granularity of action occurrences. We start by considering a process algebra which contains explicit constants for termination, deadlock and divergence. We present both a denotational and a behavioural semantics for it and show that they coincide. The behavioural semantics for this language is based on a variation of the notion of bisimulation preorder and takes the view that actions are atomic.We then study behaviourally motivated semantic theories for two process algebras which incorporate operators which allow the refinement of actions by processes. In the presence of action refinement, semantic theories based on the atomicity of actions are, in general, no longer adequate. We show how suitable semantic theories for the languages we consider may be given in terms of variations of bisimulation equivalence which are based on the assumption that actions are not instantaneous. As an application of the theory, we show how action refinement can be used to give a behavioural characterization of a model for concurrent processes based on partial orders, the class of series-parallel pomsets. Finally, we study and axiomatize a behavioural preorder for a simple subset of CCS based on actions which have a pomset structure. This preorder allows us to relate concurrency to nondeterminism without semantically reducing the former to the latter.
| Author | : L Aceto |
| Publisher | : |
| Total Pages | : 60 |
| Release | : 1990 |
| Genre | : Mathematics |
| ISBN | : |
| Author | : J.A. Bergstra |
| Publisher | : Elsevier |
| Total Pages | : 1357 |
| Release | : 2001-03-16 |
| Genre | : Computers |
| ISBN | : 0080533671 |
Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra.This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.
| Author | : Pierpaolo Degano |
| Publisher | : |
| Total Pages | : 48 |
| Release | : 1992 |
| Genre | : Concurrent programming |
| ISBN | : |
Summarizing, the main purpose of the paper is to construct an operational definition for a process algebra with an operation of action refinement, starting from a purely compositional denotational semantics in terms of Event Structures. In this way we provide a 'parallel copy rule', i.e. the concurrent analogous of the classic 'copy rule' for sequential languages."
| Author | : Hejiao Huang |
| Publisher | : World Scientific |
| Total Pages | : 319 |
| Release | : 2012 |
| Genre | : Computers |
| ISBN | : 9814324280 |
Annotation In a component-based approach for system design, one of the difficult problems is how to prove the correctness of the created components. This volume presents a component-based methodology for the creation and verification of design specifications.
| Author | : Holger Hermanns |
| Publisher | : Springer |
| Total Pages | : 225 |
| Release | : 2003-08-02 |
| Genre | : Mathematics |
| ISBN | : 3540456058 |
This volume contains the proceedings of the second joint PAPM-PROBMIV Workshop, held at the University of Copenhagen, Denmark, July 25–26, 2002 as part of the Federated Logic Conference (FLoC 2002). The PAPM-PROBMIV workshop results from the combination of two wo- shops: PAPM (Process Algebras and Performance Modeling) and PROBMIV (Probabilistic Methods in Veri?cation). The aim of the joint workshop is to bring together the researchers working across the whole spectrum of techniques for the modeling, speci?cation, analysis, and veri?cation of probabilistic systems. Probability is widely used in the design and analysis of software and hardware systems, as a means to derive e?cient algorithms (e.g. randomization), as a model for unreliable or unpredictable behavior (as in the study of fault-tolerant systems and computer networks), and as a tool to study performance and - pendability properties. The topics of the workshop include speci?cation, m- els, and semantics of probabilistic systems, analysis and veri?cation techniques, probabilistic methods for the veri?cation of non-probabilistic systems, and tools and case studies. The ?rst PAPM workshop was held in Edinburgh in 1993; the following ones were held in Regensberg (1994), Edinburgh (1995), Turin (1996), Enschede (1997), Nice (1998), Zaragoza (1999), and Geneva (2000). The ?rst PROBMIV workshop was held in Indianapolis, Indiana (1998); the next one took place in Eindhoven (1999). In 2000, PROBMIV was replaced by a Dagstuhl seminar on Probabilistic Methods in Veri?cation.
| Author | : Andy King |
| Publisher | : Springer |
| Total Pages | : 227 |
| Release | : 2008-11-26 |
| Genre | : Computers |
| ISBN | : 3540787690 |
This postproceedings volume of the 17th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2007, examines program termination, program transformation, constraint solving and analysis as well as software engineering.
| Author | : Walter R. Cleaveland |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 596 |
| Release | : 1992-08-12 |
| Genre | : Mathematics |
| ISBN | : 9783540558224 |
This book contains a selection of research papers describing recent advancesin the theory of concurrent systems and their applications. The papers were all presented at the CONCUR '92 conference, which has emerged as the premiere conference on formal aspects of concurrency. The authors include such prominent researchers as R. Milner, A. Pnueli, N. Lynch, and V.R. Pratt. The results represent advances in the mathematical understanding of the behavior of concurrent systems: topics covered include process algebras, models of true concurrency, compositional verification techniques, temporal logic, verification case studies, models of probabilistic and real-time systems, models of systems with dynamic structure, and algorithms and decidability results for system analysis. A key feature of CONCUR is its breadth: in one volume it presents a snapshot of the state of the art in concurrency theory. Assuch, it is indispensible to researchers - and would-be researchers - in theformal analysis of concurrent systems.
| Author | : Andrzej Tarlecki |
| Publisher | : Springer Science & Business Media |
| Total Pages | : 458 |
| Release | : 1991-08-07 |
| Genre | : Computers |
| ISBN | : 9783540543459 |
This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
