Abstract : We present a real-time extension to the π-calculus and use it to study a notion of time-bounded equivalence. We introduce the notion of timed compositionality and the associated timed congruence which are useful to reason about the timed behaviour of processes under hard constraints. In addition to this meta-theory we develop an abstract machine for our calculus based on event-scheduling and establish its soundness w.r.t. the given operational semantics. We have built an implementation for a realistic language called kiltera based on this machine.
Type de document :
Communication dans un congrès
John Hatcliff; Elena Zucca. Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2010, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-6117, pp.125-139, 2010, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-13464-7_11〉
https://hal.inria.fr/hal-01055159
Contributeur : Hal Ifip
<>
Soumis le : lundi 11 août 2014 - 16:34:36
Dernière modification le : vendredi 11 août 2017 - 16:16:28
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 22:16:08
Ernesto Posse, Juergen Dingel. Theory and Implementation of a Real-Time Extension to the π-Calculus. John Hatcliff; Elena Zucca. Joint 12th IFIP WG 6.1 International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS) / 30th IFIP WG 6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2010, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-6117, pp.125-139, 2010, Formal Techniques for Distributed Systems. 〈10.1007/978-3-642-13464-7_11〉. 〈hal-01055159〉
