Kleene Theorems for Synchronous Products with Matching
From MaRDI portal
Publication:5268457
DOI10.1007/978-3-662-48650-4_5zbMath1366.68150OpenAlexW2405059328MaRDI QIDQ5268457
Ramchandra Phawade, Kamal Lodaya
Publication date: 20 June 2017
Published in: Transactions on Petri Nets and Other Models of Concurrency X (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.698.2240
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Partial derivatives of regular expressions and finite automaton constructions
- Concurrent regular expressions and their relationship to Petri nets
- Series-parallel languages and the bounded-width property
- Distributed automata in an assumption-commitment framework
- Rabin's theorem in the concurrency setting: a conjecture
- Corrigendum to our paper: How Expressions Can Code for Automata
- Notes on finite asynchronous automata
- How expressions can code for automata
- Free Choice Petri Nets
- Automata on Distributed Alphabets
- Kleene Theorems for Product Systems
- Derivatives of Regular Expressions
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
This page was built for publication: Kleene Theorems for Synchronous Products with Matching
