Causal Semantics for BPP Nets with Silent Moves

DOI10.3233/FI-2021-2039zbMATH Open1496.68224OpenAlexW3173785988MaRDI QIDQ5164874FDOQ5164874

Authors: Roberto Gorrieri 

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2021-2039

Recommendations

• Causal semantics for Petri nets with contacts
• On causal semantics of Petri nets (extended abstract)
• A causal semantics for CCS via rewriting logic
• A coalgebraic semantics for causality in Petri nets
• scientific article; zbMATH DE number 44349
• On the probabilistic bisimulation spectrum with silent moves
• scientific article; zbMATH DE number 1500583
• A causal semantic for time Petri nets
• Modelling causality via action dependencies in branching time semantics

zbMATH Keywords

causalityPetri netsBPPteam bisimulationweak and branching bisimulation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Concurrent bisimulations in Petri nets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Three Partition Refinement Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Understanding Petri Nets
• CCS expressions, finite state processes, and three problems of equivalence
• Branching time and abstraction in bisimulation semantics
• A complete inference system for a class of regular behaviours
• Nets, Terms and Formulas
• A complete axiomatisation for observational congruence of finite-state behaviours
• Non-interleaving bisimulation equivalences on basic parallel processes
• Sequential and concurrent behaviour in Petri net theory
• Branching bisimilarity is an equivalence indeed!
• Generalizing the Paige-Tarjan algorithm by abstract interpretation
• Bisimilarity Minimization in O(m logn) Time
• Title not available (Why is that?)
• An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation
• Introduction to concurrency theory. Transition systems and CCS
• Process algebras for Petri nets. The alphabetization of distributed systems
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• Team equivalences for finite-state machines with silent moves
• An \(O(m \log n)\) algorithm for branching bisimilarity on labelled transition systems
• A Study on Team Bisimulations for BPP Nets

Cited In (2)

• Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
• Team bisimilarity, and its associated modal logic, for BPP nets

Uses Software

• Algorithm 97

This page was built for publication: Causal Semantics for BPP Nets with Silent Moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164874)