Model-checking web services business activity protocols

Marques, Abinoam P.; Ravn, Anders P.; Srba, Jǐŕı; Vighio, Saleem

doi:10.1007/s10009-012-0231-4

Cited by 9 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the second case study we verify the correctness of one of the web services coordination protocols called Business Activity with Participant Completion (BAwPC) [19]. Our model is based on the work presented in [17] where an enhanced protocol that avoids reaching any invalid states is given. We modelled the protocol in TAPAAL and considered asynchronous communication where messages can be lost; the model is scaled by the number of extra messages that can be used for retransmissions.…”

Section: Methodsmentioning

confidence: 99%

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

David¹,

Jacobsen²,

Jacobsen³

et al. 2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Timed-arc Petri nets (TAPN) are a well-known time extension of the Petri net model and several translations to networks of timed automata have been proposed for this model. We present a direct, DBM-based algorithm for forward reachability analysis of bounded TAPNs extended with transport arcs, inhibitor arcs and age invariants. We also give a complete proof of its correctness, including reduction techniques based on symmetries and extrapolation. Finally, we augment the algorithm with a novel state-space reduction technique introducing a monotonic ordering on markings and prove its soundness even in the presence of monotonicity-breaking features like age invariants and inhibitor arcs. We implement the algorithm within the model-checker TAPAAL and the experimental results document an encouraging performance compared to verification approaches that translate TAPN models to UPPAAL timed automata

show abstract

Section: Methodsmentioning

confidence: 99%

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

David¹,

Jacobsen²,

Jacobsen³

et al. 2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…We discuss the case studies of Patient Monitoring System (PMS) [7] where the patient's pulse rate and oxygen saturation level is monitored and abnormal situations should be detected within given deadlines (constants scaled up to 250 seconds), Business Activity with Participant Completion (BAwPC) [20]-a webservice protocol from WS-BA where we verify its safety (avoidance of invalid states) using the fact that the original protocol is flawed while its enhanced variant is safe [20], Train Level Crossing (TLC)-a standard benchmark case study where trains are crossing a road and traffic lights should be controlled correctly, Producer and Consumer Synchronization (PCS)-our running example scaled by introducing more producers and consumers and Plate Spinning Problem (PSP) [22] where jugglers try to keep a number of plates spinning indefinitely. The greatest common divisor in all models is 1.…”

Section: Discussionmentioning

confidence: 99%

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Birch

Jacobsen

Jensen

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. State-space explosion is a major obstacle in verification of time-critical distributed systems. An important factor with a negative influence on the tractability of the analysis is the size of constants that clocks are compared to. This problem is particularly accented in explicit state-space exploration techniques. We suggest an approximation method for reducing the size of constants present in the model. The proposed method is developed for Timed-Arc Petri Nets and creates an under-approximation or an over-approximation of the model behaviour. The verification of approximated Petri net models can be considerably faster but it does not in general guarantee conclusive answers. We implement the algorithms within the open-source model checker TAPAAL and demonstrate on a number of experiments that our approximation techniques often result in a significant speed-up of the verification.

show abstract

“…We report on four case studies of Alternating Bit Protocol [13] (ABP), Business Activity with Participant Completion [11] (BAwPC), Patient Monitoring System [6] (PMS) and MPEG-2 video encoder [14]. The reachability queries for all models require a complete state-space search.…”

Section: Methodsmentioning

confidence: 99%

Memory Efficient Data Structures for Explicit Verification of Timed Systems

Jensen

Larsen

Srba

et al. 2014

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Timed analysis of real-time systems can be performed using continuous (symbolic) or discrete (explicit) techniques. The explicit state-space exploration can be considerably faster for models with moderately small constants, however, at the expense of high memory consumption. In the setting of timed-arc Petri nets, we explore new data structures for lowering the used memory: PTries for efficient storing of configurations and time darts for semi-symbolic description of the statespace. Both methods are implemented as a part of the tool TAPAAL and the experiments document at least one order of magnitude of memory savings while preserving comparable verification times.

show abstract

Model-checking web services business activity protocols

Cited by 9 publications

References 11 publications

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

A Forward Reachability Algorithm for Bounded Timed-Arc Petri Nets

Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets

Memory Efficient Data Structures for Explicit Verification of Timed Systems

Contact Info

Product

Resources

About