Concurrent regular expressions and their relationship to Petri nets

DOI10.1016/0304-3975(92)90339-HzbMath0745.68080WikidataQ126778755 ScholiaQ126778755MaRDI QIDQ1184987

Vijay K. Garg, M. T. Ragunath

Publication date: 28 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

concurrent systemsspecificationalgebraic systemsconcurrent regular expressionslanguages of Petri nets

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)

Related Items (16)

Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids ⋮ Shuffled languages -- representation and recognition ⋮ Nested-unit Petri nets ⋮ Derivatives and partial derivatives for regular shuffle expressions ⋮ Regular binoid expressions and regular binoid languages. ⋮ Location automata for regular expressions with shuffle and intersection ⋮ Fair expressions and regular languages over lists ⋮ Location based automata for expressions with shuffle ⋮ Counter machines, Petri nets, and consensual computation ⋮ Methods for behavior descriptions of structure-complex Petri nets ⋮ Concurrency, Synchronization, and Conflicts in Petri Nets ⋮ Kleene Theorems for Product Systems ⋮ Derivatives for Regular Shuffle Expressions ⋮ Series-parallel languages and the bounded-width property ⋮ Shuffle languages are in P ⋮ Kleene Theorems for Synchronous Products with Matching

Uses Software

• COSY
• Path Pascal

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrent regular expressions and their relationship to Petri nets