Results 51 to 60 of about 11,242,864 (292)

An algebra of Boolean processes [PDF]

, 1992
This work has been motivated by the study of the S/R models which allow to represent systems as a set of communicating state machines cooperating through a shared memory.
Costas Courcoubetis, Susanne Graf, Joseph Sifakis   +2 more
openaire   +2 more sources

A Process Algebraic Approach to Predict and Control Uncertainty in Smart IoT Systems for Smart Cities Based on Permissible Probabilistic Equivalence

Sensors
Process algebra is one of the most suitable formal methods to model smart IoT systems for smart cities. Each IoT in the systems can be modeled as a process in algebra. In addition, the nondeterministic behavior of the systems can be predicted by defining
Junsup Song, Dimitris Karagiannis, Moonkun Lee   +2 more
doaj   +1 more source

LeGESD: A framework oriented to the specification and formal validation of concurrent and distributed systems based on a graphical language and its process algebra semantics

Revista Facultad de Ingeniería Universidad de Antioquia, 2012
The specification and formal verification of distributed systems is usually a complex task. It requires extensive knowledge of algorithm theory and modeling of distributed or concurrent systems.
Jorge Cortés Galicia, Felipe M. Menchaca García, Rolando Menchaca Méndez   +2 more
doaj   +1 more source

Analysing Mutual Exclusion using Process Algebra with Signals [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
In contrast to common belief, the Calculus of Communicating Systems (CCS) and similar process algebras lack the expressive power to accurately capture mutual exclusion protocols without enriching the language with fairness assumptions.
Victor Dyseryn, Rob van Glabbeek, Peter Höfner   +2 more
doaj   +1 more source

Identities in the Algebra of Partial Maps [PDF]

, 2005
We consider the identities of a variety of semigroup-related algebras modelling the algebra of partial maps. We show that the identities are intimately related to a weak semigroup deductive system and we show that the equational theory is decidable.
Marcel Jackson, Stokes, Tim E., Tim Stokes, Jackson, Marcel   +3 more
core   +1 more source

A Process Algebra for Games

CoRR, 2013
Using formal tools in computer science to describe games is an interesting problem. We give games, exactly two person games, an axiomatic foundation based on the process algebra ACP (Algebra of Communicating Process). A fresh operator called opponent's alternative composition operator (OA) is introduced into ACP to describe game trees and game ...
Yong Wang, Li Lin, Kai Li
openaire   +2 more sources

Reversing Algebraic Process Calculi [PDF]

The Journal of Logic and Algebraic Programming, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Iain Phillips 0001, Irek Ulidowski
openaire   +4 more sources

On upper modular subalgebras of a Lie algebra. [PDF]

, 2004
This paper is a further contribution to the extensive study by a number of authors of the subalgebra lattice of a Lie algebra. We give some necessary and some sufficient conditions for a subalgebra to be upper modular.
Bowman, Kevin, Varea, Vicente R., Towers, David A.   +2 more
core   +4 more sources

Usage of computer algebra in teaching process

Lietuvos Matematikos Rinkinys, 1998
This work was intended to motivate the necessity of intensive training of mathematics utilising the computer algebra MAPLE in Lithuanian Military Academy.
Aleksas Domarkas, Gintautas Misevičius, Violeta Pakalnytė, Albertas Pincevičius, Rimantas-Jonas Rakauskas   +4 more
doaj   +3 more sources

The Algebra of Synchronous Processes [PDF]

Fundamenta Informaticae, 1989
An algebraical theory called ASP is presented, describing synchronous cooperation of processes. The theory ASP was first mentioned in BERGSTRA & KLOP [4] as an alternative for the theory ACP, which works with asynchronous cooperation (see also in [5]).
openaire   +2 more sources