Publication:3975146
From MaRDI portal
zbMath0755.68095MaRDI QIDQ3975146
Goltz, Ursula, Robert J. van Glabbeek
Publication date: 26 June 1992
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q55: Semantics in the theory of computing
Related Items
Action Refinement in Process Algebra and Security Issues, Towards the hierarchical verification of reactive systems, Models for name-passing processes: Interleaving and causal, Petri nets and bisimulation, A theory of processes with durational actions, Bisimulation and action refinement, Universal axioms for bisimulations, Refinement of actions in event structures and causal trees, Failures semantics based on interval semiwords is a congruence for refinement, A theory of system behaviour in the presence of node and link failure, \(\tau\)-bisimulations and full abstraction for refinement of actions, Maximality preserving bisimulation, Towards an algebra for timed behaviours, The semantics of the combination of atomized statements and parallel choice, When is partial trace equivalence adequate?, Automatizing parametric reasoning on distributed concurrent systems, Deciding true concurrency equivalences on safe, finite nets, The difference between splitting in \(n\) and \(n+1\), Presheaf models for CCS-like languages, Undecidability of domino games and hhp-bisimilarity., Towards a unified view of bisimulation: A comparative study, Zero-safe nets: Comparing the collective and individual token approaches., Bisimilarity of open terms., Causality versus true-concurrency, Refinement of actions for real-time concurrent systems with causal ambiguity, Petri net reactive modules, Decidability of performance equivalence for basic parallel processes, Concurrent bisimulations in Petri nets
