Taking complete finite prefixes to high level, symbolically

DOI10.1007/978-3-031-33620-1_7MaRDI QIDQ6535189zbMATH OpenFDO

Authors Nick Würdemann, Thomas Chatain, Stefan Haar

Publication date 16 November 2023

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1956601
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• scientific article; zbMATH DE number 1903382
• Canonical prefixes of Petri net unfoldings
• scientific article; zbMATH DE number 1670797

Cites work

• scientific article; zbMATH DE number 1670797 (Why is no real title available?)
• scientific article; zbMATH DE number 1956601 (Why is no real title available?)
• scientific article; zbMATH DE number 2087496 (Why is no real title available?)
• scientific article; zbMATH DE number 877807 (Why is no real title available?)
• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Applications and Theory of Petri Nets 2004
• Branching processes of Petri nets
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
• Factorization properties of symbolic unfoldings of colored Petri nets
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Petri nets, event structures and domains. I
• Understanding Petri Nets
• Unfolding Concurrent Well-Structured Transition Systems
• Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt.

Cited in

(1)

• 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 Q6535189)