244 Hits in 6.4 sec

Saturated LTSs for Adhesive Rewriting Systems [chapter]

Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale, Ugo Montanari
2010 Lecture Notes in Computer Science  
Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS.  ...  G-Reactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules.  ...  Similarly, the GIPO semantics is often unsatisfactory: as proved e.g. for mobile ambients in [7] , a suitable notion of saturated (and barbed) GRS has to be taken into account.  ... 
doi:10.1007/978-3-642-15928-2_9 fatcat:pxbiqrbhwngmhl7deceygzujey

Synthesising CCS bisimulation using graph rewriting

Filippo Bonchi, Fabio Gadducci, Barbara König
2009 Information and Computation  
The key technical point is the use of the borrowed context (bc) technique [13] as a tool to equip graph transformation in the dpo style with an lts semantics.  ...  Thus, a "well-behaved" lts represents a fundamental step towards a compositional semantics of the computational device.  ...  such a calculus an already established semantics does exist, differently from the current situation for mobile ambients, as reported in [6] .  ... 
doi:10.1016/j.ic.2008.10.005 fatcat:5sz5sgodpfb6lojlwaswsnawo4

On Barbs and Labels in Reactive Systems

Filippo Bonchi, Fabio Gadducci, Giacoma Valentina Monreale
2010 Electronic Proceedings in Theoretical Computer Science  
In order to provide a suitable test-bed, we instantiate our proposal by addressing the semantics of (asynchronous) CCS and of the calculus of mobile ambients.  ...  RSs proved a flexible specification device, yet so far most of the efforts dealing with their behavioural semantics focused on idem pushouts (IPOs) and saturated (also known as dynamic) bisimulations.  ...  We are indebted to the anonymous referees for their useful remarks, which helped us in improving the overall presentation of the paper.  ... 
doi:10.4204/eptcs.18.4 fatcat:gjhnh7xvc5futnlgvwf4inn3km

Components as Location Graphs [chapter]

Jean-Bernard Stefani
2015 Lecture Notes in Computer Science  
A key aspect of the framework is its ability to model nested locations with sharing, while allowing the dynamic reconfiguration of the location graph, and the dynamic update of located processes.  ...  In this paper, we introduce a model of computation, called G-Kells, which meets these requirements. We develop our model at a more concrete  ...  Ackowledgements Damien Pous suggested the move to an early style semantics. The paper was much improved thanks to comments by Ivan Lanese on earlier versions.  ... 
doi:10.1007/978-3-319-15317-9_1 fatcat:t724yiw3qrhx5kqnlsy2f3q3nu

Process Algebras [chapter]

Bruce Leasure, David J. Kuck, Sergei Gorlatch, Murray Cole, Gregory R. Watson, Alain Darte, David Padua, Utpal Banerjee, Olaf Schenk, Klaus Gärtner, David Padua, Howard Jay Siegel (+43 others)
2011 Encyclopedia of Parallel Computing  
DEFINITION: Process Algebras are mathematically rigorous languages with well defined semantics that permit describing and verifying properties of concurrent communicating systems.  ...  They can be seen as models of processes, regarded as agents that act and interact continuously with other similar agents and with their common environment.  ...  To denote the LTS associated to a generic CSP or ACP process p via the operational semantics, the notation LTS(p) will be used.  ... 
doi:10.1007/978-0-387-09766-4_450 fatcat:w3fdmomk3jdgbhojpspho2wpam

Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes [chapter]

Fabio Gadducci, Ugo Montanari
2005 Lecture Notes in Computer Science  
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility.  ...  Ranked graphs are naturally equipped with a few algebraic operations, and they are proved to form a suitable (bi)category of cospans.  ...  In a recent series of papers the authors pursed instead the use of standard tools from graph transformation theory for modelling a large class of these calculi, ranging from mobile ambients to fusion  ... 
doi:10.1007/11601548_9 fatcat:xyfyjghwf5cddi7esthteuui5y

Page 1292 of Mathematical Reviews Vol. , Issue 2003B [page]

2003 Mathematical Reviews  
Contents: GianLuigi Ferrari, Ugo Montanari and Emilio Tu- osto, A LTS semantics of ambients via graph synchronization with mobility (1-16); Fabio Alessi, Mariangiola Dezani-Ciancaglini and Furio Honsell  ...  size of one-way quantum finite automata (123-135); Daniela Besozzi, Claudio Zandron, Giancarlo Mauri and Nico- letta Sabadini, P systems with gemmation of mobile membranes (136-153); Giuseppe Prencipe  ... 

Deriving Barbed Bisimulations for Bigraphical Reactive Systems

Davide Grohmann, Marino Miculan
2009 Electronic Communications of the EASST  
As examples, we apply this construction to the (bigraphical representation of the) pi-calculus and of Mobile Ambients, and compare the resulting barbed equivalences with those previously known for these  ...  We study the definition of a general abstract notion of barbed bisimilarity for reactive systems on bigraphs.  ...  notion of barb for Mobile Ambients.  ... 
doi:10.14279/tuj.eceasst.16.254 dblp:journals/eceasst/GrohmannM08a fatcat:mcv33rgmordu3la7npwtxdldqm

