Testing equivalences of time Petri nets

DOI10.1134/S0361768820040040zbMath1455.68118OpenAlexW3048271228MaRDI QIDQ2217206

E. N. Bozhenkova, I. B. Virbitskaite

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768820040040

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative trace semantics of time Petri nets
• An event structure semantics for general Petri nets
• Refinement of actions in event structures and causal trees
• Extensional equivalences for transition systems
• Testing equivalences for processes
• Comparing the worst-case efficiency of asynchronous systems with PAFAS
• A causal semantic for time Petri nets
• A process algebra for timed systems
• ``Truly concurrent and nondeterministic semantics of discrete-time Petri nets
• On Causal Semantics of Petri Nets
• True Concurrent Equivalences in Time Petri Nets*
• Causal testing
• Timed processes of Timed Petri Nets
• Formal Methods for the Design of Real-Time Systems

This page was built for publication: Testing equivalences of time Petri nets