Pomset bisimulation and unfolding for reset Petri nets

DOI10.1016/j.ic.2020.104674OpenAlexW3112796942MaRDI QIDQ2113378

David Delfieu, Thomas Chatain, Maurice Comlan, 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

zbMATH Keywords

unfoldingpomset behaviourreset Petri nets

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

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

Cites Work

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

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