Modelling and Verification of Web Services Business Activity Protocol

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

doi:10.1007/978-3-642-19835-9_32

Cited by 18 publications

(5 citation statements)

References 9 publications

(20 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Also, there is the advantage of using one single software tool for performing Simulation and Formal verification tasks using the same developed models in timed automata. UPPAAL is a toolbox designed to verify systems that can be modeled as networks of automaton extended with integer variables, structured data types, defining functions, and channel synchronization [11].…”

Section: Hypothesis Consideredmentioning

confidence: 99%

Modeling and formal analysis of urban road traffic

Avram¹,

Machado²,

Aştilean³

2013

AIP Conference Proceedings

View full text Add to dashboard Cite

Modern life in cities leads to complex urban traffic road and, sometimes, to go from one point to another, in a city, is a hard and very complex task. The use of assisted systems for helping drivers on their task of reaching the desired destination is being common, mainly systems like GPS location systems or other similar systems. The main gap of those systems is that they are not able to assist drivers when some unexpected changes occur, like accidents, or another unexpected situations. In this context, it would be desirable to have a dynamic system to inform the drivers, about everything that is happening "online". This work is inserted in this context and the work presented here is one part of a bigger project that has, as main goal, to be a dynamic system for assisting drivers under hard conditions of urban road traffic. In this paper is modeled, and formally analyzed, the intersection of four street segments, in order to take some considerations about this subject. This paper presents the model of the considered system, using timed automata formalism. The validation and verification of the road traffic model it is realized using UPPAAL model-checker.

show abstract

Section: Hypothesis Consideredmentioning

confidence: 99%

Modeling and formal analysis of urban road traffic

Avram¹,

Machado²,

Aştilean³

2013

AIP Conference Proceedings

View full text Add to dashboard Cite

show abstract

“…In that case, storing messages in a certain order does not make sense, and bag buffers are an appropriate communication model. For this reason, many works have been dedicated to the study of systems communicating via bag buffers, see, e.g., [5][6][7][8]. Third, we study the stability results varying the equivalence semantics used for asynchronous composition comparison.…”

Section: Introductionmentioning

confidence: 99%

Automated verification of automata communicating via FIFO and bag buffers

Akroun

Salaün

2017

Form Methods Syst Des

View full text Add to dashboard Cite

This article presents new results for the automated verification of automata communicating asynchronously via FIFO or bag buffers. The analysis of such systems is possible by comparing bounded asynchronous compositions using equivalence checking. When the composition exhibits the same behavior for a specific buffer bound, the behavior remains the same for larger bounds. This enables one to check temporal properties on the system for that bound and this ensures that the system will preserve them whatever larger bounds are used for buffers. In this article, we present several decidability results and a semi-algorithm for this problem considering FIFO and bag buffers, respectively, as communication model. We also study various equivalence notions used for comparing the bounded asynchronous systems.

show abstract

“…Timed automata (TA) [31] are a general modeling framework for a wide range of real-time systems, such as in web services [32], audio/video protocols [33], bounded retransmission protocols [34], collision avoidance protocols [35,36] and commercial field bus protocols [37]. Timed safety automata (TSA) [38] are a simplified version of TA.…”

Section: Introductionmentioning

confidence: 99%

Scheduling of Event-Triggered Networked Control Systems using Timed Game Automata

Adzkiya¹,

Mazo²

2016

Preprint

View full text Add to dashboard Cite

We discuss the scheduling of a set of networked control systems implemented over a shared communication network. Each control loop is described by a linear-time-invariant (LTI) system with an event-triggered implementation. We assume the network can be used by at most one control loop at any time instant and after each controller update, a predefined channel occupancy time elapses before the network is available. In our framework we offer the scheduler two options to avoid conflicts: using the event-triggering mechanism, where the scheduler can choose the triggering coefficient; or forcing controller updates at an earlier pre-defined time. Our objective is avoiding communication conflict while guaranteeing stability of all control loops. We formulate the original scheduling problem as a control synthesis problem over a network of timed game automata (NTGA) with a safety objective. The NTGA is obtained by taking the parallel composition of the timed game automata (TGA) associated with the network and with all control loops. The construction of TGA associated with control loops leverages recent results on the abstraction of timing models of event-triggered LTI systems. In our problem, the safety objective is to avoid that update requests from a control loop happen while the network is in use by another task. We showcase the results in some examples.

show abstract

Modelling and Verification of Web Services Business Activity Protocol

Cited by 18 publications

References 9 publications

Modeling and formal analysis of urban road traffic

Modeling and formal analysis of urban road traffic

Automated verification of automata communicating via FIFO and bag buffers

Scheduling of Event-Triggered Networked Control Systems using Timed Game Automata

Contact Info

Product

Resources

About