Results 131 to 140 of about 864 (171)

Data decision diagrams for Promela systems analysis

International Journal on Software Tools for Technology Transfer, 2010
In this paper, we show how to verify computation tree logic (CTL) properties, using symbolic methods, on systems described in Promela. Symbolic representation is based on data decision diagrams (DDDs) which are n-valued Shared Decision Trees designed to represent dynamic systems with integer domain variables.
Beaudenon, Vincent, Encrenaz, Emmanuelle, Taktak, Sami   +2 more
openaire   +3 more sources

Modeling Railway Control Systems in Promela

, 2016
This paper presents an approach to systematically build Promela models with the aim of generating test cases within the system level testing process of railway control systems. The paper focuses on the encoding of the system model, of the aspects related to the representation of possible execution environments and their interaction with the system. The
Roberto Nardone, Ugo Gentile, Massimo Benerecetti, Adriano Peron, Valeria Vittorini, Stefano Marrone 0001, Nicola Mazzocca   +6 more
openaire   +5 more sources

From Dynamic State Machines to Promela

, 2019
Dynamic State Machines (DSTM) is an extension of Hierarchical State Machines recently introduced to answer some concerns raised by model-based validation of railway control systems. However, DSTM can be used to model a wide class of systems for design, verification and validation purposes.
Massimo Benerecetti, Ugo Gentile, Roberto Nardone, Adriano Peron, Luigi Libero Lucio Starace, Valeria Vittorini, Stefano Marrone   +6 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Visualization of Promela with NS-Chart

2019 12th International Conference on Information & Communication Technology and System (ICTS), 2019
In the paradigm of model checking, a formal model is considered as one of the crucial sources that tends to be verified with the desired properties. The definition of the formal model should be understandable and clear in order to express the structure and behaviors of the system visually using diagrammatic tools.
Wiwat Vatanawood
exaly   +2 more sources

A Promela Model for Contiki’s Scheduler

2020 CSI/CPSSI International Symposium on Real-Time and Embedded Systems and Technologies (RTEST), 2020
This paper presents a formal model for the scheduler of Contiki, which is an event-driven lightweight Operating System for the Internet of Things (IoT). The proposed formal model enhances our knowledge regarding the most critical components of Contiki, namely its process and event queues, and its scheduler.
Hassan Mousavi, Elham Mahmoudzadeh, Ali Ebnenasir   +2 more
openaire   +2 more sources

A generalized semantics of PROMELA for abstract model checking

Formal Aspects of Computing, 2004
Abstract. Semantics of description languages for complex systems are a central issue for implementing verification methods such as abstract model checking . This technique is employed to verify systems by inspecting only a small state space that represents its potential behaviors.
Maria Del Mar Gallardo, Pedro Merino, Ernesto Pimentel   +2 more
exaly   +2 more sources

Static Reductions for Promela Specifications

, 2006
The interleaving of concurrent processes actions leads to a combinatory explosion. There exists in Petri nets theory some structural reductions that combat the state explosion by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula ...
Pajault, Christophe, Pradat-Peyre, Jean-François   +1 more
core   +3 more sources

Promela Planning

, 2003
In this paper a compiler from a restricted subset of SPIN's input language Promela into an action planning description language is presented. It exploits the representation of protocols as communicating finite state machines.
Stefan Edelkamp
openaire   +2 more sources

Type inference and strong static type checking for Promela

Science of Computer Programming, 2010
The Spin model checker and its specification language Promela have been used extensively in industry and academia to check the logical properties of distributed algorithms and protocols.
Alastair F Donaldson
exaly   +3 more sources

Implementing statecharts in PROMELA/SPIN

Proceedings. 2nd IEEE Workshop on Industrial Strength Formal Specification Techniques, 2002
We translate statecharts into PROMELA, the input language of the SPIN verification system, using extended hierarchical automata as an intermediate format. We discuss two possible frameworks for this translation, leading to either sequential or parallel code.
Erich Mikk, Yassine Lakhnech, Michael Siegel, Gerard J. Holzmann   +3 more
openaire   +1 more source