A Logical Viewpoint on Process-algebraic Quotients

Journal of Logic and Computation

Volumn 13, Issue 6, 2003, Pages 863-880

  Kučera, Antonín ^a   Esparza, Javier ^b  

^a MASARYK UNIVERSITY   (Czech Republic)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Concurrency; Temporal logic; Transition systems

Indexed keywords

ALGEBRA; IMAGE PROCESSING; LINEAR EQUATIONS; SET THEORY;

CONCURRENCY; TRANSITION SYSTEMS;

FORMAL LOGIC;

EID: 0347337953     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/13.6.863     Document Type: Article

References (14)

1. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR'96, volume 1119 of Lecture Notes in Computer Science, pp. 247-262. Springer, 1996.
2. B.F. Chellas. Modal Logic - An Introduction. Cambridge University Press, 1980.
3. J. Flum. First-order logic and its extensions. In Proceedings of the International Summer Institute and Logic Colloquium, volume 499 of Lecture Notes in Mathematics, pp. 248-310. Springer, 1975.
4. U. Goltz, R. Kuiper, and W. Penczek. Propositional temporal logics and equivalences. In Proceedings of CONCUR'92, volume 630 of Lecture Notes in Computer Science, pp. 222-236. Springer, 1992.
5. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the Association for Computing Machinery, 32, 137-161, 1985.
6. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP'96, volume 1099 of Lecture Notes in Computer Science, pp. 478-489. Springer, 1996.
7. P. Jančar, A. Kučera, and F. Moller. Simulation and bisimulation over one-counter processes. In Proceedings of STAGS 2000, volume 1770 of Lecture Notes in Computer Science, pp. 334-345. Springer, 2000.
8. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR'95, volume 962 of Lecture Notes in Computer Science, pp. 348-362. Springer, 1995.
9. R. Kaivola and A. Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In Proceedings of CONCUR'92, volume 630 of Lecture Notes in Computer Science, pp. 207-221. Springer, 1992.
10. A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS'96, volume 1180 of Lecture Notes in Computer Science, pp. 111-122. Springer, 1996.
11. A. Kučera. On finite representations of infinite-state behaviours. Information Processing Letters, 70, 23-30, 1999.
12. A. Kučera and R. Mayr. Simulation preorder over simple process algebras. Information and Computation, 173, 184-198, 2002.
13. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
14. R. van Glabbeek. The linear time-branching time spectrum. Handbook of Process Algebra, pp. 3-99, Elsevier, Amsterdam, 1999.