Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: complete axiomatizations

Sortuj według:

Ogranicz wyniki do:

A Complete Axiomatization of Process Temporal Logic

Kacprzak M.

Fundamenta Informaticae

2002

Vol. 50, nr 1

15-31

In this paper is introduced a proof system for branching time temporal logic, called PTL. It allows to verify static and dynamic properties of nondeterministic programs, which are expressed as a temporal formulas of PTL language. The strong completeness theorem of this system is presented.

Parameterized Structured Operational Semantics

Ferrari G.L., Montanari U.

Fundamenta Informaticae

1998

Vol. 34, nr 1,2

1-31

A generalization of De Simone format, where labels of transitions are structured actions, is presented. This provides a parameterized SOS framework where several paradigms of the observational semantics of process calculi can be uniformly handled. Moreover, standard algebraic techniques provide the formal machineries to relate the different semantics. It is also shown that much of the meta results developed for standard SOS format extend to this parameterized context.