Sciweavers

38 search results - page 7 / 8
» Non-interleaving bisimulation equivalences on Basic Parallel...
Sort
View
LACL
2005
Springer
15 years 3 months ago
A Polynomial Time Extension of Parallel Multiple Context-Free Grammar
Abstract. It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2,3] and r...
Peter Ljunglöf
IANDC
2006
121views more  IANDC 2006»
14 years 9 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
BIRTHDAY
2005
Springer
15 years 3 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...
77
Voted
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
15 years 3 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
PDSE
1998
108views more  PDSE 1998»
14 years 11 months ago
An Algebraic Framework for Optimizing Parallel Programs
This paper proposes a theoretical framework for verifying and deriving code optimizations for programs written in parallel programming languages. The key idea of this framework is...
Ichiro Satoh