Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

A Function Elimination Method for Checking Satisfiability of Arithmetical Logics

Castiglioni V., Lanotte R., Tini S.

Fundamenta Informaticae

2016

Vol. 143, nr 1/2

51--71

We study function elimination for Arithmetical Logics. We propose a method allowing substitution of functions occurring in a given formula with functions with less arity. We prove the correctness of the method and we use it to show the decidability of the satisfiability problem for two classes of formulas allowing linear and polynomial terms.

A Specification Format for Rooted Branching Bisimulation

Castiglioni V., Lanotte R., Tini S.

Fundamenta Informaticae

2014

Vol. 135, nr 4

355--369

Rule formats are sets of syntactical constraints over SOS rules ensuring semantical properties of the derived LTS. Given a rule format, our proposal is to relax the constraints imposed on each single rule and to introduce some constraints on the form of the whole set of rules, thus obtaining a new format ensuring the same semantical property and being less demanding than the original one. We apply our idea to a well known rule format for rooted branching bisimulation equivalence.