AGILE: Software Architecture for Mobility [chapter]

L. Andrade, P. Baldan, H. Baumeister, R. Bruni, A. Corradini, R. De Nicola, J. L. Fiadeiro, F. Gadducci, S. Gnesi, P. Hoffman, N. Koch, P. Kosiuczenko (+13 others)
2003 Lecture Notes in Computer Science  
Architecture-based approaches have been promoted as a means of controlling the complexity of system construction and evolution, in particular for providing systems with the agility required to operate  ...  The whole approach is developed over a uniform mathematical framework based on graph-oriented techniques that support sound methodological principles, formal analysis, and refinement.  ...  The formal semantic of µACTL + is given over bi-labelled transition systems. Informally, a formula is true on an LTS, if the sequence of actions of the LTS verifies what the formula states.  ... 
doi:10.1007/978-3-540-40020-2_1 fatcat:jr5fv3qymffafdvhmab3ss4dmi

The Seal Calculus

G. Castagna, J. Vitek, F. Zappa Nardelli
2005 Information and Computation  
The Calculus extends a π-calculus core with synchronous, objective mobility of agents over channels. This paper systematically compares all previous variants of Seal Calculus.  ...  The type systems thus enforce a discipline of agent mobility, since the latter is coded in terms of higher-order communication.  ...  This work was partially supported by the European FET contract MyThS , IST-2001-32617 and NSF under grant CCR-0093282 "CAREER: Foundations and Implementation of Mobile Object Systems" and CCR-0209083 "  ... 
doi:10.1016/j.ic.2004.11.005 fatcat:7jd3vg6klzbvxpnyt5224wkgwm

Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming [article]

Ivan Lanese, Ugo Montanari
2006 arXiv   pre-print
In particular we analyze the relationships between a process calculus, the Fusion Calculus, graph transformations in the Synchronized Hyperedge Replacement with Hoare synchronization (HSHR) approach and  ...  The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.  ...  A LTS semantics of ambients via graph synchronization with mobility. In Proc. of ICTCS'01. LNCS, vol. 2202. Springer, 1-16. Gardner, P. and Wischik, L. 2000. Explicit fusions.  ... 
arXiv:cs/0504050v2 fatcat:dvur3qrpyjbn3cyvs56ehkuxvi

A Complete Temporal and Spatial Logic for Distributed Systems [chapter]

Dirk Pattinson, Bernhard Reus
2005 Lecture Notes in Computer Science  
Our main technical contribution is completeness of the logic both with respect to spatial/temporal structures and a class of spatial transition systems.  ...  The logic is a combination of an extension of hybrid logic, that allows us to reason about the spatial structure of a computation, and linear temporal logic, which accounts for the temporal aspects.  ...  participate in a synchronous transition, labelled with = τ .  ... 
doi:10.1007/11559306_7 fatcat:jtcnl6cffnhqrejazcm4uetflm

Towards a Calculus For Wireless Systems

Nicola Mezzetti, Davide Sangiorgi
2006 Electronical Notes in Theoretical Computer Science  
A major goal of the semantics is to describe the forms of interferences among the activities of processes that are peculiar of wireless systems.  ...  We first consider a core calculus, essentially with only the primitives for communication, and then a few extensions.  ...  However, sometimes the rules of the LTS can be hard to understand. This happens, for instance, in calculi for mobility such as the π-calculus or in higher-order calculi such as Ambients.  ... 
doi:10.1016/j.entcs.2006.04.017 fatcat:uim2tdaffvfizanj374vacut7m

An Observational Theory for Mobile Ad Hoc Networks

Massimo Merro
2007 Electronical Notes in Theoretical Computer Science  
We propose a process calculus to study the observational theory of Mobile Ad Hoc Networks.  ...  The operational semantics of our calculus is given both in terms of a Reduction Semantics and in terms of a Labelled Transition Semantics. We prove that the two semantics coincide.  ...  Acknowledgements Many thanks to Davide Sangiorgi for insightful comments on a early draft. I also thank Davide Quaglia for useful discussions on MANETs.  ... 
doi:10.1016/j.entcs.2007.02.039 fatcat:4mqe42ixjvhwrnzygwwbyi4blu

A Semantic Theory of the Internet of Things [article]

Valentina Castiglioni, Ruggero Lanotte, Massimo Merro
2016 arXiv   pre-print
The calculus is equipped with a standard notion of bisimilarity which is a fully abstract characterisation of a well-known contextual equivalence.  ...  Our systems interact both with the physical environment, via sensors and actuators, and with smart devices, via short-range and Internet channels.  ...  Our calculus is equipped with two labelled transition semantics (LTS) in the SOS style of Plotkin [31] : an intensional semantics and an extensional semantics.  ... 
arXiv:1510.04854v3 fatcat:tknvwi2iencgfm2z2l46qrbvpa
« Previous Showing results 1 — 15 out of 244 results