Petri Nets to B-Language Transformation in Software Development

Sobota, Branislav

doi:10.12700/aph.11.06.2014.06.12

Cited by 8 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The method allows for developing a system specification in form of a collection of components called B-machines with formally proven properties. It enables to refine an abstract specification into the concrete realm, which can then be translated into programming language [25]. Some activities have been done [23] in this area and it would be very interesting to continue in this direction, in order to utilize the new results in the area of software engineering.…”

Section: Discussionmentioning

confidence: 99%

Abstraction-enriched Formal Methods Integration

Šimoňák¹,

Uchnár²,

Fecil'ak³

et al. 2018

ACTA POLYTECH HUNG

View full text Add to dashboard Cite

The paper presents the results of our research in the field of combining process algebra and Petri nets. To provide better support for design and analysis of larger-scale systems by means of abstraction mechanism, the method itself and the tools allowing its practical application have been enhanced significantly. The theoretical aspects and implementation of enhancements are discussed in detail. Careful testing, along with the process of implementing the new functionality into one of the involved tools, helped us to disclose its certain hidden imperfections, which are subsequently addressed.

show abstract

Section: Discussionmentioning

confidence: 99%

Abstraction-enriched Formal Methods Integration

Šimoňák¹,

Uchnár²,

Fecil'ak³

et al. 2018

ACTA POLYTECH HUNG

View full text Add to dashboard Cite

show abstract

“…The expressive power of Petri nets has been studied and compared with several other formal methods for the specification and description of systems. Such systems include algebraic specification in [24], which leads to the extension of the notion of tokens to structural ones, or with B-language [11], in which the transformation of Petri nets to B-language is defined for software development, from specification to implementation. In our paper we would like to present another correspondence, namely how PNs can be transform into provable linear logic sequents.…”

Section: Introductionmentioning

confidence: 99%

“…These problems are similar to the ones in the process of component composition in component-based systems. The examples of synchronization problems appear frequently in textbooks or papers concerning with Petri nets [9,11,20,25]. To illustrate the transformation from PNs to linear logic together with the appearance of synchronization problems in component composition, is our main aim that is not published yet in scientific publications.…”

Section: Introductionmentioning

confidence: 99%

Modeling Synchronization Problems: From Composed Petri Nets to Provable Linear Sequents

Perháč¹,

Mihályi²,

Novitzká³

2017

ACTA POLYTECH HUNG

View full text Add to dashboard Cite

Component-based programming has become a popular and frequently used method for software development, prepared from independent components by a composition. Our paper presents an illustration of how a composition of components can cause the emergence of new problems that should be solved, in order to obtain the desired results. We introduce a transformation of Petri nets to corresponding provable sequents of linear logic and then we show how a composition of simple Petri nets causes arising of synchronization problems. Transformation to provable linear sequents that ensures a verified behavior for such composed systems.

show abstract