Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 232,668,048 papers from all fields of science
Search
Sign In
Create Free Account
Concurrency semantics
In computer science, concurrency semantics is a way to give meaning to concurrent systems in a mathematically rigorous way. Concurrency semantics is…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Actor model
Computer science
Petri net
Semantics (computer science)
Broader (2)
Concurrency (computer science)
Formal methods
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
True Concurrency Semantics: Towards a Verification of Timed Systems
S. Guellati
,
Ilham Kitouni
,
Riadh Matmat
,
Djamel-Eddine Saïdouni
International Journal of Embedded and Real-Time…
2014
Corpus ID: 32939873
The model checking algorithms have been widely studied for timed automata, it's a validation technique for automatically…
Expand
2013
2013
Proceedings 7th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2013, Rome, Italy, 23th March 2013
TERMGRAPH
2013
Corpus ID: 7675915
2011
2011
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence
Sara Miner More
,
Pavel Naumov
,
Benjamin Sapp
Annual Conference for Computer Science Logic
2011
Corpus ID: 14421003
Independence between two sets of random variables is a well-known relation in probability theory. Its origins trace back to…
Expand
Review
2008
Review
2008
The Timed Abstract State Machine Language: Abstract State Machines for Real-Time System Engineering
Martin Ouimet
,
K. Lundqvist
Journal of universal computer science (Online)
2008
Corpus ID: 7933536
In this paper, we present the Timed Abstract State Machine (TASM) lan- guage, which is a language for the specification of…
Expand
2006
2006
Timed Use Case Maps
Jameleddine Hassine
,
J. Rilling
,
R. Dssouli
International Conference on Security and…
2006
Corpus ID: 18810385
Scenario-driven requirement specifications are widely used to capture and represent functional requirements. Use Case Maps are…
Expand
1998
1998
Interaction of finite state machines and concurrency models
Bilung Lee
,
Edward A. Lee
Conference Record of Thirty-Second Asilomar…
1998
Corpus ID: 14337269
Hierarchical concurrent finite state machines (HCFSMs) dramatically increase the usability of finite state machines (FSMs…
Expand
1991
1991
Ordinal Processes in Comparative Concurrency Semantics
S. Pinchinat
Annual Conference for Computer Science Logic
1991
Corpus ID: 46598720
When comparing concurrency semantics, one of the main difficulties is to find counter-examples to show that two equivalences do…
Expand
1991
1991
Concurrency semantics based on metric domain equations
J. Bakker
,
J. Rutten
1991
Corpus ID: 118333553
We show how domain equations may be solved in the category of complete metric spaces. For five example languages we demonstrate…
Expand
1991
1991
An Algebra of Concurrent Non-Deterministic Processes
L. Cherkasova
,
V. Kotov
Theoretical Computer Science
1991
Corpus ID: 14978839
1989
1989
Designing Concurrency Semantics
J. Bakker
IFIP Congress
1989
Corpus ID: 43460015
Based on our experience in the design of semantics for several families of parallel languages, we present an expository account…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE