Bisimulation and action refinement
From MaRDI portal
Publication:685407
Recommendations
Cites work
- scientific article; zbMATH DE number 1638641 (Why is no real title available?)
- scientific article; zbMATH DE number 4180788 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4074506 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3735177 (Why is no real title available?)
- scientific article; zbMATH DE number 3744561 (Why is no real title available?)
- scientific article; zbMATH DE number 17804 (Why is no real title available?)
- scientific article; zbMATH DE number 176137 (Why is no real title available?)
- scientific article; zbMATH DE number 176514 (Why is no real title available?)
- scientific article; zbMATH DE number 176759 (Why is no real title available?)
- scientific article; zbMATH DE number 193318 (Why is no real title available?)
- scientific article; zbMATH DE number 1988986 (Why is no real title available?)
- scientific article; zbMATH DE number 3995041 (Why is no real title available?)
- scientific article; zbMATH DE number 4119653 (Why is no real title available?)
- scientific article; zbMATH DE number 4119655 (Why is no real title available?)
- Advances in Petri nets 1992
- Algebraic laws for nondeterminism and concurrency
- Calculi for synchrony and asynchrony
- Concurrent bisimulations in Petri nets
- Failures semantics based on interval semiwords is a congruence for refinement
- Maximality preserving bisimulation
- Modeling concurrency with partial orders
- On interprocess communication. I: Basic formalism
- Petri nets, event structures and domains. I
Cited in
(29)- scientific article; zbMATH DE number 4185040 (Why is no real title available?)
- Action refinement applied to late decisions
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- scientific article; zbMATH DE number 1759618 (Why is no real title available?)
- Towards a unified view of bisimulation: A comparative study
- A reduced maximality labeled transition system generation for recursive Petri nets
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- Contextual equivalences in configuration structures and reversibility
- The difference between splitting in \(n\) and \(n+1\)
- Pomset bisimulation and unfolding for reset Petri nets
- scientific article; zbMATH DE number 108007 (Why is no real title available?)
- Symmetric and asymmetric asynchronous interaction
- scientific article; zbMATH DE number 590996 (Why is no real title available?)
- Deciding true concurrency equivalences on safe, finite nets
- Refinement of actions and equivalence notions for concurrent systems
- Model refinement using bisimulation quotients
- Team equivalences for finite-state machines with silent moves
- Action refinement and property inheritance in systems of sequential agents
- New Bisimulation Semantics for Distributed Systems
- The limit of \(\operatorname{split}_n\)-language equivalence
- Vertical implementation
- scientific article; zbMATH DE number 1886073 (Why is no real title available?)
- Bisimulation can't be traced
- Superposition: composition vs refinement of non-deterministic, action-based systems
- Taking decisions late: end-based choice combined with action refinement
- Maximality preserving bisimulation
- Towards the hierarchical verification of reactive systems
- scientific article; zbMATH DE number 176514 (Why is no real title available?)
- A bisimulation for dynamic sealing
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)
