Conditional rewriting logic as a unified model of concurrency
From MaRDI portal
Publication:1190488
Recommendations
Cites work
- scientific article; zbMATH DE number 4013996 (Why is no real title available?)
- scientific article; zbMATH DE number 4016167 (Why is no real title available?)
- scientific article; zbMATH DE number 4130339 (Why is no real title available?)
- scientific article; zbMATH DE number 4180819 (Why is no real title available?)
- scientific article; zbMATH DE number 4191145 (Why is no real title available?)
- scientific article; zbMATH DE number 4164155 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3949706 (Why is no real title available?)
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 4033040 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4043232 (Why is no real title available?)
- scientific article; zbMATH DE number 4045127 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 4060701 (Why is no real title available?)
- scientific article; zbMATH DE number 4085643 (Why is no real title available?)
- scientific article; zbMATH DE number 4090765 (Why is no real title available?)
- scientific article; zbMATH DE number 4099289 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 3684925 (Why is no real title available?)
- scientific article; zbMATH DE number 3703962 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3774867 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 3574082 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 4124993 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3316072 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A mathematical approach to nondeterminism in data types
- Actor grammars
- Adjointness in Foundations
- Algebraic semantics
- An abstract formulation for rewrite systems
- Aspects of topoi
- Compiling concurrent rewriting onto the Rewrite Rule Machine
- Completion of a Set of Rules Modulo a Set of Equations
- Computing in systems described by equations
- Concurrent transition systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Fair termination is decidable for ground systems
- From Petri nets to linear logic
- General recursive functions of natural numbers
- Graph expressions and graph rewritings
- Implementing term rewriting by graph reduction: Termination of combined systems
- Infinite trees in normal form and recursive equations having a unique solution
- Initial Algebra Semantics and Continuous Algebras
- On ``On graph rewritings
- On graph rewritings
- Operational and Semantic Equivalence Between Recursive Programs
- Petri nets are monoids
- Subequalizers
- Termination for direct sums of left-linear complete term rewriting systems
- The categorical abstract machine
- The gamma model and its discipline of programming
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The linear abstract machine
- Varieties of chain-complete algebras
- Varieties of ordered algebras
Cited in
(only showing first 100 items - show all)- A connector algebra for P/T nets interactions
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
- Capturing constrained constructor patterns in matching logic
- Narrowing and rewriting logic: from foundations to applications
- Representation and Execution of Petri Nets Using Rewriting Logic as a Unifying Framework
- CPO models for infinite term rewriting
- Transactions and contracts based on reaction systems
- scientific article; zbMATH DE number 1615226 (Why is no real title available?)
- A rewriting semantics for Maude strategies
- Models of Computation: A Tribute to Ugo Montanari’s Vision
- Towards Erlang verification by term rewriting
- Abstraction and model checking of core Erlang programs in Maude
- Programming and symbolic computation in Maude
- Concurrent semantics for fusions: weak prime domains and connected event structures
- Declarative Debugging of Membership Equational Logic Specifications
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Relaxed models for rewriting logic
- Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system
- Model checking TLR* guarantee formulas on infinite systems
- Two Decades of Maude
- Parameterized strategies specification in Maude
- Checking Sufficient Completeness by Inductive Theorem Proving
- Travelling salesman problem in tissue P systems with costs
- scientific article; zbMATH DE number 7559300 (Why is no real title available?)
- A partial evaluation framework for order-sorted equational programs modulo axioms
- An assertional language for the verification of systems parametric in several dimensions (preliminary results)
- Elimination of conditions
- A Maude specification of an object-oriented model for telecommunication networks
- Actor theories in rewriting logic
- Ultraproducts and possible worlds semantics in institutions
- Axiomatizing permutation equivalence
- Formal verification of complex business processes based on high-level Petri nets
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- Resource provisioning strategies for BPMN processes: specification and analysis using Maude
- True concurrency semantics for a linear logic programming language with broadcast communication
- Bi-rewriting, a term rewriting technique for monotonic order relations
- Proving semantic properties as first-order satisfiability
- Relating two categorical models of term rewriting
- On relating rewriting systems and graph grammars to event structures
- Comparing higher-order encodings in logical frameworks and tile logic
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
- Strategy-based proof calculus for membrane systems
- Observational congruences for dynamically reconfigurable tile systems
- Tiling transactions in rewriting logic
- Symbolic computation in Maude: some tapas
- Formal Methods in Software and Systems Modeling
- Conditional bigraphs
- Conditional rewriting logic: Deduction, models and concurrency
- Strategies, model checking and branching-time properties in Maude
- Functional logic programming in Maude
- A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
- Using Maude and its strategies for defining a framework for analyzing Eden semantics
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies
- scientific article; zbMATH DE number 1231654 (Why is no real title available?)
- Concurrent garbage collection for concurrent rewriting
- Backwards type analysis of asynchronous method calls
- Invariant-driven specifications in Maude
- More problems in rewriting
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Compositional reasoning about active objects with shared futures
- Strategy based semantics for mobility with time and access permissions
- A probabilistic approximate logic for neuro-symbolic learning and reasoning
- Structured theories and institutions
- Replicated data types that unify eventual consistency and observable atomic consistency
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- Parallel dynamic semantics of sequential programs with speculative and incremental computation
- A Non-Deterministic Multiset Query Language
- A rewriting based model for probabilistic distributed object systems.
- Toward the concurrent implementation of computational systems
- A new generic scheme for functional logic programming with constraints
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
- Priority rewriting: Semantics, confluence, and conditionals
- A Modular Equational Generalization Algorithm
- CINNI -- a generic calculus of explicit substitutions and its application to \(\lambda\)-, \(\sigma\)- and \(\pi\)-calculi
- Deciding observational congruence of finite-state CCS expressions by rewriting
- Reflection in conditional rewriting logic
- An abstract machine for concurrent modular systems: CHARM
- Comparing Meseguer's rewriting logic with the logic CRWL
- Debugging Maude programs via runtime assertion checking and trace slicing
- Equational formulas and pattern operations in initial order-sorted algebras
- Foundations of the rule-based system \(\rho\,\text{Log}\)
- Verifying a distributed list system: A case history
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- Strict coherence of conditional rewriting modulo axioms
- Algebraic specification of agent computation
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Categorical rewriting of term-like structures
- Tile formats for located and mobile systems.
- Knuth-Bendix completion for non-symmetric transitive relations
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- Combining runtime checking and slicing to improve Maude error diagnosis
- From rewriting logic, to programming language semantics, to program verification
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- A semantics preserving actor translation
- Rewriting semantics of production rule sets
- Dynamic connectors for concurrency
- Compositional specification in rewriting logic
- Solving Sudoku puzzles with rewriting rules
This page was built for publication: Conditional rewriting logic as a unified model of concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190488)
