Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: labelled transition systems

Sortuj według:

Ogranicz wyniki do:

Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis

Devillers Raymond

Fundamenta Informaticae

2021

Vol. 183, nr 1-2

1--31

In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining decompositions of labelled transition systems, such that each component is synthesisable iff so is the original system. Then corresponding Petri Net composition operators are searched to combine the solutions of the various components into a solution of the original system. The paper presents two such techniques, which may be combined: products and articulations. They may also be used to structure transition systems, and to analyse the performance of synthesis techniques when applied to such structures.

Causal Reasoning for Safety in Hennessy Milner Logic

Caltais Georgiana, Mousavi Mohammad Reza, Singh Hargurbir

Fundamenta Informaticae

2020

Vol. 173, nr 2-3

217--251

Determining and computing root causes in system failures is a significant issue in science and engineering. In this paper, we introduce a notion of causality for explaining counter-examples in system analysis based on formal models. The counter-examples are produced by checking for hazardous situations expressed in the Hennessy-Milner Logic, in the context of Labelled Transition System models. We also introduce CauseJMu, a tool for automatically identifying such causal computations within a system model. CauseJMu relies on encoding causality in terms of an extension of Hennessy-Milner Logic to recursive formulae with data. The encodings enable deciding whether a certain computation is causal or not, using the mCRL2 model checker.

Decisions involving databases, fuzzy databases and codatabases

Schumann A., Woleński J.

Operations Research and Decisions

2015

Vol. 25, No. 3

59--72

The authors consider the following three ways of decision making: (i) decisions involving databases by means of standard tools of sequential logic and universal algebra; (ii) decisions involving fuzzy databases by means of fuzzy logic; (iii) decision involving continuously growing databases (codatabases) using the tools of Bayesian networks.

Synthesis of Live and Bounded Persistent Systems

Best E., Devillers R.

Fundamenta Informaticae

2015

Vol. 140, nr 1

39--59

This paper presents a dedicated Petri net synthesis algorithm for the case that a transition system is finite, live, and persistent. In particular, the paper delineates exactly when and how a structurally persistent net may be constructed, by crystallising, out of a general region-theoretic approach, a minimised set of simplified systems of linear inequalities. This extends previous results where reversibility, instead of liveness, played an important role.