Sciweavers

243 search results - page 38 / 49
» Process Algebra: An Algebraic Theory of Concurrency
Sort
View
JLP
2007
114views more  JLP 2007»
14 years 9 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
WOTUG
2008
14 years 11 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
72
Voted
FAC
2002
66views more  FAC 2002»
14 years 9 months ago
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
James J. Leifer, Robin Milner
TCS
2010
14 years 4 months ago
Combinatorics of labelling in higher-dimensional automata
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
Philippe Gaucher
ICASSP
2008
IEEE
15 years 4 months ago
Alternatives to the discrete fourier transform
It is well-known that the discrete Fourier transform (DFT) of a finite length discrete-time signal samples the discrete-time Fourier transform of the same signal at equidistant p...
Doru-Cristian Balcan, Aliaksei Sandryhaila, Jonath...