• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 3,726
Next 10 →

Parallel Composition ||

by A. Processes
"... A process is defined by a one or more local processes separated by commas. The definition is terminated by a full stop. STOP and ERROR are primitive local processes. ..."
Abstract - Add to MetaCart
A process is defined by a one or more local processes separated by commas. The definition is terminated by a full stop. STOP and ERROR are primitive local processes.

Parallel composition of logics — Semantics

by A. Sernadas, C. Sernadas, J. Rasga - Preprint, SQIG - IT and IST - TU Lisbon , 2010
"... Capitalizing on the graph-theoretic account of logic systems and their fibrings in [25], and inspired on notions of concurrency, a novel form of combination of logics — parallel composition — is proposed at the semantic level. Parallel composition allows both symmetric (like sharing) and non-symmetr ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Capitalizing on the graph-theoretic account of logic systems and their fibrings in [25], and inspired on notions of concurrency, a novel form of combination of logics — parallel composition — is proposed at the semantic level. Parallel composition allows both symmetric (like sharing) and non

On Generative Parallel Composition

by Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen , 1999
"... A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process. Compositionality is an essential ingredient for specifying systems. Parallel composition in a probabilistic setting is complicated si ..."
Abstract - Cited by 39 (6 self) - Add to MetaCart
A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process. Compositionality is an essential ingredient for specifying systems. Parallel composition in a probabilistic setting is complicated

pages On Generative Parallel Composition

by Pedro R Dargenio, Holger Hermanns
"... katoeninformatikunierlangende A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process Compositionality is an essential ingredient for specifying systems Parallel compo sition in a probabili ..."
Abstract - Add to MetaCart
katoeninformatikunierlangende A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process Compositionality is an essential ingredient for specifying systems Parallel compo sition in a

The Saga of the Axiomatization of Parallel Composition ⋆

by Luca Aceto, Anna Ingolfsdottir
"... Abstract. This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCS-like languages. It focuses, in particular, on non-finite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice. The pa ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
Abstract. This paper surveys some classic and recent results on the finite axiomatizability of bisimilarity over CCS-like languages. It focuses, in particular, on non-finite axiomatizability results stemming from the semantic interplay between parallel composition and nondeterministic choice

Compositional Model Checking

by E. M. Clarke, D. E. Long, K. L. Mcmillan , 1999
"... We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approac ..."
Abstract - Cited by 3252 (70 self) - Add to MetaCart
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type

Parallel composite texture synthesis

by Alexey Zalesny, Vittorio Ferrari, Geert Caenen, Luc Van Gool - TEXTURE 2002 WORKSHOP—ECCV , 2002
"... Many textures require complex models to describe their intricate structures. Their modeling can be simplified if they are considered composites of simpler subtextures. After an initial, unsupervised segmentation of the composite texture into the subtextures, it can be described at two levels. One i ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
Many textures require complex models to describe their intricate structures. Their modeling can be simplified if they are considered composites of simpler subtextures. After an initial, unsupervised segmentation of the composite texture into the subtextures, it can be described at two levels. One

The parallel composition of processes

by L. de Francesco Albasini, N. Sabadini, R. F. C. Walters , 2009
"... We suggest that the canonical parallel operation of processes is composition in a well-supported compact closed category of spans of reflexive graphs. We present the parallel operations of classical process algebras as derived operations arising from monoid objects in such a ..."
Abstract - Add to MetaCart
We suggest that the canonical parallel operation of processes is composition in a well-supported compact closed category of spans of reflexive graphs. We present the parallel operations of classical process algebras as derived operations arising from monoid objects in such a

Software Techniques for Parallel Compositing Images

by Michael Bonner , 2006
"... As parallel machines become larger and larger the programs run on them produce more and more data. Visualizing this data has become a problem onto itself. Parallel compositing is one way in which large amounts of data can be visualized for analysis. 1 ..."
Abstract - Add to MetaCart
As parallel machines become larger and larger the programs run on them produce more and more data. Visualizing this data has become a problem onto itself. Parallel compositing is one way in which large amounts of data can be visualized for analysis. 1

Parallel Composition and Bulk Synchronous Parallel Functional Programming

by Frédéric Loulergue , 2000
"... This paper presents a solution for adding the parallel composition to the weak call-by-value strategy of the BS p [3, 4] and to the BSMLlib library [5]. ..."
Abstract - Cited by 7 (7 self) - Add to MetaCart
This paper presents a solution for adding the parallel composition to the weak call-by-value strategy of the BS p [3, 4] and to the BSMLlib library [5].
Next 10 →
Results 1 - 10 of 3,726
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University