scientific article

Alexander Rabinovich, B. A. Trakhtenbrot

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Petri nets behavior structures net models of concurrency nets over automata

Abstract data types; algebraic specification (68Q65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Theory of operating systems (68N25)

Related Items (57)

History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Behavioural logics for configuration structures ⋮ On relating some models for concurrency ⋮ Minimal transition systems for history-preserving bisimulation ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Automatizing parametric reasoning on distributed concurrent systems ⋮ An extension of the notions of traces and of asynchronous automata ⋮ Concurrent bisimulations in Petri nets ⋮ Reduction of event structures under history preserving bisimulation ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ On schematological equivalence of partially interpreted dataflow networks ⋮ Models for name-passing processes: Interleaving and causal ⋮ The true concurrency of differential interaction nets ⋮ Verification of finite-state machines: a distributed approach ⋮ Synchronous and asynchronous communication(s) between three parties ⋮ On nets, algebras and modularity ⋮ Temporal structures ⋮ Dynamic matrices and the cost analysis of concurrent programs ⋮ Characterising spectra of equivalences for event structures, logically ⋮ Read-write causality ⋮ Bisimilarity of Diagrams ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Presheaf models for CCS-like languages ⋮ Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra ⋮ Undecidability of domino games and hhp-bisimilarity. ⋮ Implementation of a reversible distributed calculus ⋮ Bisimulation, games, and logic ⋮ A partial ordering semantics for CCS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Team equivalences for finite-state machines with silent moves ⋮ Local Model Checking in a Logic for True Concurrency ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ Connectedness and synchronization ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ Modelling causality via action dependencies in branching time semantics ⋮ Location equivalence in a parametric setting ⋮ Petri nets and bisimulation ⋮ A theory of processes with durational actions ⋮ Maximality preserving bisimulation ⋮ Bisimulation and action refinement ⋮ Universal axioms for bisimulations ⋮ Conflict vs causality in event structures ⋮ Refinement of actions in event structures and causal trees ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ On logical and concurrent equivalences ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ Refinement of actions for real-time concurrent systems with causal ambiguity ⋮ On the expressiveness of higher dimensional automata ⋮ Unnamed Item ⋮ A Logic for True Concurrency ⋮ From Logic to Theoretical Computer Science – An Update ⋮ A parametric approach to localities ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ A completed hierarchy of true concurrent equivalences ⋮ Process languages and nets

This page was built for publication: