Results 1  10
of
18
Refinement of Actions and Equivalence Notions for Concurrent Systems
 Acta Informatica
, 1998
"... This paper combines and extends the material of [GGa/c/d/e], except for the part in [GGc] on refinement of transitions in Petri nets and the discussion of TCSPlike parallel composition in [GGe]. An informal presentation of some basic ingredients of this paper appeared as [GGb]. Among others, th ..."
Abstract

Cited by 36 (1 self)
 Add to MetaCart
This paper combines and extends the material of [GGa/c/d/e], except for the part in [GGc] on refinement of transitions in Petri nets and the discussion of TCSPlike parallel composition in [GGe]. An informal presentation of some basic ingredients of this paper appeared as [GGb]. Among others, the treatment of action refinement in stable and nonstable event structures is new. The research reported here was supported by Esprit project 432 (METEOR), Esprit Basic Research Action 3148 (DEMON), Sonderforschungsbereich 342 of the TU Munchen, ONR grant N0001492J1974 and the Human Capital and Mobility Cooperation Network EXPRESS (Expressiveness of Languages for Concurrency). Contents
Axiomatizing GSOS with Termination
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
Rooted branching bisimulation as a congruence
 Journal of Computer and System Sciences
, 2000
"... This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote’s ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, an ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote’s ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises. 1
Axiomatising STBisimulation Equivalence
 in Proc. of the IFIP Working Conf. on Programming Concepts, Methods and Calculi (PROCOMET '94
, 1994
"... s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 9315 Data Algorithm: A Numerical Method to Extract Shape Information from Gray Scale Ima ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
s are available from the same host in the directory /pub/TR/UBLCS/ABSTRACTS in plain text format. All local authors can be reached via email at the address lastname@cs.unibo.it. UBLCS Technical Report Series 9315 Data Algorithm: A Numerical Method to Extract Shape Information from Gray Scale Images, R. Davoli, F. Tamburini, June 1993. 9316 Towards Performance Evaluation in Process Algebras, R. Gorrieri, M. Roccetti, July 1993. 9317 Split and ST Bisimulation Semantics, R. Gorrieri, C. Laneve, July 1993. 9318 Multilanguage Interoperability, G. Attardi, M. Gaspari, July 1993. 9319 HERMES: an Expert System for the Prognosis of Hepatic Diseases, I. Bonf a, C. Maioli, F. Sarti, G.L. Milandri, P.R. Dal Monte, September 1993. 9320 An Information Flow Security Property for CCS, R. Focardi, R. Gorrieri, October 1993. 9321 A Classification of Security Properties, R. Focardi, R. Gorrieri, October 1993. 9322 Real Time Systems: A Tutorial, F. Panzieri, R. Davoli, October 1993. 9323 A Sca...
Process Algebra with Recursive Operations
"... ing from just the two atomic actions in I def = fthrow; tailg, FIR b 1 yields I ((throw tail) throw head) = head: First, observe I (throw tail) = . Then, using (4), it easily follows that I ((throw tail) throw head) = head: This expresses that head eventually comes up, and thus ex ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
ing from just the two atomic actions in I def = fthrow; tailg, FIR b 1 yields I ((throw tail) throw head) = head: First, observe I (throw tail) = . Then, using (4), it easily follows that I ((throw tail) throw head) = head: This expresses that head eventually comes up, and thus excludes the infinite sequence of steps present in I ((throw tail) throw head). 7.2 Empty Process Let the symbol " denote the empty process, introduced as a unit for sequential composition by Koymans and Vrancken in [58] (see also [28, 74]). Obvious as " may be (being a unit for \Delta), its introduction is nontrivial because at the same time it must be a unit for k as well. In the design of BPA, PA, ACP and related axiom systems, it has proved useful to study versions of the theory, both with and without ". Just for this reason the star operation with its (original) defining equation as given by Kleene in [54] was introduced in process algebra. Taking y = " in x y, one obtains x ...
On the TwoVariable Fragment of the Equational Theory of the MaxSum Algebra of the Natural Numbers
, 2000
"... This paper shows that the collection of identities in two variables which hold in the algebra N of the natural numbers with constant zero, and binary operations of sum and maximum does not have a finite equational axiomatization. This gives an alternative proof of the nonexistence of a finite basis ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
This paper shows that the collection of identities in two variables which hold in the algebra N of the natural numbers with constant zero, and binary operations of sum and maximum does not have a finite equational axiomatization. This gives an alternative proof of the nonexistence of a finite basis for N  a result previously obtained by the authors. As an application of the main theorem, it is shown that the language of Basic Process Algebra (over a singleton set of actions), with or without the empty process, has no finite \omegacomplete equational axiomatization modulo trace equivalence.
Rule formats for compositional noninterference properties
 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING
, 2004
"... ..."
A unique decomposition theorem for ordered monoids with applications in process theory
 In Branislav Rovan and Peter Vojtás, editors, Proceedings of MFCS 2003
, 2003
"... Abstract. We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP ε with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prim ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP ε with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prime processes in exactly one way. 1
Reniers. Timed process algebra (with a focus on explicit termination and relativetiming
 Proceedings of the International School on Formal Methods for the Design of RealTime Systems (SFMRT’04), volume 3185 of Lecture Notes in Computer Science
, 2004
"... Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discr ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Abstract. We treat theory and application of timed process algebra. We focus on a variant that uses explicit termination and action prefixing. This variant has some advantages over other variants. We concentrate on relative timing, but the treatment of absolute timing is similar. We treat both discrete and dense timing. We build up the theory incrementally. The different algebras are interrelated by embeddings and conservative extensions. As an example, we consider the PAR communication protocol. 1