-
1
-
-
84957675725
-
Polynomial algorithms for the synthesis of bounded nets
-
P. Mosses et al., editors, Springer
-
E. Badouel, L. Bernardinello, and P. Darondeau. Polynomial algorithms for the synthesis of bounded nets. In P. Mosses et al., editors, TAPSOFT 95, Lect. Notes Comp. Sci. 915, 364-378. Springer, 1995.
-
(1995)
TAPSOFT 95, Lect. Notes Comp. Sci
, vol.915
, pp. 364-378
-
-
Badouel, E.1
Bernardinello, L.2
Darondeau, P.3
-
2
-
-
19144373211
-
Concurrent bisimulations in Petri nets
-
E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Informatica, 28:231-264, 1991.
-
(1991)
Acta Informatica
, vol.28
, pp. 231-264
-
-
Best, E.1
Devillers, R.2
Kiehn, A.3
Pomello, L.4
-
3
-
-
0010646357
-
Deriving Petri nets from finite transition systems
-
J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Deriving Petri nets from finite transition systems. IEEE Transactions on Computers, 47:859-882, 1998.
-
(1998)
IEEE Transactions on Computers
, vol.47
, pp. 859-882
-
-
Cortadella, J.1
Kishinevsky, M.2
Lavagno, L.3
Yakovlev, A.4
-
4
-
-
84945977925
-
Deriving unbounded Petri nets from formal languages
-
D. Sangiorgi and R. de Simone, editors, Springer
-
P. Darondeau. Deriving unbounded Petri nets from formal languages. In D. Sangiorgi and R. de Simone, editors, CONCUR 98, Lect. Notes Comp. Sci. 1466, 533-548. Springer, 1998.
-
(1998)
CONCUR 98, Lect. Notes Comp. Sci
, vol.1466
, pp. 533-548
-
-
Darondeau, P.1
-
5
-
-
0001905397
-
Petri nets and automata with concurrency relations - An adjunction
-
M. Droste et al., editors, Gordon and Breach
-
M. Droste and R.M. Shortt. Petri nets and automata with concurrency relations - an adjunction. In M. Droste et al., editors, Semantics of Programming Languages and Model Theory. Gordon and Breach, 69-87. 1993.
-
(1993)
Semantics of Programming Languages and Model Theory
, pp. 69-87
-
-
Droste, M.1
Shortt, R.M.2
-
6
-
-
85031621453
-
Petri net models for algebraic theories of concurrency
-
J.W. de Bakker et al., editors, Springer
-
R.J. V. Glabbeek and F. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker et al., editors, PARLE Vol. II, Lect. Notes Comp. Sci. 259, 224-242. Springer, 1987.
-
(1987)
PARLE Vol. II, Lect. Notes Comp. Sci
, vol.259
, pp. 224-242
-
-
Glabbeek, R.J.V.1
Vaandrager, F.2
-
7
-
-
85029819743
-
A trace semantics for Petri nets
-
W. Kuich, editor, Springer
-
P. Hoogers, H. Kleijn, and P.S. Thiagarajan. A trace semantics for Petri nets. In W. Kuich, editor, Automata, Languages and Programming, ICALP 1992, Lect. Notes Comp. Sci. 623, 595-604. Springer, 1992.
-
(1992)
Automata, Languages and Programming, ICALP 1992, Lect. Notes Comp. Sci
, vol.623
, pp. 595-604
-
-
Hoogers, P.1
Kleijn, H.2
Thiagarajan, P.S.3
-
9
-
-
0002659052
-
Models for concurrency
-
S. Abramsky, D. Gabbay, and T. Maibaum, editors, Oxford Univ. Press
-
M. Nielsen and G. Winskel. Models for concurrency. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science Vol. 4, pages 1-148. Oxford Univ. Press, 1995.
-
(1995)
Handbook of Logic in Computer Science
, vol.4
, pp. 1-148
-
-
Nielsen, M.1
Winskel, G.2
-
12
-
-
0003310162
-
Modular Construction and Partial Order Semantics of Petri Nets
-
Springer
-
W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.
-
(1992)
Lect. Notes Comp. Sci
, vol.625
-
-
Vogler, W.1
-
13
-
-
0001681473
-
Timed testing of concurrent systems
-
W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149-171, 1995.
-
(1995)
Information and Computation
, vol.121
, pp. 149-171
-
-
Vogler, W.1
-
14
-
-
0031679674
-
Designing control logic for counterflow pipeline processor using Petri nets
-
A. Yakovlev. Designing control logic for counterflow pipeline processor using Petri nets. Formal Methods in System Design, 12:39-71, 1998.
-
(1998)
Formal Methods in System Design
, vol.12
, pp. 39-71
-
-
Yakovlev, A.1
|