scientific article
From MaRDI portal
Publication:3975146
zbMath0755.68095MaRDI QIDQ3975146
Goltz, Ursula, Robert J. van Glabbeek
Publication date: 26 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)
Related Items
History-preserving bisimilarity for higher-dimensional automata via open maps, When is partial trace equivalence adequate?, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Towards refinable choreographies, Automatizing parametric reasoning on distributed concurrent systems, Behavioural characterizations of partial order logics, On the expressive power of behavioral profiles, Concurrent bisimulations in Petri nets, Reduction of event structures under history preserving bisimulation, Deciding true concurrency equivalences on safe, finite nets, Contextual equivalences in configuration structures and reversibility, The difference between splitting in \(n\) and \(n+1\), Towards the hierarchical verification of reactive systems, Models for name-passing processes: Interleaving and causal, The true concurrency of differential interaction nets, Synchronous and asynchronous communication(s) between three parties, Functional equivalences of Petri nets, Dynamic matrices and the cost analysis of concurrent programs, Interleaving vs True Concurrency: Some Instructive Security Examples, A Study on Team Bisimulations for BPP Nets, Presheaf models for CCS-like languages, Undecidability of domino games and hhp-bisimilarity., Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets, Bisimulation, games, and logic, Unnamed Item, Team equivalences for finite-state machines with silent moves, Deciding true concurrency equivalences on finite safe nets (preliminary report), Behavioural equivalence for infinite systems — Partially decidable!, Team bisimilarity, and its associated modal logic, for BPP nets, \(\tau\)-bisimulations and full abstraction for refinement of actions, A theory of system behaviour in the presence of node and link failure, Petri nets and bisimulation, Causality versus true-concurrency, A theory of processes with durational actions, The limit of splitn-language equivalence, Maximality preserving bisimulation, Bisimulation and action refinement, Universal axioms for bisimulations, Towards an algebra for timed behaviours, Refinement of actions in event structures and causal trees, Causal Semantics for BPP Nets with Silent Moves, On logical and concurrent equivalences, Concurrency for Graph Grammars in a Petri net shell, Refinement of actions for real-time concurrent systems with causal ambiguity, Unnamed Item, Petri net reactive modules, Decidability of performance equivalence for basic parallel processes, A study on team bisimulation and H-team bisimulation for BPP nets, The semantics of the combination of atomized statements and parallel choice, Granularity and Concurrent Separation Logic, Failures semantics based on interval semiwords is a congruence for refinement, Dynamic Causality in Event Structures, Towards a unified view of bisimulation: A comparative study, Non-interleaving bisimulation equivalences on basic parallel processes, Action Refinement in Process Algebra and Security Issues, Zero-safe nets: Comparing the collective and individual token approaches., Bisimilarity of open terms., Pomset bisimulation and unfolding for reset Petri nets
