Oris: a tool for modeling, verification and evaluation of real-time systems
Oris is a tool for qualitative verification and quantitative evaluation of reactive timed systems,
which supports modeling and analysis of various classes of timed extensions of Petri Nets …
which supports modeling and analysis of various classes of timed extensions of Petri Nets …
Time Petri nets with inhibitor hyperarcs. Formal semantics and state space computation
In this paper, we define Time Petri Nets with Inhibitor Hyperarcs (IHTPN) as an extension of
T-time Petri nets where time is associated with transitions. In this model, we consider …
T-time Petri nets where time is associated with transitions. In this model, we consider …
A Petri net approach for the design and analysis of Web Services Choreographies
A Web Service is a self-describing, self-contained modular application that can be
published, located, and invoked over a network, eg the Internet. Web Services composition …
published, located, and invoked over a network, eg the Internet. Web Services composition …
Compositional verification for hierarchical scheduling of real-time systems
L Carnevali, A Pinzuti, E Vicario - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
Hierarchical Scheduling (HS) techniques achieve resource partitioning among a set of real-
time applications, providing reduction of complexity, confinement of failure modes, and …
time applications, providing reduction of complexity, confinement of failure modes, and …
Formal verification of real-time systems with preemptive scheduling
In this paper, we propose a method for the verification of timed properties for real-time
systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time …
systems featuring a preemptive scheduling policy: the system, modeled as a scheduling time …
Correctness verification and performance analysis of real-time systems using stochastic preemptive time Petri nets
Time Petri nets describe the state of a timed system through a marking and a set of clocks. If
clocks take values in a dense domain, state space analysis must rely on equivalence …
clocks take values in a dense domain, state space analysis must rely on equivalence …
SMT-based bounded schedulability analysis of the clock constraint specification language
Abstract The Clock Constraint Specification Language (ccsl) is a formalism for specifying
logical-time constraints on events for the design of real-time embedded systems. A central …
logical-time constraints on events for the design of real-time embedded systems. A central …
Schedulability analysis with CCSL specifications
L Yin, J Liu, Z Ding, F Mallet… - 2013 20th Asia-Pacific …, 2013 - ieeexplore.ieee.org
The Clock Constraint Specification Language (CCSL) is a formal polychronous language
based on the notion of logical clock. It defines a set of kernel constraints that can represent …
based on the notion of logical clock. It defines a set of kernel constraints that can represent …
Schedulability analysis of distributed multicore avionics systems with uppaal
This paper presents an approach for schedulability analysis of Distributed Integrated
Modular Avionics (DIMA) systems that consist of spatially distributed ARINC-653 multicore …
Modular Avionics (DIMA) systems that consist of spatially distributed ARINC-653 multicore …
Combining UML-MARTE and preemptive time Petri nets: An industrial case study
I Bicchierai, G Bucci, L Carnevali… - IEEE Transactions on …, 2012 - ieeexplore.ieee.org
We present an approach for integration of formal methods within an industrial SW process,
illustrating results obtained in a real scenario subject to Military Standard 498 (MIL-STD …
illustrating results obtained in a real scenario subject to Military Standard 498 (MIL-STD …