Results 1  10
of
53
Turning SOS Rules into Equations
, 1994
"... Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinit ..."
Abstract

Cited by 91 (20 self)
 Add to MetaCart
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes.
The origins of structural operational semantics
 Journal of Logic and Algebraic Programming
, 2004
"... We review the origins of structural operational semantics. The main publication ‘A Structural Approach to Operational Semantics, ’ also known as the ‘Aarhus Notes, ’ appeared in 1981 [G.D. Plotkin, A structural approach to operational semantics, DAIMI FN19, Computer Science Department, Aarhus Unive ..."
Abstract

Cited by 69 (0 self)
 Add to MetaCart
(Show Context)
We review the origins of structural operational semantics. The main publication ‘A Structural Approach to Operational Semantics, ’ also known as the ‘Aarhus Notes, ’ appeared in 1981 [G.D. Plotkin, A structural approach to operational semantics, DAIMI FN19, Computer Science Department, Aarhus University, 1981]. The development of the ideas dates back to the early 1970s, involving many people and building on previous work on programming languages and logic. The former included abstract syntax, the SECD machine, and the abstract interpreting machines of the Vienna school; the latter included the λcalculus and formal systems. The initial development of structural operational semantics was for simple functional languages, more or less variations of the λcalculus; after that the ideas were gradually extended to include languages with parallel features, such as Milner’s CCS. This experience set the ground for a more systematic exposition, the subject of an invited course of lectures at Aarhus University; some of these appeared in print as the 1981 Notes. We discuss the content of these lectures and some related considerations such as ‘small state’ versus ‘grand state, ’ structural versus compositional semantics, the influence of the Scott–Strachey approach to denotational semantics, the treatment of recursion and jumps, and static semantics. We next discuss relations with other work and some immediate further development. We conclude with an account of an old, previously unpublished, idea: an alternative, perhaps more readable, graphical presentation of systems of rules for operational semantics.
Foundations of Modular SOS
, 1999
"... A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three ..."
Abstract

Cited by 33 (7 self)
 Add to MetaCart
A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three
A Resource Logic for MultiAgent Plan Merging
 Annals of Mathematics and Artificial Intelligence, special issue on Computational Logic on MultiAgent Systems
, 2003
"... In a multiagent system, agents are carrying out certain tasks by executing plans. Consequently, the problem of finding a plan, given a certain goal, has been given a lot of attention in the literature. Instead of concentrating on this problem, the focus of this paper is on cooperation between agent ..."
Abstract

Cited by 25 (10 self)
 Add to MetaCart
In a multiagent system, agents are carrying out certain tasks by executing plans. Consequently, the problem of finding a plan, given a certain goal, has been given a lot of attention in the literature. Instead of concentrating on this problem, the focus of this paper is on cooperation between agents which already have constructed plans for their goals. By cooperating, agents might reduce the number of actions they have to perform in order to fulfill their goals. The key idea is that in carrying out a plan an agent possibly produces side products that can be used as resources by other agents. As a result, an other agent can discard some of its planned actions. This process of exchanging products, called plan merging, results in distributed plans in which agents become dependent on each other, but are able to attain their goals more efficiently.
Stochastic Petri Net Semantics for Stochastic Process Algebras
 In Proc. 6th International Workshop on Petri Nets and Performance Models
, 1995
"... In this paper we define a Stochastic Petri Net (SPN) semantics for Stochastic Process Algebras (SPAs), a recently introduced formalism that offers a novel approach for performance modeling. The proposed semantics is evaluated in terms of three criteria: Concurrency and Retrievability, as defined by ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
(Show Context)
In this paper we define a Stochastic Petri Net (SPN) semantics for Stochastic Process Algebras (SPAs), a recently introduced formalism that offers a novel approach for performance modeling. The proposed semantics is evaluated in terms of three criteria: Concurrency and Retrievability, as defined by Olderog for untimed net semantics, and Markov Equivalence for the stochastic aspects. 1 Introduction SPNs and SPAs have had somewhat of a common development. In both cases the original definitions (standard Petri nets and pure Process Algebra) did not include any temporal information, so that they were used only for the qualitative analysis of concurrent systems. The timing extensions of the basic formalisms also allowed one to study the quantitative properties of systems. In particular, in both SPNs and SPAs, negative exponentially distributed delays have been associated with the elementary events (transitions and actions), and it has been proved that both formalisms can be viewed as high...
Formal Methods and the Development of Dependable Systems
, 1996
"... This document type describes the functions, data and dynamic behaviour of an object associated with a specific level. In addition, boundary conditions restricting the class of possible realisations for the object are documented. (2) Architecture Description: This is a design structure which decompos ..."
Abstract

Cited by 18 (4 self)
 Add to MetaCart
This document type describes the functions, data and dynamic behaviour of an object associated with a specific level. In addition, boundary conditions restricting the class of possible realisations for the object are documented. (2) Architecture Description: This is a design structure which decomposes the object under consideration and/or refines its data structures. The process of decomposition introduces new objects to be associated with a lower level, as well as interfaces between them. Each new object is associated with its own lowerlevel requirements description. In this way, the alternation between requirements and architecture documents can be recursively applied to the decomposition tree from system to module level
Foundations of Modular SOS (Extended Abstract)
 In MFCS'99, Proc. 24th Intl. Symp. on Mathematical Foundations of Computer Science, SzklarskaPoreba
, 1999
"... ) Peter D. Mosses 1;2 1 BRICS and Department of Computer Science, University of Aarhus, Denmark 2 Visiting SRI International and Stanford University, USA Abstract. A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in c ..."
Abstract

Cited by 18 (16 self)
 Add to MetaCart
(Show Context)
) Peter D. Mosses 1;2 1 BRICS and Department of Computer Science, University of Aarhus, Denmark 2 Visiting SRI International and Stanford University, USA Abstract. A novel form of labelled transition system is proposed, where the labels are the arrows of a category, and adjacent labels in computations are required to be composable. Such transition systems provide the foundations for modular SOS descriptions of programming languages. Three fundamental ways of transforming label categories, analogous to monad transformers, are provided, and it is shown that their applications preserve computations in modular SOS. The approach is illustrated with fragments taken from a modular SOS for ML concurrency primitives. 1 Introduction SOS (structural operational semantics) is a widelyused framework for defining process algebras [12, e.g.] and programming languages [13, e.g.]. Following Plotkin [22], SOS has often been preferred to the more abstract framework of denotational seman...
Mode Transfer in Process Algebra
, 2000
"... This paper provides a systematic and full treatment of mode transfer operators in process algebra, including complete axiomatizations, operational rules, analysis of expressive power and extensions with timing features. In particular, we study a disrupt operator and an interrupt operator. Note: thi ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
This paper provides a systematic and full treatment of mode transfer operators in process algebra, including complete axiomatizations, operational rules, analysis of expressive power and extensions with timing features. In particular, we study a disrupt operator and an interrupt operator. Note: this paper is a revision and extension of [7] 1 Introduction A useful feature in programming languages and specification languages is the ability to denote mode switches. In particular, most languages have means to describe the disrupt or interrupt the normal execution of a system. Also in process algebra, various disrupt and interrupt operators have received attention, see e.g. [7], [10], [11], [3], [12]. In LOTOS (see [9]) we have the disruption operator, that is denoted [>. Another name is disabling. In this paper, we provide a systematic and full treatment of mode transfer operators in process algebra, including complete axiomatizations, operational rules, analysis of expressive power and ...