Pomset bisimulation and unfolding for reset Petri nets

DOI10.1016/J.IC.2020.104674OpenAlexW3112796942MaRDI QIDQ2113378FDOQ2113378

Authors: Thomas Chatain, Maurice Comlan, David Delfieu, Loïg Jezequel, Olivier H. Roux 

Publication date: 14 March 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2020.104674

Recommendations

• Pomsets and unfolding of reset Petri nets
• A polynomial \(\lambda\)-bisimilar normalization for reset Petri nets
• Faster Unfolding of General Petri Nets Based on Token Flows
• scientific article; zbMATH DE number 1361137
• scientific article; zbMATH DE number 1863174

zbMATH Keywords

unfoldingpomset behaviourreset Petri nets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Petri nets, event structures and domains. I
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Concurrent bisimulations in Petri nets
• Title not available (Why is that?)
• The non-sequential behaviour of Petri nets
• Contextual Petri nets, asymmetric event structures, and processes
• Unfoldings: A partial-order approach to model checking.
• An improvement of McMillan's unfolding algorithm
• Diagnosis of asynchronous discrete-event systems: a net unfolding approach
• Bisimulation and action refinement
• Sequential and concurrent behaviour in Petri net theory
• Title not available (Why is that?)
• Contextual nets
• Partial order semantics and read arcs
• Non sequential semantics for contextual P/T nets
• Title not available (Why is that?)
• Normalization of place/transition-systems preserves net behaviour

Cited In (1)

• Special issue: Selected papers of the 12th international conference on language and automata theory and applications, LATA 2018

This page was built for publication: Pomset bisimulation and unfolding for reset Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113378)