Sciweavers

5 search results - page 1 / 1
» Strong Bisimulation for the Explicit Fusion Calculus
Sort
View
FOSSACS
2004
Springer
13 years 10 months ago
Strong Bisimulation for the Explicit Fusion Calculus
The pi calculus holds the promise of compile-time checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulati...
Lucian Wischik, Philippa Gardner
MFCS
2000
Springer
13 years 8 months ago
Explicit Fusions
We introduce explicit fusions of names. To `fuse' two names is to declare that they may be used interchangeably. An explicit fusion is one that can exist in parallel with som...
Philippa Gardner, Lucian Wischik
JLP
2007
130views more  JLP 2007»
13 years 4 months ago
A compositional coalgebraic model of fusion calculus
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...
Maria Grazia Buscemi, Ugo Montanari
ESOP
2008
Springer
13 years 6 months ago
Open Bisimulation for the Concurrent Constraint Pi-Calculus
Abstract. The concurrent constraint pi-calculus (cc-pi-calculus) has been introduced as a model for concluding Service Level Agreements. The cc-pi calculus combines the synchronous...
Maria Grazia Buscemi, Ugo Montanari
FORTE
2008
13 years 6 months ago
Checking Correctness of Transactional Behaviors
Abstract. The Signal Calculus is an asynchronous process calculus featuring multicast communication. It relies on explicit modeling of the communication structure of the network (c...
Vincenzo Ciancia, Gian Luigi Ferrari, Roberto Guan...