The difference between splitting in \(n\) and \(n+1\)
From MaRDI portal
Publication:1370654
DOI10.1006/inco.1997.2634zbMath0889.68055OpenAlexW2129402326MaRDI QIDQ1370654
Robert J. van Glabbeek, Frits W. Vaandrager
Publication date: 26 October 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1997.2634
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (17)
A hierarchy of reverse bisimulations on stable configuration structures ⋮ Declarative event based models of concurrency and refinement in psi-calculi ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Bounded concurrency ⋮ Concurrent testing of processes ⋮ ST-structures ⋮ Unnamed Item ⋮ Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation ⋮ An axiomatic approach to reversible computation ⋮ Unnamed Item ⋮ The limit of splitn-language equivalence ⋮ Event Identifier Logic ⋮ On the expressiveness of higher dimensional automata ⋮ Action Refinement in Process Algebra and Security Issues ⋮ Synchronization languages and rewriting systems ⋮ Decidability of split equivalence ⋮ Reversibility and Models for Concurrency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bisimulation and action refinement
- Failures semantics based on interval semiwords is a congruence for refinement
- On interprocess communication. II: Algorithms
- Modeling concurrency with partial orders
- Petri nets, event structures and domains. I
- Adding action refinement to a finite process algebra
- Split and ST bisimulation semantics
- Timed testing of concurrent systems
- The limit of split\(_ n\)-language equivalence
- Towards action-refinement in process algebras
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Constructing two-writer atomic registers
- Axiomatising Finite Concurrent Processes
- Nets, Terms and Formulas
- CONCUR 2003 - Concurrency Theory
This page was built for publication: The difference between splitting in \(n\) and \(n+1\)
