#### Filter Results:

#### Publication Year

1986

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

In this paper, a process algebra that incorporates explicit representations of successful termination, deadlock, and divergence is introduced and its semantic theory is analyzed. Both an operational and a denotational semantics for the language is given and it is shown that they agree. The operational theory is based upon a suitable adaptation of the notion… (More)

Many process algebras are deened by structural operational semantics (SOS). Indeed , most such deenitions are nicely structured and t the GSOS format of 19]. We give a procedure for converting any GSOS language deenition to a nite complete equa-tional axiom system (possibly with one innnitary induction principle) which precisely characterizes strong… (More)

Aceto, L., GSOS and finite labelled transition systems, Theoretical Computer Science 131 (1994) 181-195. Recently there has been considerable interest in studying formats of Plotkin style inference rules which ensure that the induced labelled transition system semantics have certain properties, In this note, I shall give a contribution to this line of… (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)

These notes are intended to support the course on Semantics and Verification , and may be read independently or in conjunction with Mil-ner's textbook [15]. They are under constant revision, and their most recent version is available at the URL Please let us know of any comment you may have, or typographical mistake you may find, by sending an email at the… (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)

There has been considerable controversy in concurrency theory between the `interleaving' and`true concurrency' schools. The former school advocates associating a transition system with a process which captures concurrent execution via the interleaving of occurrences; the latter adopts more complex semantic structures to avoid reducing concurrency to… (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 behav-ioral… (More)