Sciweavers

1012 search results - page 41 / 203
» Process Algebra with Backtracking
Sort
View
ENTCS
2006
129views more  ENTCS 2006»
13 years 7 months ago
Confluence Thanks to Extensional Determinism
A process is extensionally deterministic if, after any trace s and given any event a, it is either certain to accept or certain to refuse a (stably) after s. We show how several p...
A. W. Roscoe
TCOS
2008
13 years 7 months ago
On Contemporary Denotational Mathematics for Computational Intelligence
Denotational mathematics is a category of expressive mathematical structures that deals with high-level mathematical entities beyond numbers and sets, such as abstract objects, com...
Yingxu Wang
JLP
2006
113views more  JLP 2006»
13 years 7 months ago
Continuity controlled hybrid automata
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Jan A. Bergstra, C. A. Middelburg
APIN
1998
98views more  APIN 1998»
13 years 7 months ago
The Evolution of Concurrent Programs
Process algebra are formal languages used for the rigorous specification and analysis of concurrent systems. By using a process algebra as the target language of a genetic program...
Brian J. Ross
NADA
1998
Springer
136views Hardware» more  NADA 1998»
14 years 1 days ago
Towards an Algebraic Specification of the Java Virtual Machine
abstractions to focus on principle issues and impose structure - Model behaviour - Determine correctness - Recursive equational axiomatisations with precise semantics yet algorithm...
K. Stephenson