484 research outputs found
A Polynomial Translation of pi-calculus FCPs to Safe Petri Nets
We develop a polynomial translation from finite control pi-calculus processes
to safe low-level Petri nets. To our knowledge, this is the first such
translation. It is natural in that there is a close correspondence between the
control flows, enjoys a bisimulation result, and is suitable for practical
model checking.Comment: To appear in special issue on best papers of CONCUR'12 of Logical
Methods in Computer Scienc
Formal verification: further complexity issues and applications
Prof. Giacomo Cioffi (Universitàdi Roma "La Sapienza"), Prof. Fabio Panzieri (Universitàdi Bologna), Dott.ssa Carla Limongelli (Universitàdi Roma Tre)
Affine Data-Flow Graphs for the Synthesis of Hard Real-Time Applications
International audienceData-flow models ease the task of constructing feasible schedules of computations and communications of high-assurance embedded applications. One key and open issue is how to schedule data-flow graphs so as to minimize the buffering of data and reduce end-to-end latency. Most of the proposed techniques in that respect are based on either static or data-driven scheduling. This paper looks at the problem in a different way by considering priority-driven preemptive scheduling theory of periodic tasks to execute a data-flow program. Our approach to the problem can be detailed as follows. (1) We propose a model of computation in which the activation clocks of actors are related by affine functions. The affine relations describe the symbolic scheduling constraints of the data-flow graph. (2) Based on this framework, we present an algorithm that computes affine schedules in a way that minimizes buffering requirements and, in addition, guarantees the absence of overflow and underflow exceptions over communication channels. (3) Depending on the chosen scheduling policy (earliest-deadline first or rate-monotonic), we concretize the symbolic schedule by defining the period and the phase of each actor. This concretization guarantees schedulability and maximizes the processor utilization factor
TTSS'11 - 5th International Workshop on Harnessing Theories for Tool Support in Software
The aim of the workshop is to bring together practitioners and researchers from academia, industry and government to present and discuss ideas about:
• How to deal with the complexity of software projects by multi-view modeling and separation of concerns about the design of functionality, interaction, concurrency, scheduling, and nonfunctional requirements, and
• How to ensure correctness and dependability of software by integrating formal methods and tools for modeling, design, verification and validation into design and development processes and environments.
• Case studies and experience reports about harnessing static analysis tools such as model checking, theorem proving, testing, as well as runtime monitoring
Model-Based Robot Control and Multiprocessor Implementation
Model-based control of robot manipulators has been gaining momentum in recent years. Unfortunately there are very few experimental validations to accompany simulation results and as such majority of conclusions drawn lack the credibility associated with the real control implementation
Energy efficient wireless sensor network protocols for monitoring and prognostics of large scale systems
In this work, energy-efficient protocols for wireless sensor networks (WSN) with applications to prognostics are investigated. Both analytical methods and verification are shown for the proposed methods via either hardware experiments or simulation. This work is presented in five papers. Energy-efficiency methods for WSN include distributed algorithms for i) optimal routing, ii) adaptive scheduling, iii) adaptive transmission power and data-rate control --Abstract, page iv
- …