scientific article; zbMATH DE number 4018370
From MaRDI portal
Publication:3030239
zbMATH Open0626.68022MaRDI QIDQ3030239FDOQ3030239
Authors: Glynn Winskel 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Cited In (only showing first 100 items - show all)
- Event structures and domains
- Unfolding-based diagnosis of systems with an evolving topology
- The poset of infinitary traces
- Formal Relationships Between Geometrical and Classical Models for Concurrency
- Mitigating covert channels based on analysis of the potential for communication
- On concurrent games with payoff
- Denotational semantics in the cpo and metric approach
- Behavioural logics for configuration structures
- Causal automata
- Nested-unit Petri nets
- Non-deterministic information systems and their domains
- Non sequential semantics for contextual P/T nets
- Petri nets and bisimulation
- Title not available (Why is that?)
- Labelled domains and automata with concurrency
- Title not available (Why is that?)
- Unfolding Grammars in Adhesive Categories
- Contracts as games on event structures
- Concurrency and atomicity
- Universal homogeneous event structures and domains
- Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly
- Distributed temporal logic for the analysis of security protocol models
- Towards an algebra for timed behaviours
- Extensional Petri net
- Typed event structures and the linear \(\pi \)-calculus
- On the nature of events: another perspective in concurrency
- Reversibility and models for concurrency
- Configuration structures, event structures and Petri nets
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Atomicity, coherence of information, and point-free structures
- Bundle event structures and CCSP.
- Objects and classes in Algol-like languages
- Truly concurrent constraint programming
- The difference between splitting in \(n\) and \(n+1\)
- Concurrent Kleene algebra and its foundations
- Bayesian network semantics for Petri nets
- Unfolding semantics of graph transformation
- Elementary transition systems
- An event structure semantics for general Petri nets
- The configuration space of a robotic arm over a graph
- Event structures with disabling/enabling relation and event automata
- Reduction of event structures under history preserving bisimulation
- Concurrent graph and term graph rewriting
- Action refinement and property inheritance in systems of sequential agents
- Graphical models of separation logic
- Causal Unfoldings and Disjunctive Causes
- Reversibility and asymmetric conflict in event structures
- A compositional proof system on a category of labelled transition systems
- Interleaving set temporal logic
- Unfolding Graph Transformation Systems: Theory and Applications to Verification
- On the expressiveness of higher dimensional automata
- Combining behavioural types with security analysis
- Process versus unfolding semantics for Place/Transition Petri nets
- From model checking to equilibrium checking: reactive modules for rational verification
- Event structures and trace monoids
- Membership problems for regular and context-free trace languages
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Finite labelling problem in event structures
- Some behavioural aspects of net theory
- Truly concurrent constraint programming
- EMSO-definability of some languages with event structures
- Dynamical systems and sheaves
- From domains to automata with concurrency
- Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence)
- Parallel product of event structures
- On relating some models for concurrency
- Concurrent transition systems
- Probabilistic rely-guarantee calculus
- Recursive domain equations for concrete data structure
- Ensuring liveness properties of distributed systems: open problems
- Closure functions and general iterates as reflectors
- Partial Orders, Event Structures and Linear Strategies
- Algebra and theory of order-deterministic pomsets
- Concurrent Kleene Algebra
- Event Structure Semantics for Nominal Calculi
- A Theory of Distributed Markov Chains
- Bundle event structures: a revised cpo approach.
- Petri nets, traces, and local model checking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrency for Graph Grammars in a Petri net shell
- Bayesian strategies: probabilistic programs as generalised graphical models
- Title not available (Why is that?)
- Grammar Morphisms and Weakly Adhesive Categories
- Elementary transition systems and refinement
- Unified mathematical framework for slicing and symmetry reduction over event structures
- On Obligations
- Representation of computations in concurrent automata by dependence orders
- Rabin's theorem in the concurrency setting: a conjecture
- Title not available (Why is that?)
- Clustering for Petri nets
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
- Concrete data structures and functional parallel programming
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- Denotational, causal, and operational determinism in event structures
- Towards a categorical representation of reversible event structures
- Simultaneity in event structures
- Modelling mutual exclusion in a process algebra with time-outs
- Title not available (Why is that?)
- Concurrency-Preserving Minimal Process Representation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030239)
