Taking complete finite prefixes to high level, symbolically

DOI10.1007/978-3-031-33620-1_7zbMATH Open1541.68263MaRDI QIDQ6535189FDOQ6535189

Authors: Nick Würdemann, Thomas Chatain, Stefan Haar 

Publication date: 16 November 2023

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

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)

Cites Work

• Petri nets, event structures and domains. I
• Understanding Petri Nets
• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• A technique of state space search based on unfolding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• Title not available (Why is that?)
• Complete Finite Prefixes of Symbolic Unfoldings of Safe Time 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.
• Title not available (Why is that?)
• Applications and Theory of Petri Nets 2004
• Factorization properties of symbolic unfoldings of colored Petri nets

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)