Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Jaco van de Pol"'
Autor:
Thomas Neele, Jaco van de Pol
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
We study operations on fixpoint equation systems (FES) over arbitrary complete lattices. We investigate under which conditions these operations, such as substituting variables by their definition, and swapping the ordering of equations, preserve the
Externí odkaz:
https://doaj.org/article/6ac3c3fd087f4e668614ceced84de107
Autor:
Sakshi Khurana, Stefano Schivo, Jacqueline R. M. Plass, Nikolas Mersinis, Jetse Scholma, Johan Kerkhofs, Leilei Zhong, Jaco van de Pol, Rom Langerak, Liesbet Geris, Marcel Karperien, Janine N. Post
Publikováno v:
Frontiers in Bioengineering and Biotechnology, Vol 9 (2021)
A fundamental question in cartilage biology is: what determines the switch between permanent cartilage found in the articular joints and transient hypertrophic cartilage that functions as a template for bone? This switch is observed both in a subset
Externí odkaz:
https://doaj.org/article/7987b8cda5b64370984e24d6236274bd
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 196, Iss Proc. MARS 2015, Pp 46-60 (2015)
Bitcoin is a popular digital currency for online payments, realized as a decentralized peer-to-peer electronic cash system. Bitcoin keeps a ledger of all transactions; the majority of the participants decides on the correct ledger. Since there is no
Externí odkaz:
https://doaj.org/article/f78215bcd77648afa26e591900c0b35b
Autor:
Gijs Kant, Jaco van de Pol
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 159, Iss Proc. GRAPHITE 2014, Pp 2-14 (2014)
We present a new tool for verification of modal mu-calculus formulae for process specifications, based on symbolic parity games. It enhances an existing method, that first encodes the problem to a Parameterised Boolean Equation System (PBES) and then
Externí odkaz:
https://doaj.org/article/06d20bc167874b6687632c6ebdfed416
Autor:
Stefano Schivo, Jetse Scholma, Marcel Karperien, Janine N. Post, Jaco van de Pol, Rom Langerak
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 145, Iss Proc. SynCoP 2014, Pp 35-47 (2014)
ANIMO (Analysis of Networks with Interactive MOdeling) is a software for modeling biological networks, such as e.g. signaling, metabolic or gene networks. An ANIMO model is essentially the sum of a network topology and a number of interaction paramet
Externí odkaz:
https://doaj.org/article/da95cd0e91104b5d887cbfbee9a024ba
Autor:
Gijs Kant, Jaco van de Pol
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 99, Iss Proc. GRAPHITE 2012, Pp 50-65 (2012)
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal mu-calculus formulae for process algebraic specifications with data. Solving a PBES is usually do
Externí odkaz:
https://doaj.org/article/f5b3d24376ca4256beabbaafee53e732
Autor:
Alfons Laarman, Jaco van de Pol
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 72, Iss Proc. PDMC 2011, Pp 13-28 (2011)
Recently, two new parallel algorithms for on-the-fly model checking of LTL properties were presented at the same conference: Automated Technology for Verification and Analysis, 2011. Both approaches extend Swarmed NDFS, which runs several sequential
Externí odkaz:
https://doaj.org/article/aecdbf2a93324697aba332bc47536565
Autor:
Stefan Blom, Jaco van de Pol
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 14, Iss Proc. PDMC 2009, Pp 32-46 (2009)
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement process and the signatures have been optimized to exploit the fact that the
Externí odkaz:
https://doaj.org/article/29b369dcb7944346b94ade0b3f114fb9
Autor:
Irfansha Shaik, Jaco Van de Pol
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:329-337
Most classical planners use grounding as a preprocessing step, essentially reducing planning to propositional logic. However, grounding involves instantiating all rules and actions with concrete object combinations, and results in large encodings for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78f8c7931de6c856766b455cdb4f7bd3
https://doi.org/10.1609/icaps.v32i1.19817
https://doi.org/10.1609/icaps.v32i1.19817
Autor:
Casper Abild Larsen, Simon Meldahl Schmidt, Jesper Steensgaard, Anna Blume Jakobsen, Jaco van de Pol, Andreas Pavlogiannis
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783031308192
Decomposing a directed graph to its strongly connected components (SCCs) is a fundamental task in model checking. To deal with the state-space explosion problem, graphs are often represented symbolically using binary decision diagrams (BDDs), which h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::169f39dc97917e0112b624d2a03fa933
https://doi.org/10.1007/978-3-031-30820-8_22
https://doi.org/10.1007/978-3-031-30820-8_22
