A verified algorithm enumerating event structures
From MaRDI portal
Publication:2364684
DOI10.1007/978-3-319-62075-6_17zbMath1367.68245arXiv1705.07228OpenAlexW2620363064MaRDI QIDQ2364684
Marco Bright Caminati, Juliana Küster-Filipe
Publication date: 21 July 2017
Full work available at URL: https://arxiv.org/abs/1705.07228
automated reasoningenumerationcountingformal methodslogicdiscreteevent structuresIsabelle/HOLverified algorithmOEIS
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Tests and proofs for custom data generators ⋮ Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation ⋮ Isabelle formalisation of original representation theorems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite labelling problem in event structures
- Conjugacy classes in unitriangular matrices.
- Contextual Petri nets, asymmetric event structures, and processes
- Mechanical Analysis of Finite Idempotent Relations
- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL
- Formal Proof of SCHUR Conjugate Function
- Decomposing Interactions
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Enumeration of AG-Groupoids
- The Transitive Reduction of a Directed Graph
- Event Structure Semantics for Nominal Calculi
This page was built for publication: A verified algorithm enumerating event structures
