Concurrent histories: a basis for observing distributed systems
From MaRDI portal
DOI10.1016/0022-0000(87)90032-8zbMATH Open0619.68017OpenAlexW2027256978MaRDI QIDQ1089787FDOQ1089787
Authors: Pierpaolo Degano, Ugo Montanari 
Publication date: 1987
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(87)90032-8
Recommendations
bisimulationprocessesCCSobservational equivalencesdistributed transition systemsP/T netsPetri C/E systems
Cites Work
- COSY - a system specification language based on paths and processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- The non-sequential behaviour of Petri nets
- Title not available (Why is that?)
- Time, clocks, and the ordering of events in a distributed system
- A Theory of Communicating Sequential Processes
- Power domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A partial ordering semantics for CCS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Behaviours of concurrent systems
- Semantics of communicating processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- Relational structures model of concurrency
- A partial ordering semantics for CCS
- Proved trees
- Automatizing parametric reasoning on distributed concurrent systems
- A distributed operational semantics of CCS based on condition/event systems
- Title not available (Why is that?)
- Partial ordering models for concurrency can be defined operationally
- Title not available (Why is that?)
- Title not available (Why is that?)
- From states to histories relating state and history views onto systems
- Petri nets are monoids
- Relational structures for concurrent behaviours
- Making the unobservable, unobservable
- Graph-Based Design and Analysis of Dynamic Software Architectures
- Ugo Montanari and Concurrency Theory
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Title not available (Why is that?)
- Appraising fairness in languages for distributed programming
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- Models and logics for true concurrency.
- On continuous time agents
- Universal axioms for bisimulations
- Extended transition systems for parametric bisimulation
- Title not available (Why is that?)
- An algebraic characterisation of elementary net system (observable) state space
- An algebraic view of interleaving and distributed operational semantics for CCS
- Event structure semantics for multiparty sessions
- Modeling concurrency with interval traces
- Structure of concurrency
Uses Software
This page was built for publication: Concurrent histories: a basis for observing distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1089787)
