Automata and processes on multisets of communicating objects

DOI10.1007/S11047-010-9206-0zbMath1207.68150OpenAlexW2063124369MaRDI QIDQ609033

Yong Wang, Linmin Yang, Zhe Dang

Publication date: 30 November 2010

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-010-9206-0

zbMATH Keywords

P systemnetwork processesPresburger reachabilityservice automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• BPEL2oWFN

Cites Work

• Generalized communicating P systems
• Statecharts: a visual formalism for complex systems
• Mobile ambients
• Computing with membranes
• Semigroups, Presburger formulas, and languages
• Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing
• Operating Guidelines for Finite-State Services
• ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
• ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automata and processes on multisets of communicating objects