Modeling concurrency with interval traces

DOI10.1016/j.ic.2016.12.009zbMath1359.68224MaRDI QIDQ515576

Ryszard Janicki, Xiang Yin

Publication date: 16 March 2017

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11375/18319

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Algebraic Structure of Step Traces and Interval Traces, Interval semantics for Petri nets with inhibitor arcs, Relational structures for concurrent behaviours

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Process semantics of general inhibitor nets
• Modelling concurrency with comtraces and generalized comtraces
• Nets, time and space
• Structure of concurrency
• Relational structures model of concurrency
• A formal semantics for concurrent systems with a priority relation
• Concurrent histories: a basis for observing distributed systems
• Fundamentals of modelling concurrency using discrete relational structures
• Partial order semantics and read arcs
• Domain and event structure semantics for Petri nets with read and inhibitor arcs
• Timed testing of concurrent systems
• Contextual nets
• Semantics of inhibitor nets
• Intransitive indifference with unequal indifference intervals
• Betweenness, orders and interval graphs
• On Characterising Distributability
• Modeling Interval Order Structures with Partially Commutative Monoids
• On Interval Process Semantics of Petri Nets with Inhibitor Arcs
• Algebraical Characterisation of Interval-Timed Petri Nets with Discrete Delays
• Mutex Causality in Processes and Traces of General Elementary Nets
• The mutual exclusion problem
• Step traces