process graphs | Sciweavers

34

PARLE
1987

144views Distributed And Parallel Com...» more PARLE 1987»

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages

14 years 3 months ago

A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...

Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop

claim paper

Read More »

38

click to vote

CONCUR
2006
Springer

78views Distributed And Parallel Com...» more CONCUR 2006»

Some Remarks on Definability of Process Graphs

14 years 4 months ago

Download www.win.tue.nl

We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...

Clemens Grabmayer, Jan Willem Klop, Bas Luttik

claim paper

Read More »

38

click to vote

EUROMICRO
1998
IEEE

135views Software Engineering» more EUROMICRO 1998»

Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems

14 years 4 months ago

Download www.ida.liu.se

The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...

Petru Eles, Krzysztof Kuchcinski, Zebo Peng, Alexa...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers