Sciweavers

16 search results - page 2 / 4
» An Algebraic Framework for Defining Random Concurrent Behavi...
Sort
View
ENTCS
2006
150views more  ENTCS 2006»
13 years 5 months ago
Causality Versus True-Concurrency
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Sibylle B. Fröschle, Slawomir Lasota
CC
2010
Springer
135views System Software» more  CC 2010»
13 years 5 months ago
Counting Irreducible Components of Complex Algebraic Varieties
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
Peter Bürgisser, Peter Scheiblechner
TCS
2008
13 years 5 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
SIGSOFT
2002
ACM
14 years 6 months ago
Composable semantics for model-based notations
We propose a unifying framework for model-based specification notations. Our framework captures the execution semantics that are common among model-based notations, and leaves the...
Jianwei Niu, Joanne M. Atlee, Nancy A. Day
CONCUR
2001
Springer
13 years 9 months ago
Compositional Modeling of Reactive Systems Using Open Nets
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Rei...