scientific article
From MaRDI portal
Publication:2851053
zbMath1272.68243MaRDI QIDQ2851053
Steven Eker, Ambarish Sridharanarayanan, José Meseguer
Publication date: 2 October 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066105825344
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (25)
A set automaton to locate all pattern matches in a term ⋮ Invariant-driven specifications in Maude ⋮ Algebraic simulations ⋮ Model Checking Reconfigurable Petri Nets with Maude ⋮ Specification and analysis of the AER/NCA active network protocol suite in real-time Maude ⋮ Verifiable abstractions for contract-oriented systems ⋮ The rewriting logic semantics project ⋮ Semantics and pragmatics of real-time maude ⋮ Simulating and model checking membrane systems using strategies in Maude ⋮ Metalevel transformation of strategies ⋮ Verifying Reachability-Logic Properties on Rewriting-Logic Specifications ⋮ Session-based concurrency in Maude: executable semantics and type checking ⋮ QMaude: quantitative specification and verification in rewriting logic ⋮ Verification of the ROS NavFn planner using executable specification languages ⋮ From hidden to visible: a unified framework for transforming behavioral theories into rewrite theories ⋮ Equational abstractions ⋮ Strategies, model checking and branching-time properties in Maude ⋮ A language-based approach to modelling and analysis of Twitter interactions ⋮ A Rewriting-Based Model Checker for the Linear Temporal Logic of Rewriting ⋮ Unnamed Item ⋮ A process calculus BigrTiMo of mobile systems and its formal semantics ⋮ An Executable Semantics of Clock Constraint Specification Language and Its Applications ⋮ Formal verification of complex business processes based on high-level Petri nets ⋮ Egalitarian State-Transition Systems ⋮ A Rewriting Semantics for ABEL with Applications to Hardware/Software Co-Design and Analysis
Uses Software
Cites Work
- Myths about the mutual exclusion problem
- Conditional rewriting logic as a unified model of concurrency
- An algebraic verification of a mobile network
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
