We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from...
详细信息
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the capability open has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the name-convergence problem as well as the model-checking problem rum out to be unclecidable for boththe original and the weaker reduction relation. (c) 2004 Elsevier B.V. All rights reserved.
Structural congruences have been used to define the semantics and to capture inherent properties of language constructs. they have been used as an addendum to transition system specifications in Plotkin's style of...
详细信息
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from...
详细信息
ISBN:
(纸本)3540008977
We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the capability open has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the name-convergence problem as well as the model-checking problem rum out to be unclecidable for boththe original and the weaker reduction relation. (c) 2004 Elsevier B.V. All rights reserved.
In this paper, we prove decidability of the optimal conditional reachability problem for multi-priced timed automata, an extension of timed automata with multiple cost variables evolving according to given rates for e...
详细信息
the general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computationstructures. this, of course, should be taken in conjunction w...
详细信息
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category χ. the prepositional logic used to reason about stat...
详细信息
the proceedings contain 27 papers. the special focus in this conference is on foundations of softwarescience and computationstructures. the topics include: A game semantics for generic polymorphism;categories of con...
ISBN:
(纸本)3540008977
the proceedings contain 27 papers. the special focus in this conference is on foundations of softwarescience and computationstructures. the topics include: A game semantics for generic polymorphism;categories of containers;verification of probabilistic systems with faulty communication;generalized iteration and coiteration for higher-order nested datatypes;parameterized verification by probabilistic abstraction;model checking lossy channels systems is probably decidable;verification of cryptographic protocols;a normalisation result for higher-order calculi with explicit substitutions;when ambients cannot be opened;an intrinsic characterization of approximate probabilistic bisimilarity;manipulating trees with hidden labels;the converse of a stochastic relation;type assignment for intersections and unions in call-by-value languages;cones and foci for protocol verification revisited;towards a behavioural theory of access and mobility control in distributed systems;the two-variable guarded fragment with transitive guards is 2EXPTIME-hard;a game semantics of linearly used continuations;counting and equality constraints for multitree automata;compositional circular assume-guarantee rules cannot be sound and complete;a monadic multi-stage metalanguage;multi-level meta-reasoning with higher-order abstract syntax;abstraction in reasoning about higraph-based systems and deriving bisimulation congruences.
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readiness equivalence and no finer than possi...
详细信息
ISBN:
(纸本)3540212981
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readiness equivalence and no finer than possible worlds equivalence does not have a finite basis. this semantic range includes ready trace equivalence.
暂无评论