Learn More
Structural Operational Semantics (SOS) provides a framework to give an operational semantics to programming and speci cation languages, which, because of its intuitive appeal and exibility, has found considerable application in the theory of concurrent processes. Even though SOS is widely used in programming language semantics at large, some of its most(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)
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)
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)
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)
In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks. This logic may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every logical formula φ, a socalled test(More)