Models of nondeterministic regular expressions

DOI10.1006/JCSS.1999.1636zbMath0958.68090OpenAlexW1970058891MaRDI QIDQ1970200

Rocco De Nicola, Anna Labella, Flavio Corradini

Publication date: 19 March 2000

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1636

zbMATH Keywords

concurrent systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Resource Bisimilarity in Petri Nets is Decidable ⋮ Revisiting sequential composition in process calculi ⋮ Nondeterministic regular expressions as solutions of equational systems. ⋮ Resource bisimilarity and graded bisimilarity coincide ⋮ A Finite Axiomatization of Nondeterministic Regular Expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graded modalities. I
• Characterizing finite Kripke structures in propositional temporal logic
• Complete systems of \(\mathcal B\)-rational identities
• Iteration theories of synchronization trees
• Enriched categorical semantics for distributed calculi
• A completeness theorem for Kleene algebras and the algebra of regular events
• A complete equational axiomatization for prefix iteration
• Fixed points in free process algebras. I
• Axiomatizing prefix iteration with silent steps
• Une remarque sur les systèmes complets d'identités rationnelles
• Algebraic laws for nondeterminism and concurrency
• The Category-Theoretic Solution of Recursive Domain Equations
• Process Algebra
• A completeness theorem for nondeterministic Kleene algebras
• Two Complete Axiom Systems for the Algebra of Regular Events
• On the Forms of the Predicates in the Theory of Constructive Ordinals

This page was built for publication: Models of nondeterministic regular expressions