#### Filter Results:

- Full text PDF available (101)

#### Publication Year

1990

2017

- This year (12)
- Last 5 years (37)
- Last 10 years (71)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

These notes are intended to support the course on Semantics and Verification, and may be read independently or in conjunction with Milner’s textbook [15]. They are under constant revision, and their most recent version is available at the URL http://www.cs.auc.dk/∼luca/SV/intro2ccs.pdf. Please let us know of any comment you may have, or typographical… (More)

- Luca Aceto, Zoltán Ésik, Anna Ingólfsdóttir
- AMAST
- 2002

This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration… (More)

- Bernhard Steffen, Anna Ingólfsdóttir
- Inf. Comput.
- 1994

- Matthew Hennessy, Anna Ingólfsdóttir
- ICALP
- 1990

- Luca Aceto, Anna Ingólfsdóttir, Joshua Sack
- EXPRESS
- 2012

The literature on concurrency theory offers a wealth of examples of characteristic-formula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proofs of correctness have been developed independently, but… (More)

- Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir
- CALCO
- 2007

This paper contributes to the study of the equational theory of the semantics in van Glabbeek’s linear time branching time spectrum over the language BCCSP, a basic process algebra for the description of finite synchronization trees. It offers an algorithm for producing a complete (respectively, ground-complete) equational axiomatization of any behavioral… (More)

- Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik
- Processes, Terms and Cycles
- 2005

Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out… (More)

- Daniel Fannar Gudbjartsson, Thorvaldur Thorvaldsson, Augustine Kong, Gunnar Th . Gunnarsson, Anna Ingólfsdóttir
- Nature Genetics
- 2005

To the editor: Most contemporary methods for multipoint linkage analysis are based on either the Elston-Stewart algorithm1 or the LanderGreen Hidden Markov model2 (HMM). The Elston-Stewart algorithm scales exponentially in the number of markers, whereas the Lander-Green HMM scales exponentially in the number of pedigree members. The Vitesse3 and Superlink4… (More)

- Luca Aceto, Rob J. van Glabbeek, Wan Fokkink, Anna Ingólfsdóttir
- Inf. Comput.
- 1996

Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The interaction of prefix iteration with silent steps is studied in the setting of Milner’s basic CCS. Complete equational axiomatizations are given for four notions of behavioural congruence… (More)