K. V. S. Prasad Doctor of Philosophy University of Edinburgh December 1987 A...  Home/Search
Context Related
| cs.chalmers.se/pub/csre...thesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....cs.chalmers.se (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: During recent years, calculi for reasoning about concurrent systems have been developed; examples are CCS (Calculus of Communicating Systems), CSP (Communicating Sequential Processes) and ACP (Algebra of Communicating Processes). Their theory has been studied intensively; rather less has been done in applying these calculi to problems of significant size. The reported work in this direction suggests that we should be prepared to develop new formal systems and notation for the problems we... (Update)
Context of citations to this paper: More
.... in the presence of F aults [12, 13, 7] this reduction is most common without introducing the transformation T explicitly [5, 4, 10, 18, 14, 15, 17, 11, 3, 19]. Although attractive for many reasons, e.g. reuse of a variety of tools and techniques already available for proving...
...lines, we can prove Joachim Parrow s original result for a data link with a faulty medium. 6 A restartable system In his Ph.D. thesis [14], K.V.S. Prasad considers a restartable system consisting of an essential system Q here for simplicity the 1 place buffer a demon D...
Cited by: More
On Bisimulation, Fault-Monotonicity and . . . - Janowski (1997) (Correct)
A Calculus of Broadcasting Systems - Prasad (1995) (Correct)
Fault-Tolerant Bisimulation and Process Transformations - Janowski (1994) (Correct)
Active bibliography (related documents): More All
6.1: Combinators and Bisimulation Proofs for Restartable Systems - Prasad (1991) (Correct)
0.3: On the Non-Derivability of Operators in CCS - Prasad Dept (1989) (Correct)
0.3: State Restoration In Distributed Systems - Philip Merlin Department (1978) (Correct)
Similar documents based on text: More All
0.1: Taxonomic notes on Stylophoronychus (Acari: Tetranychidae).. - Zhang, Zhang, Lin (2000) (Correct)
0.1: Logistic Regression Model with Surrogate Covariate - Thach Prasad (Correct)
0.1: An Improved Generalization of Mesh-Connected Computers.. - Pan, Zheng, Li, Shen (2001) (Correct)
Related documents from co-citation: More All
3: Design and verification of fault tolerant systems with CSP (context) - Peleska - 1990
3: Department of Computer Science (context) - Prasad, time - 1993
3: Concurrency and Automata on Infinite Sequences (context) - Park - 1981
BibTeX entry: (Update)
K.V.S. Prasad, Combinators and Bisimulation Proofs for Restartable Systems, PhD Thesis University of Edinburgh, 1991 http://citeseer.ist.psu.edu/article/prasad91combinators.html More
@phdthesis{ prasad87combinators,
author = "K. V. S. Prasad",
title = "Combinators and Bisimulation Proofs for Restartable Systems",
month = "December",
year = "1987",
url = "citeseer.ist.psu.edu/article/prasad91combinators.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
906 A structural approach to operational semantics - Plotkin - 1981
502 Concurrency and automata on infinite sequences (context) - Park - 1981
357 Algebraic laws for nondeterminism and concurrency (context) - Hennessy, Milner - 1985
216 Theoretical Computer Science (context) - Milner, synchrony - 1983
204 Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
177 Fail-stop processors: an approach to designing fault-toleran.. - Schlichting, Schneider - 1981
168 Testing equivalences for processes (context) - de Nicola, Hennessy - 1984
106 An algebraic definition of simulation between programs (context) - Milner - 1972
98 Fault Tolerance: Principles and Practice (context) - Anderson, Lee - 1981
58 Theoretical Computer Science (context) - Winskel
48 Higher level synchronising devices in MEIJE-SCCS (context) - de Simone - 1985
29 Algebra of communicating processes (context) - Bergstra, Klop - 1986
24 ACM Transactions on Programming Languages and Systems (context) - Milne, the et al. - 1985
12 Lectures on a calculus for communicating systems (context) - Milner - 1984
11 A complete protocol verification using relativised bisimulat.. (context) - Larsen, Milner - 1986
8 Process constructors and interpretations (context) - Milner - 1986
7 Algebraic specification and proof of a distributed recovery .. (context) - He, Hoare - 1986
6 Testing Equivalences and Fully Abstract Models for Communica.. (context) - de Nicola - 1985
5 Technical report (context) - Bolognesi, de Nicola et al. - 1986
5 Proof Techniques for CCS (context) - Sanderson - 1982
3 Specification and proof of a simple fault tolerant system in.. (context) - Prasad - 1984
3 Context Dependent Equivalences in CCS (context) - Larsen - 1986
3 Consistent state restoration in distributed systems (context) - Merlin, Randell - 1977
2 Specification and proof of a regular expression recogniser i.. (context) - Backhouse - 1983
2 Lectures given during the Autumn School at Colle-sur-Loup (context) - Boudol, algebraic et al. - 1984
2 Technical Report SEDOS/C/N (context) - Brinksma, improvement - 1985
2 Design and implementation of a simple message switching syst.. (context) - Prasad, Ramani et al. - 1982
2 Notes on communicating sequential systems (context) - Hoare - 1984
2 A semi-formal proof of the alternating bit protocol (context) - Mitchell - 1983
2 A CCS specification of the OSI network service (context) - Shields, Wray - 1983
2 Open systems interconnection: Lotos (context) - OIS - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.chalmers.se.html): More
Variable Sets and Functions Framework for Conceptual.. - Diskin, Cadish (1995) (Correct)
A Definitional Approach to Functional Logic Programming - Torgersson (1996) (Correct)
The Hahn-Banach Theorem in Type Theory - Cederquist, Coquand, Negri (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC