Sciweavers

ICFEM
2009
Springer
14 years 6 months ago
Approximate Model Checking of PCTL Involving Unbounded Path Properties
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
Samik Basu, Arka P. Ghosh, Ru He
ICFEM
2009
Springer
14 years 6 months ago
Modeling and Analysis of Thread-Pools in an Industrial Communication Platform
Thread pools are often used as a pattern to increase the throughput and responsiveness of software systems. Implementations of thread pools may differ considerably from each other...
Frank S. de Boer, Immo Grabe, Mohammad Mahdi Jagho...
FSEN
2009
Springer
14 years 6 months ago
A Process-Theoretic Look at Automata
Automata theory presents roughly three types of automata: finite automata, pushdown automata and Turing machines. The automata are treated as language acceptors, and the expressiv...
Jos C. M. Baeten, Pieter J. L. Cuijpers, Bas Lutti...
FSEN
2009
Springer
14 years 6 months ago
The Interplay between Relationships, Roles and Objects
In this paper we study the interconnection between relationships and roles. We start from the patterns used to introduce relationships in object oriented languages. We show how th...
Matteo Baldoni, Guido Boella, Leendert van der Tor...
FSEN
2009
Springer
14 years 6 months ago
Evolution Control in MDE Projects: Controlling Model and Code Co-evolution
The dream of Model Driven Engineering (MDE) is that Software Engineering activities should be performed only on models, but in practice a significant amount of programming is still...
Jacky Estublier, Thomas Leveque, Germán Veg...
FSEN
2009
Springer
14 years 6 months ago
Automated Translation and Analysis of a ToolBus Script for Auctions
Abstract. ToolBus allows to connect tools via a software bus. Programming is done using the scripting language Tscript, which is based on the process algebra ACP. In previous work ...
Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. ...
FSEN
2009
Springer
14 years 6 months ago
Equational Reasoning on Ad Hoc Networks
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
Fatemeh Ghassemi, Wan Fokkink, Ali Movaghar
FSEN
2009
Springer
14 years 6 months ago
A Timed Calculus for Wireless Systems
We propose a timed process calculus for wireless systems exposed to communication collisions. The operational semantics of our calculus is given in terms of a labelled transition ...
Massimo Merro, Eleonora Sibilio
FSEN
2009
Springer
14 years 6 months ago
Termination in Higher-Order Concurrent Calculi
Abstract. We study termination of programs in concurrent higherorder languages. A higher-order concurrent calculus combines features of the λ-calculus and of the message-passing c...
Romain Demangeon, Daniel Hirschkoff, Davide Sangio...