LFCS 1997 | Sciweavers

17

LFCS
1997
Springer

96views Artificial Intelligence» more LFCS 1997»

Back-Forth Equivalences for Design of Concurrent Systems

13 years 11 months ago

The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...

Igor V. Tarasyuk

claim paper

Read More »

24

click to vote

LFCS
1997
Springer

120views Artificial Intelligence» more LFCS 1997»

The Concurrency Complexity for the Horn Fragment of Linear Logic

13 years 11 months ago

Download pmkinfo.tversu.ru

The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various deﬁnitions of concurrency proposed in [2] and establish t...

Sergey Dudakov

claim paper

Read More »

14

click to vote

LFCS
1997
Springer

82views Artificial Intelligence» more LFCS 1997»

Type Introduction for Equational Rewriting

13 years 11 months ago