Result 1 to 19 of 19 total
Safeness for object nets. (English)
Fundam. Inform. 101, No. 1-2, 29-43 (2010).
1
On the containment problem for queries in conjunctive form with negation. (English)
Pnueli, Amir (ed.) et al., Perspectives of systems informatics. 7th international Andrei Ershov memorial conference, PSI 2009, Novosibirsk, Russia, June 15‒19, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11485-4/pbk). Lecture Notes in Computer Science 5947, 110-123 (2010).
2
An assertional proof for a construction of an atomic variable. (English)
Formal Asp. Comput. 16, No. 4, 387-393 (2004).
3
On reachability graphs of Petri nets. (English)
Comput. Electr. Eng. 29, No.2, 263-272 (2003).
4
Differential Petri nets: Representing continuous systems in a discrete-event world. (English)
IEEE Trans. Autom. Control 43, No.4, 573-579 (1998).
5
Realization of fail-safe sequential machines by using inversion of input variables. (English)
Informatica, Vilnius 4, No.3-4, 267-276 (1993).
6
A mathematical model for system design and refinement. (English)
Int. J. Comput. Math. 34, No.1-2, 13-31 (1990).
7
A distributed synchronization scheme for fair multi-process handshakes. (English)
Inf. Process. Lett. 34, No.3, 131-138 (1990).
8
Pipelining and concurrency in graphics and image-processing applications. (English)
Comput. Syst. Sci. Eng. 3, No.3, 107-116 (1988).
9
Some classes of live and safe Petri nets. (English)
Concurrency and nets. Advances in Petri nets, 71-94 (1987).
10
Petri nets. (Seti Petri). (Russian)
Moskva: "Nauka" Glavnaya Redaktsiya Fiziko-Matematicheskoj Literatury. 160 p. R. 1.80 (1984).
11
Reduction method for testing the correctness of parallel algorithms of logical control. (Russian)
Dokl. Akad. Nauk BSSR 27, 617-619 (1983).
12
Hardware specification with temporal logic: an example. (English)
IEEE Trans. Comput. 31, 223-231 (1982).
13
A reduction of Petri nets. (Russian)
Vychisl. Sist. 82, 41-54 (1980).
14
Simplification des réseaux de Petri par elimination de places implicites. (French)
Digital Processes 6, 245-256 (1980).
15
Approaches to concurrency in B-trees. (English)
Mathematical foundations of computer science, Proc. 9th Symp., Rydzyna/Pol. 1980, Lect. Notes Comput. Sci. 88, 402-413 (1980).
16
Synthesis of decision-free concurrent systems for prescribed resources and performance. (English)
IEEE Trans. Software Eng. 6, 525-530 (1980).
17
Fuites dans les réseaux de Petri. (French)
RAIRO, Inf. Théor. 12, 125-144 (1978).
18
Realization of fail-safe sequential machines by using a k-out-of-n code. (English)
IEEE Trans. Comput. 20, No. 11, 1270-1275 (1971).
19
Result 1 to 19 of 19 total
Start
Contact
Print
General Help
