Sciweavers

815 search results - page 63 / 163
» Algebraic Recognizability of Languages
Sort
View
MFCS
1998
Springer
15 years 4 months ago
Deadlocking States in Context-Free Process Algebra
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
Jirí Srba
ROOM
2000
15 years 1 months ago
OO-Motivated Process Algebra: A Calculus for CORBA-like Systems
This paper is a proposal for a new two-tier calculus, designed to model aspects of CORBA-like systems at the CORBA evel. The higher object level known as Oompa abstracts away from...
Malcolm Tyrrell, Andrew Butterfield, Alexis Donnel...
FLAIRS
2010
15 years 29 days ago
Problem Solving by English Learners and English Primary Students in an Algebra Readiness ITS
Problem solving was compared for English Learners and English Primary students who had used AnimalWatch, an algebra-readiness ITS. Data records for word problems solved by student...
Federico Cirett, Carole R. Beal
ESOP
2001
Springer
15 years 4 months ago
Modeling an Algebraic Stepper
Programmers rely on the correctness of the tools in their programming environments. In the past, semanticists have studied the correctness of compilers and compiler analyses, which...
John Clements, Matthew Flatt, Matthias Felleisen
ENTCS
2006
98views more  ENTCS 2006»
14 years 12 months ago
A Generic Process Algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
Jos C. M. Baeten, Mario Bravetti