## An introduction to milner’s ccs (2004)

Citations: | 2 - 0 self |

### BibTeX

@MISC{Aceto04anintroduction,

author = {Luca Aceto and Kim G. Larsen and Anna Ingólfsdóttir},

title = {An introduction to milner’s ccs},

year = {2004}

}

### OpenURL

### Abstract

### Citations

3400 | Communicating Sequential Processes
- Hoare
- 1985
(Show Context)
Citation Context ...bit behaviour. All of these processes can interact via message-passing modelled as synchronized communication, which is the only basic mode of interaction. This is the key idea underlying Hoare’s CSP =-=[8]-=-, a highly influential proposal for a programming language for parallel programs, and Milner’s CCS [12], the paradigmatic process algebra. 4 The Language CCS We shall now introduce the language CCS. W... |

1286 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context .... The step from a process denoted by a CCS expression to the LTS describing its operational behaviour is taken using the framework of Structural Operational Semantics (SOS) as pioneered by Plotkin in =-=[15]-=-. (The history of the development of the ideas that led to SOS is recounted by Plotkin himself in [16].) The key idea 18sunderlying this approach is that the collection of CCS process expressions will... |

1204 |
The temporal logic of programs
- Pnueli
- 1977
(Show Context)
Citation Context ...years, researchers in computer science have started showing interest in temporal logic as within this framework it is possible to express properties of the behaviour of programs that change over time =-=[4, 17]-=-. The modal µ-calculus [10] is a generalization of Hennessy-Milner logic with recursion that allows for maximal and minimal definitions to be mixed freely. It has been shown that the modal µ-calculus ... |

1179 | Automatic Verification of Finite-State Concurrent Systems using Temporal Logic Specifications
- Clarke, Emerson, et al.
- 1986
(Show Context)
Citation Context ...years, researchers in computer science have started showing interest in temporal logic as within this framework it is possible to express properties of the behaviour of programs that change over time =-=[4, 17]-=-. The modal µ-calculus [10] is a generalization of Hennessy-Milner logic with recursion that allows for maximal and minimal definitions to be mixed freely. It has been shown that the modal µ-calculus ... |

655 |
Concurrency and automata on infinite sequences
- Park
- 1981
(Show Context)
Citation Context ...this latter requirement, as the states that CTM and CTM ′ may reach after inputting a coin are not trace equivalent. The classic notion of strong bisimulation equivalence, introduced by David Park in =-=[14]-=-, formalizes the informal requirements introduced above in a very elegant way. Definition 5.2 [Strong Bisimulation] A binary relation R over the set of states of an LTS is a bisimulation iff whenever ... |

529 |
A lattice-theorethic Fixpoint Theorem and its applications
- Tarski
- 1955
(Show Context)
Citation Context ...nction f : D → D is monotonic iff for all d, d ′ ∈ D, d ⊑ d ′ implies that f(d) ⊑ f(d ′ ). An element d ∈ D is called a fixed point of f iff d = f(d). The following important theorem is due to TARSKI =-=[18]-=-, and was also independently proven by KNÄSTER. 89 ∞ . ↑ 2 ↑ 1 ↑ 0sTheorem A.1 [Tarski’s Fixed Point Theorem] Let (D, ⊑) be a complete lattice, and let f : D → D be monotonic. Then f has a largest fix... |

493 | Algebraic laws for nondeterminism and concurrency
- Hennessy, Milner
- 1985
(Show Context)
Citation Context ...describe, specify and analyze reactive systems, namely • Milner’s Calculus of Communicating Systems (CCS) [12], • the model of Labelled Transition Systems (LTSs) [9] and • Hennessy-Milner Logic (HML) =-=[7]-=- and its extension with recursive definitions of formulae [11]. The Semantics and Verification course presents a general theory of reactive systems and its applications. Our aims in this course are to... |

256 |
Results on the propositional mu–calculus
- Kozen
- 1983
(Show Context)
Citation Context ... science have started showing interest in temporal logic as within this framework it is possible to express properties of the behaviour of programs that change over time [4, 17]. The modal µ-calculus =-=[10]-=- is a generalization of Hennessy-Milner logic with recursion that allows for maximal and minimal definitions to be mixed freely. It has been shown that the modal µ-calculus is expressive enough to des... |

159 |
Formal verification of parallel programs
- KELLER
- 1976
(Show Context)
Citation Context ...he basic notions that we shall use to describe, specify and analyze reactive systems, namely • Milner’s Calculus of Communicating Systems (CCS) [12], • the model of Labelled Transition Systems (LTSs) =-=[9]-=- and • Hennessy-Milner Logic (HML) [7] and its extension with recursive definitions of formulae [11]. The Semantics and Verification course presents a general theory of reactive systems and its applic... |

133 | Semantics with Applications: A Formal Introduction - Nielson, Nielson - 1992 |

57 | A Brief History of Process Algebra
- Baeten
- 2004
(Show Context)
Citation Context ...ms. They evolved from the insights of many outstanding researchers over the last thirty years, and a brief history of the evolution of the original ideas that led to their development may be found in =-=[1]-=-. A crucial initial observation that is at the heart of the notion of process algebra is due to Milner, who noticed that concurrent processes have an algebraic structure. For example, once we have bui... |

47 |
On the development of reactive systems. In: Logics and models of concurrent systems
- Harel, Pnueli
- 1985
(Show Context)
Citation Context ...ations whose effect it is to affect the computing environment (this is the role played by the actuators in the example control program). David Harel and Amir Pnueli coined the term reactive system in =-=[6]-=- to describe a system that, like the aforementioned ones, computes by reacting to stimuli from its environment. As the above examples and discussion indicate, reactive systems are inherently parallel ... |

40 |
On the consistency of Koomen’s fair abstraction rule
- Baeten, Bergstra, et al.
- 1987
(Show Context)
Citation Context ...nd.Wait Del def = del.Ack def = ack.Send + error.Sending Ack def = ack.Rec Med def = send.Med ′ Med ′ def Err = τ.Err + trans.Med def = error.Med Table 8: The sender, receiver and medium in (17) (See =-=[2]-=-, where Baeten, Bergstra and Klop show that a proof rule embodying this idea, namely Koomen’s fair abstraction rule, is valid with respect to observational equivalence.) This means that observational ... |

29 |
Proof systems for satisfiability in Hennessy-Milner logic with recursion
- Larsen
- 1990
(Show Context)
Citation Context ...er’s Calculus of Communicating Systems (CCS) [12], • the model of Labelled Transition Systems (LTSs) [9] and • Hennessy-Milner Logic (HML) [7] and its extension with recursive definitions of formulae =-=[11]-=-. The Semantics and Verification course presents a general theory of reactive systems and its applications. Our aims in this course are to show how 1. to describe actual systems using terms in our cho... |

21 |
Graphical versus logical specifications
- Boudol, Larsen
- 1992
(Show Context)
Citation Context ...her it can perform an a-labelled transition “now”. Phrasing this correctness requirement in terms of observational equivalence seems at best unnatural, and maybe cannot be done at all! (See the paper =-=[3]-=- for an investigation of this issue.) In fact, checking whether a process affords this property seems best done by first constructing the collection of initial a-labelled transitions that are possible... |

16 |
The linear time – branching time spectrum I; the semantics of concrete, sequential processes
- Glabbeek
- 2001
(Show Context)
Citation Context ...sus on what constitutes an appropriate notion of observable behaviour for reactive systems has led to a large number of proposals for behavioural equivalences for concurrent processes. (See the study =-=[5]-=-, where van Glabbeek presents the linear time-branching time spectrum—a lattice of known behavioural equivalences and preorders over LTSs, ordered by inclusion.) In our search for a reasonable notion ... |