Anna Ingólfsdóttir

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∼luca/SV/intro2ccs.pdf. Please let us know of any comment you may have, or typographical(More)
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)
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)
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)
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)
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)