Efficient Contextual Unfolding
From MaRDI portal
Publication:3090840
Recommendations
- Automated Deduction – CADE-20
- Fast universal coding with context models
- Efficient unfolding of contextual Petri nets
- Contextual reasoning distilled
- Computational Science - ICCS 2004
- Efficient local unfolding with ancestor stacks
- Efficient implementation of some contextual classification methods
- Efficient full higher-order unification
- On the relation between context and sequence unification
Cites work
- scientific article; zbMATH DE number 1799527 (Why is no real title available?)
- scientific article; zbMATH DE number 1189293 (Why is no real title available?)
- scientific article; zbMATH DE number 1304999 (Why is no real title available?)
- scientific article; zbMATH DE number 1744959 (Why is no real title available?)
- An improvement of McMillan's unfolding algorithm
- Efficient unfolding of contextual Petri nets
- McMillan’s Complete Prefix for Contextual Nets
- On the computation of McMillan's prefix for contextual nets and graph grammars
- Unfoldings: A partial-order approach to model checking.
Cited in
(9)- McMillan’s Complete Prefix for Contextual Nets
- Construction and SAT-based verification of contextual unfoldings
- Cunf: a tool for unfolding and verifying Petri nets with read arcs
- Efficient unfolding of contextual Petri nets
- Contextual Petri nets, asymmetric event structures, and processes
- On the computation of McMillan's prefix for contextual nets and graph grammars
- Verification of Petri nets with read arcs
- Contextual merged processes
- Contextual nets
This page was built for publication: Efficient Contextual Unfolding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090840)