scientific article
From MaRDI portal
Publication:4035680
zbMATH Open0773.68052MaRDI QIDQ4035680FDOQ4035680
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Cited In (11)
- The box algebra = Petri nets + process expressions
- Failures semantics based on interval semiwords is a congruence for refinement
- Concurrent testing of processes
- Normalization of place/transition-systems preserves net behaviour
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- A bisimulation for dynamic sealing
- Concurrent bisimulations in Petri nets
- \(\tau\)-bisimulations and full abstraction for refinement of actions
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- Bisimulation and action refinement
- Bisimulation can't be traced
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035680)