Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communication and concurrency
Structured operational semantics and bisimulation as a congruence
Information and Computation
Three logics for branching bisimulation
Journal of the ACM (JACM)
Information systems engineering: a formal approach
Information systems engineering: a formal approach
Branching bisimilarity is an equivalence indeed!
Information Processing Letters
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
A uniform approach to true-concurrency and interleaving semantics for Petri nets
Theoretical Computer Science
Operational and denotational semantics for the box algebra
Theoretical Computer Science
Rooted branching bisimulation as a congruence
Journal of Computer and System Sciences
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Place Bisimulations in Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
A Generic Approach to Connector Architectures Part II: Instantiation to Petri Nets and CSP
Fundamenta Informaticae
Representations of Petri net interactions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Factorization properties of symbolic unfoldings of colored petri nets
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Fuzzy colored time Petri net and termination analysis for fuzzy Event-Condition-Action rules
Information Sciences: an International Journal
| Hi-index | 5.23 |
We propose a calculus for marked labelled nets (components), with places and transitions as atoms and merge, addition, fusion and relabelling as operators. The operators are defined using graph-based transformations; each net can be represented by a term. Next, we define both a step semantics for nets and a Plotkin-style SOS semantics for net terms and show their equivalence. In the semantics, both state-oriented and event-oriented properties of components can be expressed. We give a few rules for reducing components to smaller equivalent ones.