Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Thorsten Wißmann"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 4 (2022)
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is achieved by
Externí odkaz:
https://doaj.org/article/98c929c64ef5449db902d51419a477b3
Autor:
Thorsten Wißmann
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
For the minimization of state-based systems (i.e. the reduction of the number of states while retaining the system's semantics), there are two obvious aspects: removing unnecessary states of the system and merging redundant states in the system. In t
Externí odkaz:
https://doaj.org/article/4a3eae6771724c77a86a0cc1e835943c
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 1 (2020)
We present a generic partition refinement algorithm that quotients coalgebraic systems by behavioural equivalence, an important task in system analysis and verification. Coalgebraic generality allows us to cover not only classical relational systems
Externí odkaz:
https://doaj.org/article/c33c206bad1f44a4829d9a83ac25faad
Publikováno v:
Logical Methods in Computer Science, Vol Volume 14, Issue 1 (2018)
We consider conditional transition systems, that model software product lines with upgrades, in a coalgebraic setting. By using Birkhoff's duality for distributive lattices, we derive two equivalent Kleisli categories in which these coalgebras live:
Externí odkaz:
https://doaj.org/article/ff394782321c4e8e97e970e7284ab549
Autor:
Jules Jacobs, Thorsten Wißmann
Publikováno v:
Proceedings of the ACM on Programming Languages, 7, 1514-1641
Proceedings of the ACM on Programming Languages, 7, POPL, pp. 1514-1641
Proceedings of the ACM on Programming Languages, 7, POPL, pp. 1514-1641
Coalgebraic bisimilarity minimization generalizes classical automaton minimization to a large class of automata whose transition structure is specified by a functor, subsuming strong, weighted, and probabilistic bisimilarity. This offers the enticing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fa2a4b148c999e5ce45996c090ea6e05
https://hdl.handle.net/2066/289909
https://hdl.handle.net/2066/289909
Autor:
Jérémy Dubut, Thorsten Wißmann
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031308284
In the open map approach to bisimilarity, the paths and their runs in a given state-based system are the first-class citizens, and bisimilarity becomes a derived notion. While open maps were successfully used to model bisimilarity in non-deterministi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4dff175975d10e55655b39b3c34de09
https://doi.org/10.1007/978-3-031-30829-1_15
https://doi.org/10.1007/978-3-031-30829-1_15
Publikováno v:
Formal Aspects of Computing. 33:695-727
Partition refinement is a method for minimizing automata and transition systems of various types. Recently, we have developed a partition refinement algorithm that is generic in the transition type of the given system and matches the run time of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95aa599222f12628876c065b1740cbf1
https://doi.org/10.1007/s00165-020-00526-z
https://doi.org/10.1007/s00165-020-00526-z
Publikováno v:
Commentationes Mathematicae Universitatis Carolinae
Commentationes Mathematicae Universitatis Carolinae, 2019, 60 (4), pp.605-638. ⟨10.14712/1213-7243.2019.026⟩
Commentationes Mathematicae Universitatis Carolinae, 2019, 60 (4), pp.605-638. ⟨10.14712/1213-7243.2019.026⟩
Coalgebras for an endofunctor provide a category-theoretic framework for modeling a wide range of state-based systems of various types. We provide an iterative construction of the reachable part of a given pointed coalgebra that is inspired by and re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a4df7d96abb76d310c2457912b06ccd4
https://doi.org/10.14712/1213-7243.2019.026
https://doi.org/10.14712/1213-7243.2019.026
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030995232
We present $$L^{\#}$$ L # , a new and simple approach to active automata learning. Instead of focusing on equivalence of observations, like the $$L^{*}$$ L ∗ algorithm and its descendants, $$L^{\#}$$ L # takes a different perspective: it tries to e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::23917bfd5dcd0a04967b662f5edff76e
https://doi.org/10.1007/978-3-030-99524-9_12
https://doi.org/10.1007/978-3-030-99524-9_12
Publikováno v:
Applied Categorical Structures. 24:663-701
Nominal sets provide a framework to study key notions of syntax and semantics such as fresh names, variable binding and α-equivalence on a conveniently abstract categorical level. Coalgebras for endofunctors on nominal sets model, e.g., various form
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f96517f1dfe2c43c671bdf4efd8ca93d
https://doi.org/10.1007/s10485-016-9457-8
https://doi.org/10.1007/s10485-016-9457-8