22 search results - page 2 / 5 » A Ground-Complete Axiomatization of Finite State Processes i... |
FOSSACS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
CUZA
2002
13 years 5 months ago
2002
This paper presents Process Algebra for Predictible Control Systems (PAPCS) as a model for specifying and analysis of concurrent, time and resource dependent, distributed control s...
TSP
2008
13 years 4 months ago
2008
In our paper titled "Algebraic Signal Processing Theory: Foundation and 1-D Time" appearing in this issue of the IEEE TRANSACTIONS ON SIGNAL PROCESSING, we presented the ...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
CALCO
2005
Springer
13 years 11 months ago
2005
Springer
This paper shows that bisimulation equivalence does not afford a finite equational axiomatization over the language obtained by enriching Bergstra and Klop’s Basic Process Alge...