Bisimulation and action refinement

DOI10.1016/0304-3975(93)90157-OzbMATH Open0778.68060MaRDI QIDQ685407FDOQ685407

Authors: Walter Vogler 

Publication date: 17 October 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article
• Publication:5750408
• Refinement of actions and equivalence notions for concurrent systems
• scientific article
• scientific article; zbMATH DE number 17804

zbMATH Keywords

bisimulationconcurrent systemsAction refinementsilent movestrue concurrency

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Cites Work

• Petri nets, event structures and domains. I
• Concurrent bisimulations in Petri nets
• Algebraic laws for nondeterminism and concurrency
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Calculi for synchrony and asynchrony
• On interprocess communication. I: Basic formalism
• Modeling concurrency with partial orders
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Advances in Petri nets 1992
• Maximality preserving bisimulation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Failures semantics based on interval semiwords is a congruence for refinement

Cited In (28)

• Action refinement applied to late decisions
• Pomset bisimulation and unfolding for reset Petri nets
• Title not available (Why is that?)
• Maximality preserving bisimulation
• Symmetric and Asymmetric Asynchronous Interaction
• Refinement of actions and equivalence notions for concurrent systems
• Formal Techniques for Networked and Distributed Systems - FORTE 2005
• Title not available (Why is that?)
• ENFORCING CONCURRENT TEMPORAL BEHAVIORS
• The difference between splitting in \(n\) and \(n+1\)
• Towards the hierarchical verification of reactive systems
• Vertical implementation
• Action refinement and property inheritance in systems of sequential agents
• A bisimulation for dynamic sealing
• The limit of splitn-language equivalence
• Towards a unified view of bisimulation: A comparative study
• Model refinement using bisimulation quotients
• A reduced maximality labeled transition system generation for recursive Petri nets
• Team equivalences for finite-state machines with silent moves
• Contextual equivalences in configuration structures and reversibility
• Taking decisions late: end-based choice combined with action refinement
• Title not available (Why is that?)
• Bisimulation can't be traced
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deciding true concurrency equivalences on safe, finite nets
• New Bisimulation Semantics for Distributed Systems

This page was built for publication: Bisimulation and action refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685407)