Publications - 2000

1

I. Cerná and J. Stríbrná. Some remarks on weak bisimilarity of BPA-processes. Technical Report FIMU-RS-2000-09, Faculty of Informatics, Masaryk University, 2000.

2

C. Duford, A. Finkel, P. Jancar, and Ph. Schnoebelen. Reset P/T Nets. in preparation for a journal publication.

3

J.-M. Jacquet, L. Brim, D. Gilbert, and M. Kretínský:. Semantics for synchronous concurrent constraint programming. in preparation for journal submission.

4

P. Jancar. Bouziane's algorithm for Petri net reachability problem is incorrect. submitted (to TCS).

5

P. Jancar, A. Kucera, and R. Mayr. Deciding bisimulation-like equivalences with finite-state processes. Theoretical Computer Science. To appear.

6

P. Jancar, A. Kucera, and F. Moller. Simulation and bisimulation over one-counter processes. In Proceedings of STACS 2000, volume 1770 of Lecture Notes in Computer Science, pages 334-345. Springer, 2000.

7

P. Jancar, A. Kucera, F. Moller, and Z. Sawa. Semilinear colourings and simulation on one-counter machines. in preparation for a journal publication.

8

P. Jancar and Z. Sawa. P-hardness of behavioural equivalences for finite state systems. in preparation.

9

O. Klíma and J. Srba. Matching modulo associativity and idempotency is NP-complete. In Mathematical Foundation of Computer Science 2000, 25th International Symposium, volume 1893 of LNCS, pages 456-466. Springer-Verlag, 2000.

10

A. Kucera. Efficient verification algorithms for one-counter processes. In Proceedings of ICALP 2000, volume 1853 of Lecture Notes in Computer Science, pages 317-328. Springer, 2000.

11

A. Kucera. Efficient verification algorithms for one-counter processes. Technical report FIMU-RS-2000-03, Faculty of Informatics, Masaryk University, 2000. Full version of the paper accepted for ICALP'2000.

12

A. Kucera and J. Esparza. A logical viewpoint on process-algebraic quotients. Journal of Logic and Computation. Submitted.

13

A. Kucera and R. Mayr. Simulation preorder over simple process algebras. Information and Computation. Submitted.

14

A. Kucera and R. Mayr. Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time. Theoretical Computer Science. To appear.

15

J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. In Expressiveness in Concurrency, EXPRESS'00, volume 39 of ENTCS, pages 1-20. State College : Elsevier, 2000. to appear January 2001.

16

J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. Mathematical Structures in Computer Science, submitted for publication. revised and full version of EXPRESS paper.

17

J. Srba. Basic process algebra with deadlocking states. Theoretical Computer Science, to appear.

18

J. Strejcek. Constrained labelled rewrite transition systems. Technical Report FIMU-RS-2000-09, Faculty of Informatics, Masaryk University, 2000.

[Jan99]

Jancar P.: A note on well quasi-orderings for powersets; Information Processing Letters 72 (1999), pp. 155-160 (Elsevier, ISSN 0020-0190) - vyšlo až začátkem roku 2000.

[Jan00b]

Jancar P.: Decidability of bisimilarity for one-counter processes; Information and Computation 158 (2000), pp. 1-17 (Academic Press, ISSN 0890-5401)

[JKM00]

Jancar P., Kucera A., Moller F.: Simulation and bisimulation over one-counter processes; in Proc. STACS 2000 (Lille, France, February 2000), Lecture Notes in Computer Science, Vol. 1770, pp. 334-345, (Springer, ISBN 3-540-67141-2, ISSN 0302-9743)