Sciweavers

132 search results - page 16 / 27
» Process Equivalences as Global Bisimulations
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Compositional Reasoning for Probabilistic Finite-State Behaviors
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
Yuxin Deng, Catuscia Palamidessi, Jun Pang
CALCO
2005
Springer
105views Mathematics» more  CALCO 2005»
14 years 1 months ago
Bisimilarity Is Not Finitely Based over BPA with Interrupt
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...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
JLP
2006
108views more  JLP 2006»
13 years 7 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
CONCUR
2003
Springer
14 years 1 months ago
Syntactic Formats for Free
act Approach to Process Equivalence Bartek Klin Pawel Soboci´nski BRICS University of Aarhus, Denmark Abstract. A framework of Plotkin and Turi’s, originally aimed at providing ...
Bartek Klin, Pawel Sobocinski
CUZA
2002
132views more  CUZA 2002»
13 years 7 months ago
A Process Algebra for Predictible Control Systems
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...
Nicolae Marian