Bisimulation from open maps
From MaRDI portal
Publication:1923101
DOI10.1006/inco.1996.0057zbMath0856.68067OpenAlexW2039290601MaRDI QIDQ1923101
Glynn Winskel, Mogens Nielsen, André Joyal
Publication date: 3 February 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0a65011e11b4e9e6f8f185b76421ce66c8ebb2e7
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
History-preserving bisimilarity for higher-dimensional automata via open maps, Distributed probabilistic and quantum strategies, A hierarchy of reverse bisimulations on stable configuration structures, Behavioural logics for configuration structures, Weak equivalence of higher-dimensional automata, A categorical framework for congruence of applicative bisimilarity in higher-order languages, Bisimulation maps in presheaf categories, Transition systems from event structures revisited, The Hennessy-Milner equivalence for continuous time stochastic logic with mu-operator, Natural Homology, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, Model-Checking Games for Fixpoint Logics with Partial Order Models, Contextual equivalences in configuration structures and reversibility, Languages of higher-dimensional automata, Models for name-passing processes: Interleaving and causal, A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA)., Open maps, behavioural equivalences, and congruences, Unnamed Item, Bisimilarity of Diagrams, Constructing process categories, A coalgebraic semantics for causality in Petri nets, Weighted and branching bisimilarities from generalized open maps, Towards categorical models for fairness: Fully abstract presheaf semantics of SCCS with finite delay, Presheaf models for CCS-like languages, Undecidability of domino games and hhp-bisimilarity., Arboreal Categories: An Axiomatic Theory of Resources, Contextuality in distributed systems, Directed homology theories and Eilenberg-Steenrod axioms, Local factorization of trajectory lifting morphisms for single-input affine control systems, System theory for system identification., Bisimulation for probabilistic transition systems: A coalgebraic approach, A description based on languages of the final non-deterministic automaton, Domain theory for concurrency, Topological aspects of traces, Team bisimilarity, and its associated modal logic, for BPP nets, Petri nets and bisimulation, Causality versus true-concurrency, On logical and concurrent equivalences, Unifying behavioral equivalences of timed transition systems, Model-checking games for fixpoint logics with partial order models, Event Identifier Logic, Weak factorizations, fractions and homotopies, Unprovability of the logical characterization of bisimulation, On the computational complexity of bisimulation, redux, A coalgebraic presentation of structured transition systems, On the structure of categories of coalgebras, Unnamed Item, A Logic for True Concurrency, Bisimulation for labelled Markov processes, Branching time controllers for discrete event systems, New Bisimulation Semantics for Distributed Systems, Formal composition of hybrid systems, Logics and Bisimulation Games for Concurrency, Causality and Conflict, Controller synthesis for bisimulation equivalence, Approximating Markov Processes by Averaging, A coalgebraic view on reachability, Dynamical systems and sheaves, A study on team bisimulation and H-team bisimulation for BPP nets, Algebra and logic for resource-based systems modelling, Petri nets, traces, and local model checking, Concrete Process Categories, Towards a unified view of bisimulation: A comparative study, Bisimulation Relations for Dynamical and Control Systems, Paths and Simulations, Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus, Bisimulation relations for dynamical, control, and hybrid systems, Minimisation of event structures, Universal coalgebra: A theory of systems, A representation result for free cocompletions, Non-interleaving bisimulation equivalences on basic parallel processes, Formalizing abstract computability: Turing categories in Coq, Relational presheaves, change of base and weak simulation, Event Structures with Symmetry, Reversibility and Models for Concurrency, Compositional SOS and beyond: A coalgebraic view of open systems
