Causal Semantics for BPP Nets with Silent Moves

DOI10.3233/FI-2021-2039MaRDI QIDQ5164874zbMATH OpenOpenAlexFDO

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

causality Petri nets BPP team bisimulation weak and branching bisimulation

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

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

Cites work

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

Describes a project that uses

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)