Sciweavers

127 search results - page 16 / 26
» Behaviour Algebras
Sort
View
ESAW
2006
Springer
13 years 11 months ago
Using Constraints and Process Algebra for Specification of First-Class Agent Interaction Protocols
Abstract. Current approaches to multi-agent interaction involve specifying protocols as sets of possible interactions, and hard-coding decision mechanisms into agent programs in or...
Tim Miller, Peter McBurney
TCS
2008
13 years 7 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
ENTCS
2008
99views more  ENTCS 2008»
13 years 7 months ago
A Categorical Model of the Fusion Calculus
We provide a categorical presentation of the Fusion calculus. Working in a suitable category of presheaves, we describe the syntax as initial algebra of a signature endofunctor, a...
Marino Miculan
FORTE
2007
13 years 8 months ago
Transactional Reduction of Component Compositions
Behavioural protocols are beneficial to Component-Based Software Engineering and Service-Oriented Computing as they foster automatic procedures for discovery, composition, composi...
Serge Haddad, Pascal Poizat