Sciweavers

1788 search results - page 92 / 358
» Model Theory for Process Algebra
Sort
View
FSTTCS
2003
Springer
15 years 11 months ago
Reachability Analysis of Process Rewrite Systems
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
Ahmed Bouajjani, Tayssir Touili
JSYML
2010
107views more  JSYML 2010»
15 years 4 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
ZUM
2000
Springer
107views Formal Methods» more  ZUM 2000»
15 years 9 months ago
How to Drive a B Machine
The B-Method is a state-based formal method that describes behaviour in terms of MACHINES whose states change under OPERATIONS. The process algebra CSP is an event-based formalism ...
Helen Treharne, Steve Schneider
IADIS
2004
15 years 7 months ago
A CSP based ontology for a smart home
This paper addresses the problem of establishing collaboration between devices in a home environment, even when no previous knowledge is known or stored on the devices. It focuses...
José Ignacio Rendo Fernández, Iain W...
ERSHOV
2006
Springer
15 years 10 months ago
Information-Flow Attacks Based on Limited Observations
Abstract. Two formal models for description of timing attacks are presented, studied and compared with other security concepts. The models are based on a timed process algebra and ...
Damas P. Gruska