True concurrent equivalences in time Petri nets

DOI10.3233/FI-2016-1454zbMATH Open1380.68301OpenAlexW2565281326MaRDI QIDQ4589254FDOQ4589254

Authors: I. B. Virbitskaite, Dmitry Bushin, Eike Best 

Publication date: 9 November 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1454

Recommendations

• Comparing Semantics Under Strong Timing of Petri Nets
• Comparative trace semantics of time Petri nets
• Testing equivalences of time Petri nets
• scientific article; zbMATH DE number 4030999
• scientific article; zbMATH DE number 1534580

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (7)

• Equivalence between time consistency and nested formula
• Testing equivalences of time Petri nets
• Title not available (Why is that?)
• Observational equivalences for timed stable event structures
• Title not available (Why is that?)
• `True concurrency' semantics for time Petri nets with weak time and persistent atomic policies
• Title not available (Why is that?)

This page was built for publication: True concurrent equivalences in time Petri nets

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