Sciweavers

2050 search results - page 133 / 410
» A formal foundation for process modeling
Sort
View
TOPNOC
2008
15 years 6 months ago
TAPAs: A Tool for the Analysis of Process Algebras
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
Francesco Calzolai, Rocco De Nicola, Michele Loret...
GC
2004
Springer
16 years 10 days ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
AI
2004
Springer
15 years 6 months ago
A unifying semantics for time and events
We give a formal semantics for a highly expressive language for representing temporal relationships and events. This language, which we call Versatile Event Logic (VEL), provides ...
Brandon Bennett, Antony Galton
218
Voted
POPL
2012
ACM
14 years 2 months ago
A type theory for probability density functions
There has been great interest in creating probabilistic programming languages to simplify the coding of statistical tasks; however, there still does not exist a formal language th...
Sooraj Bhat, Ashish Agarwal, Richard W. Vuduc, Ale...
154
Voted
JLP
2006
56views more  JLP 2006»
15 years 7 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...