Abstract
We study the following problem: Given a transition system \(\tau\) and its quotient \({\tau \mathord{\left/{\vphantom {\tau \sim }} \right.\kern-\nulldelimiterspace} \sim }\)under an equivalence∼, which are the sets \(\mathcal{L},\mathcal{L}'\)of Hennessy-Milner formulae such that: if \(\varphi \in \mathcal{L}\)and \(\tau\) satisfies ϕ, then \({\tau \mathord{\left/{\vphantom {\tau \sim }} \right.\kern-\nulldelimiterspace} \sim }\)satisfies ϕ; if \(\varphi \in \mathcal{L}'\)and \({\tau \mathord{\left/{\vphantom {\tau \sim }} \right.\kern-\nulldelimiterspace} \sim }\)satisfies ϕ, then \(\tau\)satisfies ϕ.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Proceedings of CONCUR’92, volume 630 of LNCS. Springer, 1992.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183–235, 25 April 1994. Fundamental Study.
O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR’96, volume 1119 of LNCS, pages 247–262. Springer, 1996.
B.F. Chellas. Modal Logic-An Introduction. Cambridge University Press, 1980.
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. Springer, 1975.
U. Goltz, R. Kuiper, and W. Penczek. Propositional temporal logics and equivalences. In Proceedings of CONCUR’92 [1], pages 222–236.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.
T. Henzinger. Hybrid automata with finite bisimulations. In Proceedings of ICALP’95, volume 944 of LNCS, pages 324–335. Springer, 1995.
P. Jancar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proceedings of ICALP’96, volume 1099 of LNCS, pages 478–489. Springer, 1996.
P. Jancar and F. Moller. Checking regular properties of Petri nets. In Proceedings of CONCUR’ 95, volume 962 of LNCS, pages 348–362. Springer, 1995.
R. Kaivola and A. Valmari. The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic. In Proceedings of CONCUR’92 [1], pages 207–221.
A. Kučera. Regularity is decidable for normed PA processes in polynomial time. In Proceedings of FST&TCS’96, volume 1180 of LNCS, pages 111–122. Springer, 1996.
A. Kučera. On finite representations of infinite-state behaviours. Information Processing Letters, 70(1):23–30, 1999.
A. Kučera and R. Mayr. Simulation preorder on simple process algebras. In Proceedings of ICALP’99, LNCS. Springer, 1999. To appear.
R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, December 1987.
D.M.R. Park. Concurrency and automata on infinite sequences. In Proceedings 5th GI Conference, volume 104 of LNCS, pages 167–183. Springer, 1981.
R.J. van Glabbeek. The linear time-branching time spectrum. In Proceedings of CONCUR’ 90, volume 458 of LNCS, pages 278–297. Springer, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kučera, A., Esparza, J. (1999). A Logical Viewpoint on Process-Algebraic Quotients. In: Flum, J., Rodriguez-Artalejo, M. (eds) Computer Science Logic. CSL 1999. Lecture Notes in Computer Science, vol 1683. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48168-0_35
Download citation
DOI: https://doi.org/10.1007/3-540-48168-0_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66536-6
Online ISBN: 978-3-540-48168-3
eBook Packages: Springer Book Archive