Concurrent regular expressions and their relationship to Petri nets
From MaRDI portal
Publication:1184987
DOI10.1016/0304-3975(92)90339-HzbMath0745.68080WikidataQ126778755 ScholiaQ126778755MaRDI QIDQ1184987
Publication date: 28 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
concurrent systems; specification; algebraic systems; concurrent regular expressions; languages of Petri nets
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Fair expressions and regular languages over lists, Methods for behavior descriptions of structure-complex Petri nets, Kleene Theorems for Product Systems, Kleene Theorems for Synchronous Products with Matching, Location automata for regular expressions with shuffle and intersection, Shuffled languages -- representation and recognition, Counter machines, Petri nets, and consensual computation, Regular binoid expressions and regular binoid languages., Series-parallel languages and the bounded-width property, Shuffle languages are in P, Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids, Location based automata for expressions with shuffle, Nested-unit Petri nets, Derivatives and partial derivatives for regular shuffle expressions, Derivatives for Regular Shuffle Expressions, Concurrency, Synchronization, and Conflicts in Petri Nets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling concurrency with partial orders
- A calculus of communicating systems
- Petri nets and regular languages
- Computation sequence sets
- COSY - a system specification language based on paths and processes
- Spanner: A Tool for the Specification, Analysis, and Evaluation of Protocols
- CIRCAL and the representation of communication, concurrency, and time
- An Algorithm for the General Petri Net Reachability Problem
- Finitely recursive process models for discrete event systems
- Petri nets and szilard languages