Search
Search Results
-
Branching Place Bisimilarity: A Decidable Behavioral Equivalence for Finite Petri Nets with Silent Moves
Place bisimilarity \(\sim _p\) is a...
-
Team bisimilarity, and its associated modal logic, for BPP nets
BPP nets, a subclass of finite Place/Transition Petri nets, are equipped with an efficiently decidable, truly concurrent, bisimulation-based,...
-
Interleaving vs True Concurrency: Some Instructive Security Examples
Information flow security properties were defined some years ago in terms of suitable equivalence checking problems. These definitions were provided...
-
A Study on Team Bisimulations for BPP Nets
BPP nets, a subclass of finite P/T nets, were equipped in [13] with an efficiently decidable, truly concurrent, behavioral equivalence, called team...
-
Axiomatizing Team Equivalence for Finite-State Machines
Finite-state machines, a simple class of finite Petri nets, were equipped in [10] with a truly concurrent, bisimulation-based, behavioral...
-
Toward Distributed Computability Theory
It is usually argued that Turing-complete models of computations are equally expressive. However, the author shows that there are problems in...
-
Process Algebras for Petri Nets The Alphabetization of Distributed Systems
This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely...
-
Generalizations and Variant Semantics
A few possible extensions and variant semantics are discussed. They are related to (i) representing all Petri nets labeled over the set Act of...
-
Petri Nets
Finite Place/Transition Petri nets are introduced as a suitable semantic model for distributed systems. As this semantic model is not...
-
Adding Multi-party Communication: FNM
FNC is enhanced with a simple operator for atomicity, called strong prefixing, so that action sequences can be used as labels for transitions....
-
Adding Asynchronous Parallel Composition: CFM and BPP
SFM is extended with the operator of asynchronous (i.e., without synchronization capabilities) parallel composition in two steps: first, by adding...
-
Adding Atomic Tests for Absence: NPL
FNM is extended with a construct for atomic tests, which is exploited to check the absence of those parallel processes whose presence may impede the...
-
Introduction
This introductory chapter outlines the main problem dealt with in this book: finding suitable languages for representing classes of Petri nets,...
-
Adding Communication and Restriction: FNC
The parallel composition operator is enhanced to allow for synchronous, point-to-point (or handshake) communication; moreover, in order to force...
-
The Basic Calculus: SFM
The sequential calculus SFM (acronym of Sequential Finite-state Machines) is equipped with an operational LTS semantics and an operational Petri net...
-
Labeled Transition Systems
Labeled transition systems are presented as a suitable interleaving semantic model for distributed systems. Some notions of behavioral equivalence...
-
Erratum to: Formal Methods for Open Object-Based Distributed Systems
Erratum to: R. Gorrieri and H. Wehrheim (Eds.) Formal Methods for Open Object-Based Distributed Systems DOI:...
-
Language representability of finite place/transition Petri nets
Finite-net multi-CCS is a CCS-like calculus which is able to model atomic sequences of actions and, together with parallel composition, also...
-
Introduction to Concurrency Theory Transition Systems and CCS
This book presents the fundamentals of concurrency theory with clarity and rigor. The authors start with the semantic structure, namely labelled...
-
Transition Systems and Behavioral Equivalences
Transition systems are introduced as a suitable semantic model of reactive systems. Some notions of behavioral equivalence are discussed, such as...