Conditional rewriting logic as a unified model of concurrency
From MaRDI portal
(Redirected from Publication:1190488)
Recommendations
Cites work
- 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
- 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?)
- 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)- Formal modeling, performance estimation, and model checking of wireless sensor network algorithms in Real-Time Maude
- A rewriting logic approach to operational semantics
- Theorem proving in a mathematical information environment
- An abstract machine for concurrent modular systems: CHARM
- Verifying a distributed list system: A case history
- Parallel dynamic semantics of sequential programs with speculative and incremental computation
- Specification of abstract dynamic-data types: A temporal logic approach
- A hidden agenda
- Actor languages. Their syntax, semantics, translation, and equivalence
- Dynamic connectors for concurrency
- A causal semantics for CCS via rewriting logic
- ELAN from a rewriting logic point of view
- Maude: specification and programming in rewriting logic
- Reflection in conditional rewriting logic
- Logical foundations of CafeOBJ
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Specification of real-time and hybrid systems in rewriting logic
- A Maude specification of an object-oriented model for telecommunication networks
- Actor theories in rewriting logic
- Equational rules for rewriting logic
- Rewriting logic: Roadmap and bibliography
- Observational congruences for dynamically reconfigurable tile systems
- Relating CASL with other specification languages: the institution level.
- Relaxed models for rewriting logic
- Tile formats for located and mobile systems.
- Bisimilarity of open terms.
- Structured theories and institutions
- Interpolation in Grothendieck institutions
- Twenty years of rewriting logic
- Declarative debugging of rewriting logic specifications
- Rewriting semantics of production rule sets
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude
- Elimination of conditions
- Specification and proof in membership equational logic
- Travelling salesman problem in tissue P systems with costs
- A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Applications and extensions of context-sensitive rewriting
- Transactions and contracts based on reaction systems
- Concurrent semantics for fusions: weak prime domains and connected event structures
- A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
- Capturing constrained constructor patterns in matching logic
- Symbolic computation in Maude: some tapas
- Parameterized strategies specification in Maude
- Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system
- Strategies, model checking and branching-time properties in Maude
- Resource provisioning strategies for BPMN processes: specification and analysis using Maude
- Proving semantic properties as first-order satisfiability
- Programming and symbolic computation in Maude
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Formal verification of complex business processes based on high-level Petri nets
- Confluence by critical pair analysis revisited
- Composing proof terms
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
- Executable rewriting logic semantics of Orc and formal analysis of Orc programs
- Executable structural operational semantics in Maude
- Ultraproducts and possible worlds semantics in institutions
- Herbrand theorems in arbitrary institutions
- Semantic foundations for generalized rewrite theories
- Behavioural specification for hierarchical object composition
- Equational formulas and pattern operations in initial order-sorted algebras
- A probabilistic approximate logic for neuro-symbolic learning and reasoning
- Simulating and model checking membrane systems using strategies in Maude
- Metalevel transformation of strategies
- Optimization of rewrite theories by equational partial evaluation
- Safety enforcement via programmable strategies in Maude
- Verification of the ROS NavFn planner using executable specification languages
- CINNI -- a generic calculus of explicit substitutions and its application to -, - and -calculi
- scientific article; zbMATH DE number 1615226 (Why is no real title available?)
- Egalitarian State-Transition Systems
- Certifying term rewriting proofs in ELAN
- Knuth-Bendix completion for non-symmetric transitive relations
- Comparing higher-order encodings in logical frameworks and tile logic
- Comparing cospan-spans and tiles via a Hoare-style process calculus
- Comparing Meseguer's rewriting logic with the logic CRWL
- Tiling transactions in rewriting logic
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- The Maude LTL model checker
- Plan in Maude specifying an active network programming language
- Deduction, strategies, and rewriting
- A formal framework for interactive agents
- Semantic determinism and functional logic program properties
- Using Maude and its strategies for defining a framework for analyzing Eden semantics
- Bigraphs and their algebra
- A rewriting logic approach to operational semantics (extended abstract)
- Partial order reduction for rewriting semantics of programming languages
- Solving Sudoku puzzles with rewriting rules
- Abstraction and model checking of core Erlang programs in Maude
- A rewriting logic framework for soft constraints
- Narrowing and rewriting logic: from foundations to applications
- An institution for graph transformation
- ACUOS: a system for modular ACU generalization with subtyping and inheritance
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- José Meseguer: scientist and friend extraordinaire
- Combining runtime checking and slicing to improve Maude error diagnosis
- Two Decades of Maude
- Rewriting strategies and strategic rewrite programs
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- Weak bisimulation as a congruence in MSOS
- From rewriting logic, to programming language semantics, to program verification
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)
