Declarative event based models of concurrency and refinement in psi-calculi

DOI10.1016/j.jlamp.2015.12.007zbMath1352.68188OpenAlexW2267380002MaRDI QIDQ272301

Christian Johansen, Håkon Normann, Thomas Troels Hildebrandt

Publication date: 20 April 2016

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2015.12.007

zbMATH Keywords

concurrencyaction refinementDCR graphsdeclarative modelsprime event structurespsi-calculi

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• CC-Pi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ST-structures
• A new approach to abstract syntax with variable binding
• Configuration structures, event structures and Petri nets
• Calculi for synchrony and asynchrony
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• The difference between splitting in \(n\) and \(n+1\)
• Nominal unification
• On the expressiveness of higher dimensional automata
• A Sorted Semantic Framework for Applied Process Calculi
• Types for Resources in $$\psi $$-calculi
• A Sorted Semantic Framework for Applied Process Calculi (Extended Abstract)
• Nominal Sets
• Nested Dynamic Condition Response Graphs
• Psi-calculi: a framework for mobile processes with nominal data and logic
• Typed ψ-calculi
• Broadcast Psi-calculi with an Application to Wireless Protocols
• A Distributed Pi-Calculus
• CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence
• Functions as processes
• Higher dimensional automata revisited
• Adaptable processes
• Mobile values, new names, and secure communication
• Safety, Liveness and Run-Time Refinement for Modular Process-Aware Information Systems with Dynamic Sub Processes
• Program development by stepwise refinement
• CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Refinement of actions and equivalence notions for concurrent systems

This page was built for publication: Declarative event based models of concurrency and refinement in psi-calculi