Treffer: Strong splitting bisimulation equivalence
Title:
Strong splitting bisimulation equivalence
Authors:
Source:
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Lecture notes in computer science. :83-97
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie programmation, Programming theory, Algèbre Boole, Boolean algebra, Algebra Boole, Algèbre processus, Process algebra, Algebra proceso, Bisimulation, Bisimulación, Coalgèbre, Coalgebra, Condition opératoire, Operating conditions, Condición operatoria, Processus branchement, Branching process, Proceso ramificación
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computing Science Department, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, Netherlands
Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, Netherlands
Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, Netherlands
Department of Philosophy, Utrecht University, P.O. Box 80126, 3508 TC Utrecht, Netherlands
Programming Research Group, University of Amsterdam, P.O. Box 41882, 1009 DB Amsterdam, Netherlands
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17115998
Database:
PASCAL Archive
Weitere Informationen
We present ACPc, a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms for condition evaluation. We confine ourselves to finitely branching processes. This restriction makes it possible to present' in a concise and intuitively clear way, and to bring the notion of splitting bisimulation equivalence and the issue of condition evaluation in process algebras with conditional expressions to the forefront.