Results 1  10
of
33,252
Process algebra semantics of 'SDL
 Utrecht University, Department of Philosophy
, 1995
"... A new semantics of an interesting subset of the speci cation language SDL is given by a translation to a discretetime variant of process algebra in the form of ACP extended with data as in CRL. The strength of the chosen subset, called 'SDL, is its close connection with full SDL, despite its d ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
A new semantics of an interesting subset of the speci cation language SDL is given by a translation to a discretetime variant of process algebra in the form of ACP extended with data as in CRL. The strength of the chosen subset, called 'SDL, is its close connection with full SDL, despite its
Process Algebra Semantics of phiSDL
 Utrecht University, Department of Philosophy
, 1996
"... A new semantics of an interesting subset of the specification language SDL is given by a translation to a discretetime extension of process algebra in the form of ACP with data added as in ¯CRL. The strength of the chosen subset, called 'SDL, is its close connection with full SDL, despite its ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A new semantics of an interesting subset of the specification language SDL is given by a translation to a discretetime extension of process algebra in the form of ACP with data added as in ¯CRL. The strength of the chosen subset, called 'SDL, is its close connection with full SDL, despite
A ProcessAlgebraic Semantics for VHDL
, 1996
"... this paper. We refer the interested reader to [Hwa95] where CSP models for the behavior of each node in a dependence flow graph are presented. This CSPbased model of the dependence flow graph was the basis of our proof of the correctness of the frontend. The proof of equivalence between the two s ..."
Abstract
 Add to MetaCart
sets of CSP processes (one for the VHDL program, one constructed from the dfg generated automatically by the synthesis system) proceeded by structural induction on the syntax of the original VHDL program from which the dfg was constructed. Details of the proof can be found in [Hwa95]. Figure 1: Overall
A Process Algebraic Semantics for Statecharts via State Refinement
 In PROCOMET '94. North Holland/Elsevier
, 1994
"... this paper we put forth a process algebraic semantics for statecharts agreeing with [19]. In particular, we provide a translation of statecharts into a process algebra with state refinement , a new operator introduced by the authors in [22]. The semantics of a statechart is then given by the labeled ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
this paper we put forth a process algebraic semantics for statecharts agreeing with [19]. In particular, we provide a translation of statecharts into a process algebra with state refinement , a new operator introduced by the authors in [22]. The semantics of a statechart is then given
A Process Algebraic Semantics for Core  ELLA
, 1993
"... We give a presentation of a tracebased semantics of Core ELLA, a covering subset of the commercial hardware description language ELLA, using a synchronous process algebra called ELLA PROCESS ALGEBRA (EPA). This report is a semantics reference manual for ELLA, giving a detailed definition of the ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We give a presentation of a tracebased semantics of Core ELLA, a covering subset of the commercial hardware description language ELLA, using a synchronous process algebra called ELLA PROCESS ALGEBRA (EPA). This report is a semantics reference manual for ELLA, giving a detailed definition
A ProcessAlgebraic Semantics for Generalised Nonblocking
"... Generalised nonblocking is a weak liveness property to express the ability of a system to terminate under given preconditions. This paper studies the notions of equivalence and refinement that preserve generalised nonblocking and proposes a semantic model that characterises generalised nonblocking e ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Generalised nonblocking is a weak liveness property to express the ability of a system to terminate under given preconditions. This paper studies the notions of equivalence and refinement that preserve generalised nonblocking and proposes a semantic model that characterises generalised nonblocking
A Process Algebra Semantics for Message Sequence Charts Including Conditions
"... Message Sequence Charts (MSCs) are a graphical and textual language for the specification of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs b ..."
Abstract
 Add to MetaCart
by means of a process algebra. This semantics covers the complete language of single MSCs but lacks an interpretation for conditions which are used as continuation points of MSCs within an MSC document (a collection of MSCs). In this paper, we give a process algebraic semantics for basic MSCs including
Constitutive Hybrid Processes: a ProcessAlgebraic Semantics for Hybrid Bond Graphs
"... Models of physical systems have to be based on physical principles such as conservation of energy and continuity of power. These principles are inherently enforced by the bond graph modeling formalism. Often, however, physical components may be best modeled as piecewise continuous with discrete mode ..."
Abstract
 Add to MetaCart
of events, executing the discrete state changes, and reinitializing the continuoustime state. This paper presents a comprehensive representation of these different aspects of behavior using hybrid process algebra. The behavior of a hybrid bond graph can then be studied using a uniform representation
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
Results 1  10
of
33,252