Efficient Contextual Unfolding
From MaRDI portal
Publication:3090840
DOI10.1007/978-3-642-23217-6_23zbMATH Open1343.68176OpenAlexW1916795171MaRDI QIDQ3090840FDOQ3090840
Authors: César Rodríguez, Stefan Schwoon, Paolo Baldan 
Publication date: 2 September 2011
Published in: CONCUR 2011 – Concurrency Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23217-6_23
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
- Unfoldings: A partial-order approach to model checking.
- An improvement of McMillan's unfolding algorithm
- Title not available (Why is that?)
- McMillan’s Complete Prefix for Contextual Nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient unfolding of contextual Petri nets
- Title not available (Why is that?)
- On the computation of McMillan's prefix for contextual nets and graph grammars
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
- On the computation of McMillan's prefix for contextual nets and graph grammars
- Contextual Petri nets, asymmetric event structures, and processes
- Verification of Petri nets with read arcs
- Contextual merged processes
- Contextual nets
Uses Software
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)
