Taking complete finite prefixes to high level, symbolically
From MaRDI portal
Publication:6622143
DOI10.3233/FI-242196MaRDI QIDQ6622143
Thomas Chatain, Stefan Haar, Lukas Panneke, Nick Würdemann
Publication date: 22 October 2024
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Petri nets, event structures and domains. I
- Branching processes of Petri nets
- A technique of state space search based on unfolding
- An improvement of McMillan's unfolding algorithm
- Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.
- Solving high-level Petri games
- Bounded Synthesis for Petri Games
- Factorization Properties of Symbolic Unfoldings of Colored Petri Nets
- Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
- Understanding Petri Nets
- Parameterized reachability trees for algebraic Petri nets
- Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Applications and Theory of Petri Nets 2004
- Unfolding Concurrent Well-Structured Transition Systems
- High-level representation of benchmark families for Petri games
- Taking complete finite prefixes to high level, symbolically
This page was built for publication: Taking complete finite prefixes to high level, symbolically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622143)
