Sciweavers

7943 search results - page 49 / 1589
» A calculus for costed computations
Sort
View
FOSSACS
2009
Springer
15 years 4 months ago
Normal Bisimulations in Calculi with Passivation
Behavioral theory for higher-order process calculi is less well developed than for first-order ones such as the π-calculus. In particular, effective coinductive characterization...
Sergueï Lenglet, Alan Schmitt, Jean-Bernard S...
LICS
2008
IEEE
15 years 4 months ago
On the Expressiveness and Decidability of Higher-Order Process Calculi
In higher-order process calculi the values exchanged in communications may contain processes. A core calculus of higher-order concurrency is studied; it has only the operators nec...
Ivan Lanese, Jorge A. Pérez, Davide Sangior...
CONCUR
2003
Springer
15 years 3 months ago
Linear Forwarders
A linear forwarder is a process which receives one message on a channel and sends it on a different channel. Such a process allows for a simple implementation of the asynchronous...
Philippa Gardner, Cosimo Laneve, Lucian Wischik
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
15 years 1 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
FOSSACS
2009
Springer
15 years 4 months ago
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
Parosh Aziz Abdulla, Richard Mayr