Refinement of actions and equivalence notions for concurrent systems
From MaRDI portal
Publication:5925821
DOI10.1007/s002360000041zbMath0969.68081OpenAlexW1984801861MaRDI QIDQ5925821
Robert J. van Glabbeek, Goltz, Ursula
Publication date: 20 February 2001
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360000041
Related Items
Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity, A hierarchy of reverse bisimulations on stable configuration structures, Behavioural logics for configuration structures, Declarative event based models of concurrency and refinement in psi-calculi, Well-behaved flow event structures for parallel composition and action refinement, Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP, Comparative trace semantics of time Petri nets, Semantic domains of timed event structures, On the expressive power of behavioral profiles, Generating non-conspiratorial executions, Concurrent bisimulations in Petri nets, Rigid Families for the Reversible $$\pi $$ -Calculus, Reversing algebraic process calculi, ST-structures, Contextual equivalences in configuration structures and reversibility, Languages of higher-dimensional automata, Information flow in systems with schedulers. II: Refinement, Multilevel transitive and intransitive non-interference, causally, Synchronous and asynchronous communication(s) between three parties, Coupled similarity: the first 32 years, Characterising spectra of equivalences for event structures, logically, Posets with interfaces as a model for concurrency, When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Reversibility and asymmetric conflict in event structures, A stable non-interleaving early operational semantics for the pi-calculus, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, Synchrony versus causality in distributed systems, Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict, Deadlock checking by a behavioral effect system for lock handling, Unnamed Item, Local Model Checking in a Logic for True Concurrency, On the Origin of Events: Branching Cells as Stubborn Sets, Conflict vs causality in event structures, Unnamed Item, Unnamed Item, Non-interference by Unfolding, Unifying behavioral equivalences of timed transition systems, Model-checking games for fixpoint logics with partial order models, A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus, Event Identifier Logic, Ensuring liveness properties of distributed systems: open problems, Refinement of actions for real-time concurrent systems with causal ambiguity, On the expressiveness of higher dimensional automata, Unnamed Item, Unnamed Item, A Logic for True Concurrency, Model Checking for Action Abstraction, Logics and Bisimulation Games for Concurrency, Causality and Conflict, On Causal Semantics of Petri Nets, A completed hierarchy of true concurrent equivalences, Constructing weak simulations from linear implications for processes with private names, Minimisation of event structures, Action Refinement in Process Algebra and Security Issues, Vertical implementation, Reversibility and Models for Concurrency
