Results 1 
9 of
9
Efficiency of asynchronous systems, read arcs, and the MUTEXproblem
 TCS
, 1997
"... Two solutions to the MUTEXproblem are compared w.r.t. their temporal efficiency. For this, a formerly developed efficiency testing for asynchronous systems is adapted to Petri nets with socalled read arcs. Furthermore, a compositional semantics for fair behaviour (in the sense of the progress assu ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Two solutions to the MUTEXproblem are compared w.r.t. their temporal efficiency. For this, a formerly developed efficiency testing for asynchronous systems is adapted to Petri nets with socalled read arcs. Furthermore, a compositional semantics for fair behaviour (in the sense of the progress assumption) is presented. On the one hand, this semantics is related to efficiency testing; on the other hand, it is used to specify formally what a solution to the MUTEXproblem is. It is shown that one of our solutions indeed satisfies this specification and that ordinary nets without read arcs cannot solve the MUTEXproblem.
Constructing specific SOS semantics for concurrency via abstract interpretation (Extended Abstract)
"... Chiara Bodei 1 , Pierpaolo Degano, 1 Corrado Priami 2 1 Dipartimento di Informatica, Universit`a di Pisa Corso Italia 40, I56100 Pisa, Italy fchiara,deganog@di.unipi.it 2 Istituto Policattedra, Universit`a di Verona Ca' Vignal 2, Strada Le Grazie 1, I37134 Verona, Italy priami@sci.u ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Chiara Bodei 1 , Pierpaolo Degano, 1 Corrado Priami 2 1 Dipartimento di Informatica, Universit`a di Pisa Corso Italia 40, I56100 Pisa, Italy fchiara,deganog@di.unipi.it 2 Istituto Policattedra, Universit`a di Verona Ca' Vignal 2, Strada Le Grazie 1, I37134 Verona, Italy priami@sci.univr.it Abstract. Most of the SOS semantics for concurrent systems can be derived by abstracting on the inference rules of a concrete transition system, namely the proved transition system. Besides the standard interleaving semantics we mechanically derive the causal transition system for CCS, whose definition is particularly difficult and paradigmatic. Its rules are shown to coincide with those presented in the literature. Also, the tree of its computations coincide with that obtained by abstracting the computations of the proved transition system. Keywords. Concurrency, abstract interpretation, SOS semantics, causality, noninterleaving descriptions. 1 Introduction We apply the theory of abst...
Infinite Computation, Coinduction and Computational Logic
"... Abstract. We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ωautomata, model checking, verification, nonmonotonic reasoning, developing SAT solvers, etc. We also discuss future research directions. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ωautomata, model checking, verification, nonmonotonic reasoning, developing SAT solvers, etc. We also discuss future research directions. 1
Stochastic Analysis of Mobile Telephony Networks
, 1997
"... We show here that a stochastic extension of ßcalculus allows us to derive performance measures of systems specified in the original formalism with very little efforts. We apply our extension to a mobile telephone network as described in [26] to carry out performance and reliability analysis. The pa ..."
Abstract
 Add to MetaCart
(Show Context)
We show here that a stochastic extension of ßcalculus allows us to derive performance measures of systems specified in the original formalism with very little efforts. We apply our extension to a mobile telephone network as described in [26] to carry out performance and reliability analysis. The paper is a case study that aims at showing how a general labelling of transitions can be used to define the kernel of an integrated programming environment for distributed systems. Furthermore, evidence is given that the theory of stochastic process algebras smoothly scales up to more powerful formalisms like ßcalculus which inherently encodes mobility issues. 1 Introduction The need of formal methods in developing complex systems, especially when failures may cause loss of human life, environmental damage or financial loss, is becoming well accepted. This necessity is even more urgent when planning and implementing distributed systems. In fact, they require a huge amount of detail to be tak...
Timed ΠCalculus
"... Abstract. We extend πcalculus with real time (timed πcalculus) and give an operational semantics for it. We present the outline of an implementation based on coinduction, coroutining, and constraint logic programming over reals of this operational semantics. We show how timed πcalculus can be us ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We extend πcalculus with real time (timed πcalculus) and give an operational semantics for it. We present the outline of an implementation based on coinduction, coroutining, and constraint logic programming over reals of this operational semantics. We show how timed πcalculus can be used for modeling and verifying realtime and cyberphysical systems. We illustrate our work by applying it to modeling of practical problems such as the Generalized Railroad Crossing problem. Keywords: πcalculus, Logic Programming, CLP(R), Coinduction, Coroutining 1
ISSN Timed Distributed picalculus by
, 2006
"... Approved for public release; further dissemination unlimited. ..."
(Show Context)
biological processes
"... This paper introduces a language that extends the distributed picalculus of [7] with time like in [3,4]. This new language, that we call TDpi, is a good tool for describing realtime systems. An example is the interactions in a molecular network, where molecules are separated located processes. Thi ..."
Abstract
 Add to MetaCart
(Show Context)
This paper introduces a language that extends the distributed picalculus of [7] with time like in [3,4]. This new language, that we call TDpi, is a good tool for describing realtime systems. An example is the interactions in a molecular network, where molecules are separated located processes. This kind of systems are under the constraints o time and have limited communication and restricted resource access. A simplified example with antigens and citotoxic molecules will be presented.