2000 character limit reached
Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable
Published 11 Jul 2023 in cs.LO | (2307.05265v1)
Abstract: We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is NP-complete. However, we can provide polynomial algorithms, if minimality is formulated as the minimal number of nested modalities, and it can even be extended by recursively requiring a minimal number of nested negations. A prototype implementation shows that the generated formulas are much smaller than those generated by the method introduced by Cleaveland.
- Around Hopcroft’s algorithm. In Implementation and Application of Automata: 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006. Proceedings 11, pages 114–125. Springer, 2006.
- Tight lower and upper bounds for the complexity of canonical colour refinement. Theory of Computing Systems, 60(4):581–614, 2017.
- Deciding all behavioral equivalences at once: A game for linear-time–branching-time spectroscopy. Logical Methods in Computer Science, 18(3), August 2022. doi:10.46298/lmcs-18(3:19)2022.
- Characterizing finite kripke structures in propositional temporal logic. Theoretical Computer Science, 59(1):115–131, 1988. doi:10.1016/0304-3975(88)90098-9.
- The mCRL2 toolset for analysing concurrent systems. In Tomáš Vojnar and Lijun Zhang, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS ‘19), pages 21–39. Springer International Publishing, 2019. doi:10.1007/978-3-030-17465-1_2.
- Rance Cleaveland. On automatically explaining bisimulation inequivalence. In Edmund M. Clarke and Robert P. Kurshan, editors, Proc. Computer-Aided Verification (CAV 1990), pages 364–372, Berlin, Heidelberg, 1991. Springer Berlin Heidelberg. doi:10.1007/BFb0023750.
- Regular expressions: New results and open problems. J. Autom. Lang. Comb., 10(4):407–437, 2005.
- On the size of shortest modal descriptions. In Advances in Modal Logic, volume 8, pages 114–132, 2010.
- Herman Geuvers. Apartness and distinguishing formulas in Hennessy-Milner logic. In Nils Jansen, Mariëlle Stoelinga, and Petra van den Bos, editors, A Journey from Process Algebra via Timed Automata to Model Learning, pages 266–282. Springer Nature Switzerland, 2022. doi:10.1007/978-3-031-15629-8_14.
- Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202–260, 1992. doi:10.1016/0890-5401(92)90013-6.
- On observing nondeterminism and concurrency. In Jaco de Bakker and Jan van Leeuwen, editors, Automata, Languages and Programming (ICALP ‘1980), page 299–309, Berlin, Heidelberg, 1980. Springer-Verlag. doi:10.5555/646234.758793.
- John Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Zvi Kohavi and Azaria Paz, editors, Theory of Machines and Computations, pages 189–196. Academic Press, 1971. doi:10.1016/B978-0-12-417750-5.50022-1.
- Harry B. Hunt III. On the Time and Tape Complexity of Languages. PhD thesis, Cornell University, 1973.
- CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43 – 68, 1990. doi:10.1016/0890-5401(90)90025-D.
- Explaining non-bisimilarity in a coalgebraic approach: Games and distinguishing formulas. In Daniela Petrişan and Jurriaan Rot, editors, Coalgebraic Methods in Computer Science (CMCS 2022), pages 133–154. Springer, 2020.
- Henri Korver. Computing distinguishing formulas for branching bisimulation. In Kim G. Larsen and Arne Skou, editors, Computer Aided Verification (CAV 1991), pages 13–23. Springer, 1992.
- Testing finite-state machines: State identification and verification. IEEE Transactions on computers, 43(3):306–320, 1994. doi:10.1109/12.272431.
- S.P. Luttik. Description and formal specification of the Link Layer of P1394. CWI report. SEN-R : software engineering. Centrum voor Wiskunde en Informatica, 1997.
- Robin Milner. A calculus of communicating systems. Springer, 1980.
- Edward F. Moore. Gedanken-experiments on sequential machines. In Claude Shannon and John McCarthy, editors, Automata Studies, pages 129–153. Princeton University Press, Princeton, NJ, 1956.
- Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973–989, 1987. doi:10.1137/0216062.
- David Park. Concurrency and automata on infinite sequences. In Peter Deussen, editor, Theoretical Computer Science, pages 167–183. Springer Berlin Heidelberg, 1981.
- Minimal separating sequences for all pairs of states. In Adrian-Horia Dediu, Jan JanouÅ¡ek, Carlos MartÃn-Vide, and Bianca Truthe, editors, Language and Automata Theory and Applications (LATA 2016), pages 181–193. Springer, 2016.
- Antti Valmari. Bisimilarity minimization in o(m logn) time. In Giuliana Franceschinis and Karsten Wolf, editors, Applications and Theory of Petri Nets, pages 123–142, Berlin, Heidelberg, 2009. Springer Berlin Heidelberg.
- Quasilinear-time computation of generic modal witnesses for behavioural inequivalence. Logical Methods in Computer Science, 18(4), November 2022. doi:10.46298/lmcs-18(4:6)2022.
- Caal 2.0. recursive HML, distinguishing formulae, equivalence collapses and parallel fixed-point computations. Master’s thesis, Aalborg University, 2015.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
