scientific article
From MaRDI portal
Publication:3030239
zbMath0626.68022MaRDI QIDQ3030239
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)
Related Items (only showing first 100 items - show all)
On concurrent games with payoff ⋮ Behavioural logics for configuration structures ⋮ Contracts as games on event structures ⋮ Unfolding Grammars in Adhesive Categories ⋮ A verified algorithm enumerating event structures ⋮ Domain and event structure semantics for Petri nets with read and inhibitor arcs ⋮ Atomicity, coherence of information, and point-free structures ⋮ Clustering for Petri nets ⋮ Well-behaved flow event structures for parallel composition and action refinement ⋮ Configuration structures, event structures and Petri nets ⋮ Denotational semantics in the cpo and metric approach ⋮ Labelled domains and automata with concurrency ⋮ A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources ⋮ Schedulers and Finishers: On Generating the Behaviours of an Event Structure ⋮ Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) ⋮ Interleaving set temporal logic ⋮ Concurrent Kleene Algebra ⋮ A compositional proof system on a category of labelled transition systems ⋮ Reduction of event structures under history preserving bisimulation ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Concurrent transition systems ⋮ From model checking to equilibrium checking: reactive modules for rational verification ⋮ Concurrency and atomicity ⋮ Event structures and domains ⋮ Unfolding semantics of graph transformation ⋮ A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Petri nets, traces, and local model checking ⋮ Parallel product of event structures ⋮ Combining behavioural types with security analysis ⋮ Reversibility and asymmetric conflict in event structures ⋮ Towards a categorical representation of reversible event structures ⋮ Nested-unit Petri nets ⋮ Expressiveness of concurrent intensionality ⋮ The Configuration Space of a Robotic Arm in a Tunnel ⋮ Unfolding Graph Transformation Systems: Theory and Applications to Verification ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Producing Short Counterexamples Using “Crucial Events” ⋮ Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict ⋮ Some behavioural aspects of net theory ⋮ Non-deterministic information systems and their domains ⋮ Unfolding-based diagnosis of systems with an evolving topology ⋮ Weighted models for higher-order computation ⋮ From Qualitative to Quantitative Semantics ⋮ Local Model Checking in a Logic for True Concurrency ⋮ Workshop on Petri Nets and Graph Transformations ⋮ Grammar Morphisms and Weakly Adhesive Categories ⋮ Dynamic Partial Order Reduction Using Probe Sets ⋮ Universal homogeneous event structures and domains ⋮ From domains to automata with concurrency ⋮ A model of intuitionistic affine logic from stable domain theory ⋮ Non sequential semantics for contextual P/T nets ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Extensional Petri net ⋮ Event structures and trace monoids ⋮ Bayesian strategies: probabilistic programs as generalised graphical models ⋮ An event structure semantics for general Petri nets ⋮ Process versus unfolding semantics for Place/Transition Petri nets ⋮ Petri nets and bisimulation ⋮ On the nature of events: another perspective in concurrency ⋮ Elementary transition systems ⋮ Probabilistic rely-guarantee calculus ⋮ How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings ⋮ On the Origin of Events: Branching Cells as Stubborn Sets ⋮ Causal automata ⋮ Towards an algebra for timed behaviours ⋮ The poset of infinitary traces ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ Mitigating covert channels based on analysis of the potential for communication ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Concurrency for Graph Grammars in a Petri net shell ⋮ Concurrent Kleene algebra and its foundations ⋮ Distributed temporal logic for the analysis of security protocol models ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ Refinement of actions for real-time concurrent systems with causal ambiguity ⋮ On the expressiveness of higher dimensional automata ⋮ Unnamed Item ⋮ Teaching Concurrency Concepts to Freshmen ⋮ Graphical models of separation logic ⋮ On the Hardness of Proving CCA-Security of Signed ElGamal ⋮ Bayesian network semantics for Petri nets ⋮ Transactions and contracts based on reaction systems ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Dynamical systems and sheaves ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ Partial Orders, Event Structures and Linear Strategies ⋮ Algebra and theory of order-deterministic pomsets ⋮ Representation of computations in concurrent automata by dependence orders ⋮ Recursive domain equations for concrete data structure ⋮ Membership problems for regular and context-free trace languages ⋮ A Theory of Distributed Markov Chains ⋮ Minimisation of event structures ⋮ Unified mathematical framework for slicing and symmetry reduction over event structures ⋮ Objects and classes in Algol-like languages ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Finite labelling problem in event structures ⋮ Closure functions and general iterates as reflectors ⋮ Reversibility and Models for Concurrency ⋮ Truly concurrent constraint programming ⋮ Elementary transition systems and refinement
This page was built for publication:
