Results 1  10
of
36
A Congruence Theorem for Structured Operational Semantics With Predicates
, 1993
"... . We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples t ..."
Abstract

Cited by 114 (5 self)
 Add to MetaCart
. We proposed a syntactical format, the path format, for structured operational semantics in which predicates may occur. We proved that strong bisimulation is a congruence for all the operators that can be defined within the path format. To show that this format is useful we provided many examples that we took from the literature about CCS, CSP, and ACP; they do satisfy the path format but no formats proposed by others. The examples include concepts like termination, convergence, divergence, weak bisimulation, a zero object, side conditions, functions, real time, discrete time, sequencing, negative premises, negative conclusions, and priorities (or a combination of these notions). Key Words & Phrases: structured operational semantics, term deduction system, transition system specification, structured state system, labelled transition system, strong bisimulation, congruence theorem, predicate. 1980 Mathematics Subject Classification (1985 Revision): 68Q05, 68Q55. CR Categories: D.3.1...
Ntyft/ntyxt rules reduce to ntree rules
 Information and Computation
, 1996
"... Groote and Vaandrager introduced the tyft/tyxt format for Transition System Specifications (TSSs), and established that for each TSS in this format that is wellfounded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalen ..."
Abstract

Cited by 54 (18 self)
 Add to MetaCart
(Show Context)
Groote and Vaandrager introduced the tyft/tyxt format for Transition System Specifications (TSSs), and established that for each TSS in this format that is wellfounded, the bisimulation equivalence it induces is a congruence. In this paper, we construct for each TSS in tyft/tyxt format an equivalent TSS that consists of tree rules only. As a corollary we can give an affirmative answer to an open question, namely whether the wellfoundedness condition in the congruence theorem for tyft/tyxt can be dropped. These results extend to tyft/tyxt with negative premises and predicates. 1
Embedding as a tool for Language Comparison
, 1994
"... This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent constraint languages. We refine the notion of embedding by adding some "reasonable" conditions, suitable for concurrent frameworks. The new notion, called modular embedding, i ..."
Abstract

Cited by 32 (5 self)
 Add to MetaCart
This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent constraint languages. We refine the notion of embedding by adding some "reasonable" conditions, suitable for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing different degrees of expressiveness. We show that this preorder is not trivial (i.e. it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, while the converses hold. 4 A; C; D; G; M;O;P;R; T : In calligraphic style. ss; ff ; dd: In slanted style. \Sigma; \Gamma; #; oe; ; /; ø; ff. S ; [; "; ;; 2 j=; 6j=; ; 9 +; k; ~ +; ~ k; ! \Gamma! W ; \Gamma! ; ; \Gamma! W ; \Gamma! ; h; i; [[; ]]; d; e ffi; ?; ; 5 All reasonable programming languages are equivalent, since they are Turing...
An abstract coalgebraic approach to process equivalence for wellbehaved operational semantics
, 2004
"... This thesis is part of the programme aimed at finding a mathematical theory of wellbehaved structural operational semantics. General and basic results shown in 1997 in a seminal paper by Turi and Plotkin are extended in two directions, aiming at greater expressivity of the framework. The socalled ..."
Abstract

Cited by 20 (6 self)
 Add to MetaCart
This thesis is part of the programme aimed at finding a mathematical theory of wellbehaved structural operational semantics. General and basic results shown in 1997 in a seminal paper by Turi and Plotkin are extended in two directions, aiming at greater expressivity of the framework. The socalled bialgebraic framework of Turi and Plotkin is an abstract generalization of the wellknown structural operational semantics format GSOS, and provides a theory of operational semantic rules for which bisimulation equivalence is a congruence. The first part of this thesis aims at extending that framework to cover other operational equivalences and preorders (e.g. trace equivalence), known collectively as the van Glabbeek spectrum. To do this, a novel coalgebraic approach to relations on processes is desirable, since the usual approach to coalgebraic bisimulations as spans of coalgebras does not extend easily to other known equivalences on processes. Such an approach, based on fibrations of test
Equivalences on Observable Processes
 In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science
, 1992
"... The aim of this paper is to nd the nest `observable ' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theory of observable processes where semantics of processes are based on locally and nitely observable process behaviour, and ..."
Abstract

Cited by 19 (6 self)
 Add to MetaCart
(Show Context)
The aim of this paper is to nd the nest `observable ' and `implementable' equivalence on concurrent processes. This is a part of a larger programme to develop a theory of observable processes where semantics of processes are based on locally and nitely observable process behaviour, and all process constructs are allowed, provided their operational meaning is de ned by realistically implementable transition rules.
CCS with Hennessy’s merge has no finite equational axiomatization
 Theoretical Computer Science
, 2005
"... This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicationg Systems is not finitely based modulo bisimulation equ ..."
Abstract

Cited by 19 (16 self)
 Add to MetaCart
(Show Context)
This paper confirms a conjecture of Bergstra and Klop’s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner’s Calculus of Communicationg Systems is not finitely based modulo bisimulation equivalence. Thus Hennessy’s merge cannot replace the left merge and communication merge operators proposed by Bergstra and Klop, at least if a finite axiomatization of parallel composition is desired.
Algebra and Logic for Resourcebased Systems Modelling
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2009
"... ... often, models are required to be executable, as a simulation, on a computer. In this paper, we present some contributions to the processtheoretic and logical foundations of discreteevent modelling with resources and processes. We present a process calculus with an explicit representation of re ..."
Abstract

Cited by 17 (10 self)
 Add to MetaCart
... often, models are required to be executable, as a simulation, on a computer. In this paper, we present some contributions to the processtheoretic and logical foundations of discreteevent modelling with resources and processes. We present a process calculus with an explicit representation of resources in which processes and resources coevolve. The calculus is closely connected to a logic that may be used as a specification language for properties of models. The logic is strong enough to allow requirements that a system has certain structure; for example, that it is a parallel composite of subsystems. This work consolidates, extends, and improves upon aspects of earlier work of ours in this area. An extended example, consisting of a semantics for a simple parallel programming language, indicates a connection with separating logics for concurrency.
Trios in Concert
 Proof, Language and Interaction: Essays in Honour of Robin Milner
, 1998
"... A trio is a term ff : fi : fl : 0 in the polyadic ßcalculus. We show that restricted parallel composition of possibly replicated trios, where at most one contains a bound output prefix, is enough to obtain the expressive power of the full summationfree ßcalculus up to weak bisimulation equivalenc ..."
Abstract

Cited by 13 (4 self)
 Add to MetaCart
(Show Context)
A trio is a term ff : fi : fl : 0 in the polyadic ßcalculus. We show that restricted parallel composition of possibly replicated trios, where at most one contains a bound output prefix, is enough to obtain the expressive power of the full summationfree ßcalculus up to weak bisimulation equivalence. Therefore that fragment of the calculus is undecidable. 1 Introduction The ßcalculus [MPW92, Mil91] is a basic calculus for describing reactive processes, i.e., processes that continually interact with an environment. Although there is yet no definite measure on its expressiveness there is strong evidence that its primitives are enough for a wide variety of purposes. Within the ßcalculus it is possible to naturally encode the functional paradigms of the calculus [Mil92] and of object oriented formalisms [Wal95]. The ability to directly represent mobility, in the sense of processes that reconfigure their interconnection structure when they execute, makes it easy to model systems where ...