Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Jan Friso Groote and Tim A. C. Willemse. Real Equation Systems with Alternating Fixed-Points. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 28:1-28:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{groote_et_al:LIPIcs.CONCUR.2023.28, author = {Groote, Jan Friso and Willemse, Tim A. C.}, title = {{Real Equation Systems with Alternating Fixed-Points}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {28:1--28:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.28}, URN = {urn:nbn:de:0030-drops-190225}, doi = {10.4230/LIPIcs.CONCUR.2023.28}, annote = {Keywords: Real Equation System, Solution method, Gau{\ss}-elimination, Model checking, Quantitative modal mu-calculus} }
Published in: LIPIcs, Volume 279, 34th International Conference on Concurrency Theory (CONCUR 2023)
Jan Martens and Jan Friso Groote. Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable. In 34th International Conference on Concurrency Theory (CONCUR 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 279, pp. 32:1-32:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{martens_et_al:LIPIcs.CONCUR.2023.32, author = {Martens, Jan and Groote, Jan Friso}, title = {{Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable}}, booktitle = {34th International Conference on Concurrency Theory (CONCUR 2023)}, pages = {32:1--32:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-299-0}, ISSN = {1868-8969}, year = {2023}, volume = {279}, editor = {P\'{e}rez, Guillermo A. and Raskin, Jean-Fran\c{c}ois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2023.32}, URN = {urn:nbn:de:0030-drops-190268}, doi = {10.4230/LIPIcs.CONCUR.2023.32}, annote = {Keywords: Distinguishing behaviour, Hennessy-Milner logic, NP-hardness} }
Published in: OASIcs, Volume 109, Eelco Visser Commemorative Symposium (EVCS 2023)
Casper Bach Poulsen. Renamingless Capture-Avoiding Substitution for Definitional Interpreters. In Eelco Visser Commemorative Symposium (EVCS 2023). Open Access Series in Informatics (OASIcs), Volume 109, pp. 2:1-2:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{bachpoulsen:OASIcs.EVCS.2023.2, author = {Bach Poulsen, Casper}, title = {{Renamingless Capture-Avoiding Substitution for Definitional Interpreters}}, booktitle = {Eelco Visser Commemorative Symposium (EVCS 2023)}, pages = {2:1--2:10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-267-9}, ISSN = {2190-6807}, year = {2023}, volume = {109}, editor = {L\"{a}mmel, Ralf and Mosses, Peter D. and Steimann, Friedrich}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.EVCS.2023.2}, URN = {urn:nbn:de:0030-drops-177728}, doi = {10.4230/OASIcs.EVCS.2023.2}, annote = {Keywords: Capture-avoiding substitution, lambda calculus, definitional interpreter} }
Published in: LIPIcs, Volume 203, 32nd International Conference on Concurrency Theory (CONCUR 2021)
Jan Friso Groote, Jan Martens, and Erik de Vink. Bisimulation by Partitioning Is Ω((m+n)log n). In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 203, pp. 31:1-31:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{groote_et_al:LIPIcs.CONCUR.2021.31, author = {Groote, Jan Friso and Martens, Jan and de Vink, Erik}, title = {{Bisimulation by Partitioning Is \Omega((m+n)log n)}}, booktitle = {32nd International Conference on Concurrency Theory (CONCUR 2021)}, pages = {31:1--31:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-203-7}, ISSN = {1868-8969}, year = {2021}, volume = {203}, editor = {Haddad, Serge and Varacca, Daniele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2021.31}, URN = {urn:nbn:de:0030-drops-144087}, doi = {10.4230/LIPIcs.CONCUR.2021.31}, annote = {Keywords: Bisimilarity, partition refinement, labeled transition system, lowerbound} }
Published in: LIPIcs, Volume 171, 31st International Conference on Concurrency Theory (CONCUR 2020)
David N. Jansen, Jan Friso Groote, Ferry Timmers, and Pengfei Yang. A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains. In 31st International Conference on Concurrency Theory (CONCUR 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 171, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jansen_et_al:LIPIcs.CONCUR.2020.8, author = {Jansen, David N. and Groote, Jan Friso and Timmers, Ferry and Yang, Pengfei}, title = {{A Near-Linear-Time Algorithm for Weak Bisimilarity on Markov Chains}}, booktitle = {31st International Conference on Concurrency Theory (CONCUR 2020)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-160-3}, ISSN = {1868-8969}, year = {2020}, volume = {171}, editor = {Konnov, Igor and Kov\'{a}cs, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2020.8}, URN = {urn:nbn:de:0030-drops-128209}, doi = {10.4230/LIPIcs.CONCUR.2020.8}, annote = {Keywords: Behavioural Equivalence, weak Bisimulation, Markov Chain} }
Published in: LIPIcs, Volume 167, 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Rick Erkens and Maurice Laveaux. Adaptive Non-Linear Pattern Matching Automata. In 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 167, pp. 20:1-20:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{erkens_et_al:LIPIcs.FSCD.2020.20, author = {Erkens, Rick and Laveaux, Maurice}, title = {{Adaptive Non-Linear Pattern Matching Automata}}, booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)}, pages = {20:1--20:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-155-9}, ISSN = {1868-8969}, year = {2020}, volume = {167}, editor = {Ariola, Zena M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2020.20}, URN = {urn:nbn:de:0030-drops-123427}, doi = {10.4230/LIPIcs.FSCD.2020.20}, annote = {Keywords: Pattern matching, Term indexing, Tree automata} }
Published in: Dagstuhl Seminar Proceedings, Volume 6351, Methods for Modelling Software Systems (MMOSS) (2007)
Jan Friso Groote, Aad Mathijssen, Michel Reniers, Yaroslav Usenko, and Muck van Weerdenburg. The Formal Specification Language mCRL2. In Methods for Modelling Software Systems (MMOSS). Dagstuhl Seminar Proceedings, Volume 6351, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{groote_et_al:DagSemProc.06351.12, author = {Groote, Jan Friso and Mathijssen, Aad and Reniers, Michel and Usenko, Yaroslav and van Weerdenburg, Muck}, title = {{The Formal Specification Language mCRL2}}, booktitle = {Methods for Modelling Software Systems (MMOSS)}, pages = {1--34}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6351}, editor = {Ed Brinksma and David Harel and Angelika Mader and Perdita Stevens and Roel Wieringa}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.06351.12}, URN = {urn:nbn:de:0030-drops-8626}, doi = {10.4230/DagSemProc.06351.12}, annote = {Keywords: Specification language, abstract data types, process algebra, operational semantics} }
Feedback for Dagstuhl Publishing