699 citations
- Centre National de la Recherche ScientifiqueFR34 papers
- Max Planck Institute for InformaticsDE33 papers
- German Research Centre for Artificial IntelligenceDE24 papers
- Forschungszentrum JülichDE17 papers
- Karlsruhe Institute of TechnologyDE16 papers
- Helmholtz Center for Information SecurityDE14 papers
- RWTH Aachen UniversityDE14 papers
- University of KaiserslauternDE14 papers
- University of StuttgartDE12 papers
- ETH ZurichCH11 papers
- Universitat Autònoma de BarcelonaES11 papers
- Iowa State UniversityUS10 papers
12 papers · 1 filter
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Dmitry Chistikov, Wojciech Czerwiński, Filip Mazowiecki +3
Vector Addition Systems with States (VASS), equivalent to Petri nets, are a well-established model of concurrency. The central algorithmic challenge in VASS is the reachability pro…
Approximate Automata for Omega-Regular Languages
Rayna Dimitrova, Bernd Finkbeiner, Hazem Torfah
Automata over infinite words, also known as omega-automata, play a key role in the verification and synthesis of reactive systems. The spectrum of omega-automata is defined by two…
Canonical Representations of k-Safety Hyperproperties
Bernd Finkbeiner, Lennart Haas, Hazem Torfah
Hyperproperties elevate the traditional view of trace properties form sets of traces to sets of sets of traces and provide a formalism for expressing information-flow policies. For…
Automatic Optimizations for Stream-based Monitoring Languages
Jan Baumeister, Bernd Finkbeiner, Matthis Kruse +1
Runtime monitors that are specified in a stream-based monitoring language tend to be easier to understand, maintain, and reuse than those written in a standard programming language…
Fluid Model Checking of Timed Properties
Luca Bortolussi, Roberta Lanciani
We address the problem of verifying timed properties of Markovian models of large populations of interacting agents, modelled as finite state automata. In particular, we focus on t…
Cost Preserving Bisimulations for Probabilistic Automata
Andrea Turrini, Holger Hermanns
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled…