2000 character limit reached
Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561
Published 11 Jul 2023 in cs.LO | (2307.05658v1)
Abstract: We discuss model-checking problems as formal models of algorithmic law. Specifically, we ask for an algorithmically tractable general purpose model-checking problem that naturally models the European transport Regulation 561, and discuss the reaches and limits of a version of discrete time stopwatch automata.
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.