Modelling medium access control in IEEE 802.15.4 nonbeacon-enabled networks with probabilistic timed automataTatjana Kapus
, original scientific article
Abstract: This paper concerns the formal modelling of medium access control in nonbeacon-enabled IEEE 802.15.4 wireless personal area networks with probabilistic timed automata supported by the PRISM probabilistic model checker. In these networks, the devices contend for the medium by executing an unslotted carrier sense multiple access with collision avoidance algorithm. In the literature, a model of a network which consists of two stations sending data to two different destination stations is introduced. We have improved this model and, based on it, we propose two ways of modelling a network with an arbitrary number of sending stations, each having its own destination. We show that the same models are valid representations of a star-shaped network with an arbitrary number of stations which send data to the same destination station. We also propose how to model such a network if some of the sending stations are not within radio range of the others, i.e. if they are hidden. We present some results obtained for these models by probabilistic model checking using PRISM.
Keywords: wireless personal area network, medium access control, hidden station, formal specification, probabilistic model checking
Published: 15.06.2017; Views: 585; Downloads: 273
Full text (2,25 MB)
This document has many files! More...
Student CD-ROM to accompany Principles of finance, 2eScott Besley
, Eugene F. Brigham
Keywords: CD-ROM, compact disc, computer application, finance, theory, enterprises, business finance, fundamental analysis, valuation, corporations, decision making, business decision-making, financial market, investment banks, banking systems, money, cash flows, interest rate, taxes, financial statements, end checking, financial planning, income, return on equity, capital, costs, budgeting, dividends, working capital, productions means, investments, investment decision-making, textbooks
Published: 02.06.2012; Views: 1474; Downloads: 30
Link to full text
ACTLW - an action-based computation tree logic with unless operatorRobert Meolic
, Tatjana Kapus
, Zmago Brezočnik
, 2008, original scientific article
Abstract: Model checkers for systems represented by labelled transition systems are not as extensively used as those for systems represented by Kripke structures. This is partially due to the lack of an elegant formal language for property specification which would not be as raw as, for example, HML yet also not as complex as, for example, -calculus. This paper proposes a new action-based propositional branching-time temporal logic ACTLW, which enhances popular computation tree logic (CTL) with the notion of actions in a similar but more comprehensive way than action-based CTL introduced by De Nicola and Vaandrager [R. De Nicola, F.W. Vaandrager, Action versus logics for transition systems, in: Semantics of Systems of Concurrent Processes, Proceedings LITP Spring School on Theoretical Computer Science, LNCS 469, 1990, pp. 407-419]. ACTLW is defined by using temporal operators until and unless only, whereas all other temporal operators are derived from them. Fixed-point characterisation of the operators together with symbolic algorithms for globalmodel checking are shown. Usage of this new logic is illustrated by an example of verification of mutual-exclusion algorithms.
Keywords: formal verification, model checking, action-based temporal logic, fixed point, mutual-exclusion algorithm
Published: 01.06.2012; Views: 1627; Downloads: 86
Link to full text