Add to ORKGrEVIEWS IN MR 82b: 03079, ZBL 453 #03013; MR 81h: 68034, ZBL 453 #03012.Previously published in Proc. of the 5th Scandinavian Logic Symposium}, Aalborg 1979, pp. 59 - 96 and Grundlagen der Mathematik und Informatik, RWTH Aachen, Hrg. W. Oberschelp, M. M. Richter, Nr. 2, Juli 1978, pp. 3
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
International audienceAt the end of the eighties, continuous Petri nets were introduced for: (1) all...
Abstract. At the end of the eighties, continuous Petri nets were intro-duced for: (1) alleviating th...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
SIGLEAvailable from British Library Document Supply Centre- DSC:8724.9(UNUT-CL-TRS--357) / BLDSC - B...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
AbstractWe show that the decision problem for the class C0 of all closed universal Horn formulae in ...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
The reachability problem for Petri nets is a central problem of net theory. The problem is known to ...
Abstract. We introduce a novel technique for checking reachability in Petri nets that relies on a re...
Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP...
Available from Slovak Centre of Scientific and Technical Information, under shelf-number: A569371 / ...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
International audienceAt the end of the eighties, continuous Petri nets were introduced for: (1) all...
Abstract. At the end of the eighties, continuous Petri nets were intro-duced for: (1) alleviating th...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
SIGLEAvailable from British Library Document Supply Centre- DSC:8724.9(UNUT-CL-TRS--357) / BLDSC - B...
AbstractUsing linear algebraic techniques, we analyse the computational complexity of testing reacha...
AbstractWe show that the decision problem for the class C0 of all closed universal Horn formulae in ...
AbstractIn this paper, we show that (1) the question to decide whether a given Petri net is consiste...
Petri nets, also known as vector addition systems, are a long established model of concurrency with ...
The reachability problem for Petri nets is a central problem of net theory. The problem is known to ...
Abstract. We introduce a novel technique for checking reachability in Petri nets that relies on a re...
Abstract. The Petri Net (PN) reachability problem is an effective formulation to attack the P vs. NP...
Available from Slovak Centre of Scientific and Technical Information, under shelf-number: A569371 / ...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
International audienceWe propose a semi-decision procedure for checking generalized reachability pro...
International audienceAt the end of the eighties, continuous Petri nets were introduced for: (1) all...
Abstract. At the end of the eighties, continuous Petri nets were intro-duced for: (1) alleviating th...