Results 1  10
of
1,502
A processalgebraic language for probabilistic I/O automata
 IN PROC. OF THE 14TH INT. CONF. ON CONCURRENCY THEORY (CONCUR 2003), LNCS
, 2003
"... We present a processalgebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “inputenabled” property, which requires that all input actions be enabled in every state of a PIOA, we augment the language with a set of type inferenc ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We present a processalgebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “inputenabled” property, which requires that all input actions be enabled in every state of a PIOA, we augment the language with a set of type
Equivalence Semantics for Process Algebraic Language: Standard and Symbolic Bisimulation
, 1998
"... Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed originally to specify and to analyze concurrent systems. A process algebra consists of a concise language, a precisely defined semantics, a notion of equivalence and a set of algebraic laws allowing synta ..."
Abstract
 Add to MetaCart
Introduction Process algebras, such as CCS [Mil89], CSP [Hoa85], and ACP [JJ85], were developed originally to specify and to analyze concurrent systems. A process algebra consists of a concise language, a precisely defined semantics, a notion of equivalence and a set of algebraic laws allowing
A Tutorial on Process Algebraic Specification
, 1992
"... The process algebraic language of CCS, Calculus of Communicating Systems, is introduced by an example of a simple callprocessing protocol. No background on process algebra is assumed. ..."
Abstract
 Add to MetaCart
The process algebraic language of CCS, Calculus of Communicating Systems, is introduced by an example of a simple callprocessing protocol. No background on process algebra is assumed.
The Action Graph Model as a Link Between Abstract Relation Algebras and Processalgebraic Specifications
"... Relational algebra in the sense of Schroder and Tarski has been thoroughly studied by mathematicians from the universal algebraic viewpoint and some research has shown many applications of the relational calculus in the fields of graph theory and computer science. This paper addresses the field of p ..."
Abstract
 Add to MetaCart
of processalgebraic languages, which are used for the specification and verification of communicating systems. The construction of a bridge from process algebra to relational algebra is investigated. A processalgebraic language is propounded by adding a parallelism operator to the structure of relational
ProcessAlgebraic Interpretation of AADL Models
, 2009
"... We present a toolset for the behavioral verification and validation of architectural models of embedded systems expressed in the language AADL. The toolset provides simulation and timing analysis of AADL models. Underlying both tools is a processalgebraic implementation of AADL semantics. The comm ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present a toolset for the behavioral verification and validation of architectural models of embedded systems expressed in the language AADL. The toolset provides simulation and timing analysis of AADL models. Underlying both tools is a processalgebraic implementation of AADL semantics
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 757 (102 self)
 Add to MetaCart
easily modelled. In this thesis a novel compositional approach to performance modelling is presented. This approach is based on a suitably enhanced process algebra, PEPA (Performance Evaluation Process Algebra). The compositional nature of the language provides benefits for model solution as well
ProcessAlgebraic Foundations of AspectOriented Programming
 In Proceedings of the Third International Conference on Metalevel Architectures and Separation of Crosscutting Concerns (Reflection 2001
, 2001
"... Process algebras are proposed as a foundation for aspectoriented programming. A particular process algebra is described, and programs illustrating its use in programming are given. It is argued that the framework clarifies the notion of equivalence between programs and correctness of aspectweaving ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
weaving algorithms. The question of which notion of equivalence is most appropriate is discussed from theoretical and practical points of view. An aspectweaving algorithm is presented and proven correct. A simple imperative aspectoriented language is presented and translated into the given process algebra.
Probabilistic Latent Semantic Analysis
 In Proc. of Uncertainty in Artificial Intelligence, UAI’99
, 1999
"... Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of twomode and cooccurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Sema ..."
Abstract

Cited by 771 (9 self)
 Add to MetaCart
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of twomode and cooccurrence data, which has applications in information retrieval and filtering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent
Unsupervised Learning by Probabilistic Latent Semantic Analysis
 Machine Learning
, 2001
"... Abstract. This paper presents a novel statistical method for factor analysis of binary and count data which is closely related to a technique known as Latent Semantic Analysis. In contrast to the latter method which stems from linear algebra and performs a Singular Value Decomposition of cooccurren ..."
Abstract

Cited by 618 (4 self)
 Add to MetaCart
Maximization algorithm for model fitting, which has shown excellent performance in practice. Probabilistic Latent Semantic Analysis has many applications, most prominently in information retrieval, natural language processing, machine learning from text, and in related areas. The paper presents perplexity
A Balancing Act: Analyzing a Distributed Lift System
 Proc. 6th Workshop on Formal Methods for Industrial Critical Systems, 2001
"... Abstract The processalgebraic language µcrl is used to analyze an existing distributed system for lifting trucks. Four errors were found in the original design. We propose solutions for these problems and show by means of modelchecking that the modified system meets the requirements. ..."
Abstract

Cited by 10 (3 self)
 Add to MetaCart
Abstract The processalgebraic language µcrl is used to analyze an existing distributed system for lifting trucks. Four errors were found in the original design. We propose solutions for these problems and show by means of modelchecking that the modified system meets the requirements.
Results 1  10
of
1,502